Vector Commitments Enable Sublinear State Verification for Stateless Clients
        
        
        
        
          
        
        
      
        
    
        
        A new polynomial vector commitment scheme transforms light clients into secure, stateless verifiers, dramatically improving blockchain decentralization and user security.
        
        Goldwasser-Kalai-Rothblum Protocol Turbocharges Verifiable Computation Efficiency
        
        
        
        
          
        
        
      
        
    
        
        A new proof system architecture uses the sumcheck protocol to commit only to inputs and outputs, achieving logarithmic verification time for layered computations, drastically scaling ZK-EVMs.
        
        Logarithmic-Depth Commitments Enable Truly Stateless Blockchain Verification
        
        
        
        
          
        
        
      
        
    
        
        A new Logarithmic-Depth Merkle-Trie Commitment scheme achieves constant-time verification, enabling light clients to securely validate state without storing it.
        
        Recursive Inner Product Arguments Enable Universal Transparent Polynomial Commitments
        
        
        
        
          
        
        
      
        
    
        
        A novel recursive folding of polynomial commitments into Inner Product Arguments yields universal, transparent proof systems for highly scalable verifiable computation.
        
        Stochastic Networks Enable Logarithmic Broadcast and Consensus Resilience
        
        
        
        
          
        
        
      
        
    
        
        New research reveals that distributed consensus in dynamic, unreliable networks can achieve logarithmic time complexity by embracing stochasticity, overcoming pessimistic deterministic limitations.
