Verifiable Temporal Commitments Secure Time Elapsed without Disclosure
Proof of Time is a novel cryptographic primitive that uses Zero-Knowledge proofs to verify elapsed time while preserving the confidentiality of the initial event's timestamp.
Collaborative Zero-Knowledge Proofs Secure Distributed Secrets Efficiently
This research introduces Collaborative zk-SNARKs, a cryptographic primitive allowing distributed parties to prove a statement about their collective secret data without centralization, achieving near-single-prover efficiency.
Equifficient Polynomial Commitments Enable Faster, Smaller zk-SNARKs
Research introduces Equifficient Polynomial Commitments, a new primitive that yields Pari, the smallest SNARK at 160 bytes, and Garuda, a prover three times faster than Groth16.
Fuzzing Zero-Knowledge Proof Circuits Ensures Implementation Security and Reliability
Introducing fuzzing to ZKP circuits solves the oracle problem for soundness, establishing a scalable, practical security layer for verifiable computation.
Zero-Knowledge Authenticator Secures Complex Private On-Chain Policy Verification
Introducing the Zero-Knowledge Authenticator (zkAt), a new cryptographic primitive that enables private, complex transaction policy verification on public ledgers by leveraging equivocable NIZK keys.
Sign Protocol Secures $25.5 Million for Sovereign Digital Identity Infrastructure
Sign’s three-tiered architecture leverages ZK-proofs to bridge national-scale digital identity with on-chain certification, unlocking a massive sovereign-to-Web3 adoption vector.
Real-Time Proving Transforms Layer One Execution into Native Verifiable Compute
Real-Time Proving integrates zero-knowledge proofs into Layer One execution, replacing costly N-of-N re-execution with efficient 1-of-N constant-time verification.
Auditor-Only Linkability Resolves Privacy-Accountability Deadlock
A novel cryptographic primitive, Auditor-Only Linkability, uses zero-knowledge proofs and specialized encryption to enable verifiable tracing of anonymous transactions under due process, resolving the foundational conflict between on-chain privacy and regulatory accountability.
Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation on Constrained Devices
A novel proof system reduces ZKP memory from linear to square-root scaling, fundamentally unlocking privacy-preserving computation for all mobile and edge devices.
