State Proofs and Transaction Verification
summary
Conference session argues that state proofs plus transaction verification let phones verify payments by shrinking proofs from kilobytes/megabytes to tens of bytes using vertical trees and vector commitments, avoiding today’s 4‑core 2TB node requirement that leads to censorship by wealth. Practical moves include protocol block witnesses carrying minimal headers, accessed accounts and storage, and code; an EIP for delta writes (SADD/SUB style) to enable postfix parallelism and form compatible transaction groups so subsets or reorderings produce identical side effects, enabling lightweight, local verification.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 3:53Censorship resistance
- 6:21Scalability node requirements
- 7:47State proofs and transaction verification
- 9:55Vertical trees scaling
- 10:16Parallelism layers
- 13:46ACID principles
- 15:50Delta writes transaction groups
- 17:13Transaction verification vision
related talks
30mPractical Zero Knowledge Proofs
25mSuccinct Proofs in Ethereum
22mHow to Make Real Time Proving Possible Today and Why
48mThe Proof Must Go On: Formal Methods in the Theater of Secure Software Development(…)
27mProofs of proofs: incremental verifiability from recursion and accumulation
01h 25mIntroduction to Verifiable Computing
44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacy
01h 01mKey transparency: Blockchain meets NoiseSocket