Sublinear Vector Commitments Achieve Optimal Stateless Client Update Efficiency
A new vector commitment scheme achieves sublinear complexity for both global update size and local proof updates, solving the stateless client efficiency trade-off.
Universal Recursive SNARKs Achieve Constant-Size Trustless Blockchain State Verification
Introducing Universal Recursive SNARKs, this breakthrough enables constant-size, universal state proofs, fundamentally solving the problem of stateless client verification.