The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in \(n^{\frac{1}{2}+o(1)}\) rounds (Q6665752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in \(n^{\frac{1}{2}+o(1)}\) rounds |
scientific article; zbMATH DE number 7969785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in \(n^{\frac{1}{2}+o(1)}\) rounds |
scientific article; zbMATH DE number 7969785 |
Statements
The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in \(n^{\frac{1}{2}+o(1)}\) rounds (English)
0 references
17 January 2025
0 references
cloud computing
0 references
primality testing
0 references
proof-of-work certificate
0 references
