Poseidon is a super elegant hash function, part 2:

Even an optimized STARK arithmetization can fit into a single screenshot

Chasing Curiosity. Empathetic Accelerationist. Founding Fullstack Engineer @icebreaker. YC S16, KB7. 
icbk.me/tayyab.fc

It's a degree-5 function from a size-192 list of primes mod 2^31-1 to a size-176 list of primes mod 2^31-1, which evaluates to true only if the last eight items of the input are the Poseidon2 hash output of the first sixteen items of the input. This is useful for making hyper-optimized STARK proofs of hashes, which in turn is useful for STARKing anything blockchain-related, and potentially a (quantum-safe) replacement for verkle trees.

Thanks Vitalik, now can you explain what this wizardry is?

Systems engineer, budding crypto enthusiast, 10K/half-marathon runner 🏃🏾

Most code I write is not meant for production use, so the only value of it is other people looking at it!

So of course I try hard to document. And the above is only an intermediate product.

My favorite part of this is that the programmer actually commented/documented the code 🤯😆🎩

I have no idea what this means but I’m happy that there are ppl in the world who do

Honestly I don't know what does it mean ,
But I'm be glad if others tell me that I'm not alone in the case :((((

Amazing !

Goes to show how efficient the Poseidon hash function can be!

screenshot essays have just went to a whole new level

It's impressive to see how much efficiency can be packed into Poseidon's design. Demonstrating that an optimized STARK arithmetization can be so compact is a testament to the elegance and power of this hash function. Truly a game-changer in the realm of cryptographic primitives!