Constraint-Reduced Circuits Achieve Orders of Magnitude Faster Zero-Knowledge Proving
New Constraint-Reduced Polynomial Circuits (CRPC) primitives cut ZKP complexity from cubic to linear, unlocking practical verifiable AI and ZK-EVMs.
Off-Chain Influence Proofness Secures Transaction Fee Mechanism Design
Introducing "Off-Chain Influence Proofness," a new desideratum proving that EIP-1559 enables miner censorship threats, which a Cryptographic Second Price Auction can mitigate.
Formalizing Liveness Accountability Requires Honest Majority and Majority Synchrony
New theoretical framework precisely defines when and how consensus protocols can cryptographically blame nodes for stalling transaction finality.
New Transparent Recursive Commitment Scheme Eliminates Trusted Setup Efficiency Trade-Off
LUMEN introduces a novel recursive polynomial commitment scheme, achieving transparent zk-SNARK efficiency on par with trusted-setup protocols.
Formal MEV Theory Enables Provable Security against Transaction Reordering Attacks
A formal, abstract MEV theory rigorously defines adversarial gain via knowledge axiomatization, enabling proofs of smart contract security.
Proof of Crowdsourcing Work Transforms Wasted Mining Energy into Useful Computation
Proof of Crowdsourcing Work (PoCW) leverages miner computation for general crowdsourced tasks, establishing a dual-purpose, energy-efficient consensus mechanism.
Robust Distributed Arrays Secure Data Availability Sampling without Honest Majority
This research introduces Robust Distributed Arrays, a novel distributed data structure that secures the DAS networking layer against malicious actors without relying on an honest majority assumption.
Zero-Knowledge Mechanisms Enable Private Rules with Public Verifiability
This framework introduces a new cryptographic primitive that allows mechanism rules to remain secret while using ZKPs to publicly verify incentive compatibility and outcomes, removing the need for a trusted mediator.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
