MORPH reformulates ZKP MSM and NTT kernels into GEMM operations for TPUs using a new Big-T complexity model, achieving up to 10x NTT throughput over GZKP.
On the size of pairing-based non-interactive arguments
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5representative citing papers
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
Semantic Non-Assembly defines privacy via architectural inertness that blocks sub-threshold coalitions from assembling predicate inputs, with ProVerif verification of four properties in a two-channel architecture and a Birthmark Standard for constrained hardware.
In non-modular polymatroidal service markets, revenue-optimal DSIC mechanisms cannot also be credible for strategic operators, with tight welfare-loss bounds on the Cost of Non-Credibility across network topologies.
Proposes cryptographic certificates of validity by translating logical policy predicates into succinct proof systems for verifying AI agent actions.
citing papers explorer
-
Enabling AI ASICs for Zero Knowledge Proof
MORPH reformulates ZKP MSM and NTT kernels into GEMM operations for TPUs using a new Big-T complexity model, achieving up to 10x NTT throughput over GZKP.
-
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
-
Semantic Non-Assembly: Privacy by Architectural Inertness Under Component Exposure
Semantic Non-Assembly defines privacy via architectural inertness that blocks sub-threshold coalitions from assembling predicate inputs, with ProVerif verification of four properties in a two-channel architecture and a Birthmark Standard for constrained hardware.
-
Credibility Trilemma in Polymatroidal Service Markets
In non-modular polymatroidal service markets, revenue-optimal DSIC mechanisms cannot also be credible for strategic operators, with tight welfare-loss bounds on the Cost of Non-Credibility across network topologies.
-
Cryptographic certificates of validity for trustworthy AI
Proposes cryptographic certificates of validity by translating logical policy predicates into succinct proof systems for verifying AI agent actions.