Private Information Retrieval Secures Stateless Client Proof Verification
TreePIR enables light clients to privately retrieve Merkle proofs from full nodes, fundamentally solving the transaction privacy dilemma in state verification.
Vector Accumulators Enable Logarithmic Stateless Client Verification without Trusted Setup
This new Vector Accumulator primitive decouples state size from client verification cost, achieving logarithmic-time proofs for truly scalable stateless nodes.
Sublinear Commitment Scheme Secures Modular Blockchain Data Availability
A new Succinct Data Availability Commitment enables verifiably secure data publishing without full downloads, radically optimizing modular blockchain scaling.
Sublinear Vector Commitments Enable Stateless Client Scalability
Developing a new vector commitment scheme that achieves sublinear complexity for both update information and proof maintenance, fundamentally optimizing stateless client operation.
New Accumulator Definitions Enable Delegated Stateless Verification
New cryptographic accumulator definitions introduce delegatable proofs, enabling light clients to securely verify state without full synchronization or storage.
FRI Proximity Tests Enable Transparent Logarithmic Data Availability Sampling
FRI-based Data Availability Sampling provides a transparent, post-quantum path to scalable light client verification with logarithmic communication overhead.
Holographic Vector Commitments Enable Logarithmic State Verification for Stateless Clients
This new holographic commitment primitive radically reduces state proof size to logarithmic complexity, enabling trustless, efficient validation on any device.
Information-Theoretic State Compression Secures Distributed Ledger Integrity
This research introduces the State-Trellis structure, leveraging error-correcting codes to achieve constant-time, fixed-size state verification, fundamentally improving light client security.
Polynomial Commitments Secure Erasure Codes for Scalable Data Availability Sampling
Cryptographically-secured erasure codes enable light clients to verify data availability by sampling, resolving the scalability bottleneck for modular architectures.
