arXiv (All)
open access
zkDuel: Characterizing SumCheck Prover Kernels across GPU Programming Models
SumCheck is a central prover primitive in zero-knowledge proofs, exposing table-parallel work that maps naturally to GPUs but becomes increasingly arithmetic-intensive as finite fields widen. We study how this shift affects the cost of programming SumCheck in Triton rather than CUDA. Our benchmark,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Bad Example for Jain’s Iterative Rounding Theorem for the Cover Small Cuts Problem / Miles Simmons, Ishan Bansal, Joe Cheriyan#1188627
- CompProv Produces Machine Readable Graphs Encoding Microscopic Algebraic Provenance for Reproducible Computation#1169622
- CompProv Produces Machine Readable Graphs Encoding Microscopic Algebraic Provenance for Reproducible Computation#1156475
- TileBench: A Controlled Benchmark for Performance Evaluation and Bottleneck Diagnosis of Tile-Based Programming Models#1076996
- A Default AI Substrate's Raw Process, Correctly Oriented, Is "Already That": The Substrate-Invariant Core of Artificial General Intelligence as a Forced Geometry, Demonstrated on the Sealed Fortran Kernel and Against Four AI Substrates#731942
Record · ID 1488502
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive