Glock: Bitcoin Off-Chain Verification with Minimal On-Chain Cost
A new cryptographic primitive, Glock, dramatically reduces on-chain costs for Bitcoin off-chain computation verification, enabling scalable, secure decentralized applications.
Sublinear Prover Memory Revolutionizes Zero-Knowledge Proof Efficiency
This research introduces the first sublinear-space zero-knowledge prover, transforming proof generation for resource-constrained devices and large-scale applications.
Proof-of-Randomness Consensus Introduces Macau Algorithms for Fair, Low-Energy Blockchains.
A novel Proof-of-Randomness protocol leverages true random number generators for a physically fair and energy-efficient blockchain consensus, defining a new class of randomized algorithms.
Sublinear ZKP Prover Revolutionizes Verifiable Computation for Constrained Devices
A novel zero-knowledge proof prover architecture drastically reduces memory requirements, enabling ubiquitous verifiable computation on resource-limited hardware.
Group Verifiable Random Functions Advance Anonymous Token Scalability
A new cryptographic primitive, Group Verifiable Random Functions, enables anonymous, scalable token issuance by decentralizing randomness generation.
Batch Processing Eliminates MEV in Automated Market Makers
This research introduces a novel batch-processing mechanism for Automated Market Makers, fundamentally mitigating Miner Extractable Value and fostering equitable transaction execution.
Pseudorandom Codes Enhance AI Watermarking with Provable Cryptographic Security
This research introduces novel pseudorandom error-correcting codes, a cryptographic primitive for provably secure and tamper-resistant watermarking of generative AI outputs.
Practical Distributed Broadcast Encryption Eliminates Centralized Key Escrow
This research introduces practical distributed broadcast encryption schemes, enabling secure group messaging without a trusted central authority.
Nova: Efficient Recursive Zero-Knowledge Proofs for Incremental Computation
Nova introduces a novel protocol for incrementally verifiable computation using folding schemes, dramatically reducing proof size and verifier overhead for sequential computations.