Social Capital Consensus Replaces Financial Stake, Enabling Equitable Decentralization
Proof-of-Social-Capital leverages non-transferable social influence and ZK proofs to secure consensus, fundamentally decoupling network power from wealth.
Adaptive Delegation Weighting Mitigates Proof-of-Stake Centralization Risk
Adaptive Delegation Weighting employs a non-linear reward function to economically disincentivize stake concentration, fundamentally securing DPoS decentralization.
Verifiable Decryption Secures Proposer-Builder Separation against Censorship
A new two-tiered architecture incorporates publicly verifiable decryption, resolving the censorship vulnerability inherent in existing block-building separation models.
Adaptive Byzantine Agreement Achieves Optimal Communication Parameterized by Actual Faults
This protocol introduces adaptive communication complexity to Byzantine Agreement, establishing tight theoretical bounds and optimizing consensus efficiency for real-world fault conditions.
Collaborative SNARKs Enable Private Shared State Computation without Revealing Secrets
Collaborative SNARKs merge ZKPs and MPC to allow distributed parties to jointly prove a statement over private inputs, unlocking secure data collaboration.
Expander Signatures Enable Efficient Constant-Size Verification on Resource-Limited Devices
Expander Signature decouples heavy key generation from verification, enabling resource-limited devices to achieve constant-size, efficient, and forward-secure authentication.
Batched Identity-Based Encryption Enables Selective, Efficient, and Privacy-Preserving Data Access
The new Batched IBE primitive allows public aggregation of decryption rights for specific data subsets, unlocking private, auditable data batching on-chain.
Hyper-Efficient Universal SNARKs Decouple Proving Cost from Setup
HyperPlonk introduces a new polynomial commitment scheme, achieving a universal and updatable setup with dramatically faster linear-time proving, enabling mass verifiable computation.
Post-Quantum Verifiable Delay Functions Eliminate Trusted Setup
Isogeny-based Verifiable Delay Functions leverage endomorphism rings for quantum-secure, trustless, and efficiently verifiable sequential computation.
