ExplodoNum.sb3

Instructions

The thumbnail isn't clickbait. It leaves Graham's number in the dust. This here is ExplodoNum.sb3, whose name was legally changed from OmegaExpantaNum because it did not describe it. This is an expansion of Negative ExpantaNum.sb3 ( https://scratch.mit.edu/projects/941144494 ), which is a modification of ExpantaNum.sb3 (https://scratch.mit.edu/projects/341897963/ ), which is a derivative of OmegaNum.sb3 ( https://scratch.mit.edu/projects/337265163/ ), and is backwards compatible with all of these. This took nearly six months to develop, so it was a wild ride to reach a point where it could represent numbers up to a whole about f_(ω2+1)(200000) in the FGH, 10{{{1}}}200000 = {10, 200000, 1, 3} in BON (bracket operator notation)/BEAF/BAN, about E10##10##10#200000 in Extended Hyper-E Notation, and [2, 1]200000.0102 ≈ N2.1 in PAN/PLN. For usage, click "See Inside" then enter into the "ExplodoNum.sb3" sprite. Then click on the button in the lower-right corner of the scripting area (it should look like two lines and is under the two zoom magnifiying glass buttons) for the manual. If you feel like using it, then backpack it. Delete comment boxes and example scripts before backpacking the sprite though, since they are just for demo purposes or part of the manual. *ADVANTAGES* > Can represent and perform operations on numbers up to [2, 1]200000.0102 ≈ 10{{{1}}}200000 using PsiCubed2's array notation and Bowers' bracket operator notation respectively > Data is stored using a variable (albeit it is converted into a list for computation, and then the entries of that list is turned into another list for diagonalization, but you'd only need to worry about that if you are to make a modification of this engine) > Very fast at low values below ~10↑↑↑↑↑↑↑↑↑↑10 and reasonably fast below ~10{{10}}10 > Complete support and knowledge of negatives *DISADVANTAGES* > The user is required to keep track of normal and encoded, even if it is possible to programmatically determine what is what. > Every operation requires use of the engine. That includes HOFs (higher order functions - a function whose domain and range include functions, operators here). > Gets very slow for every single arrow you add, even if the engine tries to not call itself recursively too far. > Only a single displaying format so far, although it can be tweaked. Ok, yes, I may have gone overboard on that thumbnail image. But I already went far with Negative ExpantaNum's thumbnail, so what's the point? *Tell me if there are any bugs*