Potuz on The Right Way to Hash a Merkle Tree скачать в хорошем качестве

Potuz on The Right Way to Hash a Merkle Tree

Join the Arbitrum community:   / arbitrum   Potuz, a Core Developer at Arbitrum, discusses how we shill an assembly SHA256 library that is optimized to compute the hash tree root of a Merkle tree. It consists of reusing two publicly available methods: 1. Hardcoding padding block. This method is used in Bitcoin's core client hashing algo. 2. Use CPU-vectorization to hash different branches in parallel. This is Intel's "multi-buffer" method. Initial benchmarks show up to a 1200% improvement in hashing of large lists on AVX512. This conversation was recorded at Devcon VI Bogotá 2022. Arbitrum is a technology suite designed to scale Ethereum. You can use Arbitrum chains to do all things you do on Ethereum — use Web3 apps, deploy smart contracts, etc., but your transactions will be cheaper and faster. Join the community, dive into developer docs, bridge your assets and start building your first dApp in only 5 minutes: https://barracuda.io/arbitrum Please like, subscribe, and click 🔔 to get new video updates! #Arbitrum #ArbitrumOne #ArbitrumNova #Devcon