proof of concept, relatively slow no hard tested limits, but is best used with 8-20 char strings if you want fast response times - UPDATE fixed infinity rollovers by adding mod operators and downtuning some multiplication sorry for unsharing and resharing multiple times now you can enter large values and have them actually compute!! :3 (warning!! values over 20 chars have noticeable compute tines, and 50 chars takes a second or two, stalling the whole project.) credit preferred but not required :] see inside for details, can be used to hide/secure values, and to implement passwords can also be used to obfuscate code if you make values correspond to blocks, but this might violate remix culture. im not responsible if that happens :3c all by me nonacron encoder: https://scratch.mit.edu/projects/815255421/
supports nonacron charset : (all alphanumeric characters) (" ,./?!<>:"';{}[]|\)(*&^%$#@`~_+=-☺☻█▓▒░€₤←↑→↓↖↗↘↙×÷␀¯") (ll{l{(l(}I]}|}I){({l{}l[}Il[|(ll){(
