An amulet by the defintion is a poem that is less tha 64 bytes in Unicode and the hexidecimal SHA-256 hash includes 4 or more 8s in a row

If you want to learn more about them I recommend reading the original amulet webpage

Obviously the probability of randomly guessing the strings that give consecutive 8s in their hash is extremely low

/// the maths is kinda hard for this i think

So let us instead use our wonderful computers. C++ is an obvious choice for this as we need pure raw speed. I do suck at coding so to make things simpler for myself lets just generate a bunch of sentences and save them in a huge file which we can then crawl through.


First we need a dataset of sentences to use. Then generate a bunch of permutations of the sentences to create an even bigger dataset, finally you just gotta hash all the data and find all the good stuff.