Sublonk: Sublinear prover plonk
We propose SublonK---a new succinct non-interactive argument of knowledge (SNARK).
SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …
SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …
Tight zk cpu: Batched zk branching with cost proportional to evaluated instruction
We explore Zero-Knowledge Proofs (ZKPs) of statements expressed as programs written in
high-level languages, eg, C or assembly. At the core of executing such programs in ZK is the …
high-level languages, eg, C or assembly. At the core of executing such programs in ZK is the …
Dora: A simple approach to zero-knowledge for RAM programs
Existing protocols for proving the correct execution of a RAM program in zero-knowledge are
plagued by a processor expressiveness tradeoff: supporting fewer instructions results in …
plagued by a processor expressiveness tradeoff: supporting fewer instructions results in …
[PDF][PDF] Dora: A Simple Approach to Zero-Knowledge for RAM Programs
Existing protocols for proving the correct execution of a RAM program in zero-knowledge are
plagued by a processor expressiveness tradeo: supporting fewer instructions results in …
plagued by a processor expressiveness tradeo: supporting fewer instructions results in …
RAMenPaSTA: Parallelizable Scalable Transparent Arguments of Knowledge for RAM Programs
KH Tang, M Pham, CN Ngo - Cryptology ePrint Archive, 2024 - eprint.iacr.org
Abstract Incremental Verifiable Computation (IVC) allows a prover to prove to a verifier the
correct execution of a sequential computation. Recent works focus on improving the …
correct execution of a sequential computation. Recent works focus on improving the …
MuxProofs: Succinct Arguments for Machine Computation from Vector Lookups
Z Di, L **a, W Nguyen, N Tyagi - … on the Theory and Application of …, 2025 - Springer
Proofs for machine computation prove the correct execution of arbitrary programs that
operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
An Efficient SNARK for Field-Programmable and RAM Circuits
J Jang, J Judd - Cryptology ePrint Archive, 2024 - eprint.iacr.org
The advancement of succinct non-interactive argument of knowledge (SNARK) with constant
proof size has significantly enhanced the efficiency and privacy of verifiable computation …
proof size has significantly enhanced the efficiency and privacy of verifiable computation …
Scalable Infrastructure for Digital Currencies
GD Ramseyer - 2023 - search.proquest.com
Recent years have seen a significant increase in interest among policymakers and financial
institutions in digital currencies and a new generation of financial infrastructure. This thesis …
institutions in digital currencies and a new generation of financial infrastructure. This thesis …