LibraryScaling2022Design paperCorpus record
SuperNova: Proving Universal Machine Executions without Universal Circuits
SuperNova. Abhiram Kothapalli and Srinath Setty.
SuperNova folds a universal machine by switching among circuits without a universal circuit that contains every instruction.
A reading of the public paper. Not a copy, not a benchmark, and not a claim about any later network.
A zkVM pitch should say whether each instruction is folded, or whether one giant circuit is proven every step.
- Evidence
- Primary paper
- Re-measured
- No
- Assumptions
- 3
- Records linked
- 3
Code
Source, repository, and what is actually hosted
- ePrint 2022/1758https://eprint.iacr.org/2022/1758
- The source URL is not a GitHub repository. No code remote is invented.
- Full text is not mirrored. Public availability is not a licence to copy the file onto this site.
- Add to a reading list
01 Claim ledger
What the paper is allowed to say
Each row is a sentence already in the study. The status is the same on every row: a model claim, not a live measurement.
Claim 01 · Paper model
The defect
A folding scheme that only folds one circuit cannot cheaply prove a machine that switches programs.
Claim 02 · Paper model
The proposal
SuperNova folds a universal machine by switching among circuits without a universal circuit that contains every instruction.
Claim 03 · Paper model
Non-uniform computation is the point. The program may change.
Folding commits to the running instance instead of proving it from scratch.
Claim 04 · Paper model
The bound
The paper is not a zkVM product.
02 Three cuts
Observation, model, falsifier
A desk does not stop at the summary. Each claim is cut three ways, using only this study's own assumptions and checks. Nothing here is a new figure.
01 The defect
Observation
What the study says
A folding scheme that only folds one circuit cannot cheaply prove a machine that switches programs.
Falsifier
What would retire it
Is there a universal circuit hiding in the implementation?
02 The proposal
Observation
What the study says
SuperNova folds a universal machine by switching among circuits without a universal circuit that contains every instruction.
Model
What has to hold
The set of circuits still has to be the instruction set you claim.
Falsifier
What would retire it
Is there a universal circuit hiding in the implementation?
03 Non-uniform computation is the point. The program may change.
Observation
What the study says
Folding commits to the running instance instead of proving it from scratch.
Falsifier
What would retire it
What is the running instance?
04 The bound
Observation
What the study says
The paper is not a zkVM product.
Model
What has to hold
The paper is not a zkVM product.
Falsifier
What would retire it
Does the proof switch circuits?
03 Sequence
One action, as an operating tape
- 01Represent the machine step as a circuit from a set.
- 02Fold the current instance into a running claim.
- 03Prove the final claim once.
- 04What is the running instance?
04 Load-bearing
The argument, and where a pitch drops it
What the paper is for
The cut
A zkVM pitch should say whether each instruction is folded, or whether one giant circuit is proven every step.
Why it carries weight
If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.
Where it is dropped
The set of circuits still has to be the instruction set you claim.
What happened after
The cut
Nova is the predecessor for a single circuit. HyperNova generalises the arithmetisation further.
Why it carries weight
If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.
Where it is dropped
A later client, parameter or reward formula is a different object from this paragraph.
05 Register
What has to be true
Model · Not re-measured
The paper is not a zkVM product.
Model · Not re-measured
The set of circuits still has to be the instruction set you claim.
Model · Not re-measured
Folding errors compound if the instance relation is wrong.
06 Divergence
What happened after the paper
Nova is the predecessor for a single circuit. HyperNova generalises the arithmetisation further.
A later client, parameter set, or reward formula is a different object. Cite this paper for the mechanism. Cite a primary release for the network. This desk has not re-run the proof.
07 Pre-mortem
What to check before you use the idea
- 0 of 3 marked on this browser. A mark is a reading note, not a pass, a rating, or a recommendation.
08 Anatomy
The paper, in the order a builder needs
The problem it names
A folding scheme that only folds one circuit cannot cheaply prove a machine that switches programs.
What the design proposes
- Non-uniform computation is the point. The program may change.
- Folding commits to the running instance instead of proving it from scratch.
- A universal circuit is the design this paper refuses.
How the mechanism is specified
- Represent the machine step as a circuit from a set.
- Fold the current instance into a running claim.
- Prove the final claim once.
What this page does not treat as proven
- The paper is not a zkVM product.
- The set of circuits still has to be the instruction set you claim.
- Folding errors compound if the instance relation is wrong.
Why the desk still reads it
A zkVM pitch should say whether each instruction is folded, or whether one giant circuit is proven every step.
09 Lexicon
Terms, opened into the record
- Folding
- Compressing two instances of a relation into one instance.
- Universal circuit
- One circuit that interprets every program, which this paper avoids.
10 Repository
Every linked record on this page
Underlined words open a page that already exists: a concept, a protocol profile, a failure record, or another paper. If a word is not underlined, this desk does not have a record for it.
This is Blockchain Lab's reading of a public design paper. It is not the paper, not a copy of it, and not an offer of tokens, equity, custody or a partnership. Later network behaviour can diverge from the text. Nothing here is investment, legal or technical advice.
Research status: Design paper. Last reviewed: 1 October 2026. This is a reading of a public paper, not investment, legal or security advice.