Hi all, reading up on Solana's POH.

Their proof is a long merkle of hashes with transaction data mixed in.

They claim this reduces the effectiveness of ASICSs as they can't do massive parralization.

So my question is.  On a modern day ASIC with say xxTHs how many parralel iterarive hashes can they achieve per second?

 

Very cool thanks :-)