mleku on Nostr: no, it's not a mersenne. but due to its foundational numbers, if i remember correctly ...

no, it's not a mersenne. but due to its foundational numbers, if i remember correctly it's based on 7? i could be wrong, mersenne primes allow several shortcuts and you can read about them by asking a clanker about Peter Wuille's optimizations in libsecp256k1. there's montgomery thingies, and mersenne thingies, and several others. I successfully took the very slow, 32 bit limb based version written in Go for BTCD and brought its performance within half of the performance of the assembler optimized libsecp256k1 without doing any assembler optimizations, by implementing most of the same optimizations for pubkey derivation, signature computing and verification. verification is the slowest of all of them. pubkey derivation is the one that you use to generate vanity npubs, like mine with mlek0 at the end. verification is the one that the assembler optimization hits the hardest, signing and key derivation on my implementation are even closer than 50% of the performance.