Skip to content
Blockchain LabBlockchain LabTHE VENTURE STUDIO

LibraryScaling2023Design paperCorpus record

HyperNova: Recursive Arguments for Customizable Constraint Systems

HyperNova. Abhiram Kothapalli and Srinath Setty.

HyperNova generalises folding to customisable constraint systems so a recursive proof can follow the arithmetisation the circuit actually uses.

A reading of the public paper. Not a copy, not a benchmark, and not a claim about any later network.

Ask which constraint system is folded. If the answer is 'R1CS' and the circuit is lookups, they are not describing this paper.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
2

Code

Source, repository, and what is actually hosted

  • ePrint 2023/573https://eprint.iacr.org/2023/573
  • 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.

  1. Claim 01 · Paper model

    The defect

    Nova folds R1CS. Systems people wanted to ship were using higher-degree constraints and lookups, which do not fit that relation.

  2. Claim 02 · Paper model

    The proposal

    HyperNova generalises folding to customisable constraint systems so a recursive proof can follow the arithmetisation the circuit actually uses.

  3. Claim 03 · Paper model

    The relation being folded is no longer fixed as plain R1CS.

    Recursion is how a long computation becomes one proof.

  4. Claim 04 · Paper model

    The bound

    This does not make proving free.

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.

  1. 01 The defect

    Observation

    What the study says

    Nova folds R1CS. Systems people wanted to ship were using higher-degree constraints and lookups, which do not fit that relation.

    Model

    What has to hold

    This does not make proving free.

    Falsifier

    What would retire it

    What is the constraint system?

  2. 02 The proposal

    Observation

    What the study says

    HyperNova generalises folding to customisable constraint systems so a recursive proof can follow the arithmetisation the circuit actually uses.

    Model

    What has to hold

    A custom constraint that is wrong is a wrong proof of the wrong statement.

    Falsifier

    What would retire it

    What is the constraint system?

  3. 03 The relation being folded is no longer fixed as plain R1CS.

    Observation

    What the study says

    Recursion is how a long computation becomes one proof.

    Model

    What has to hold

    A custom constraint that is wrong is a wrong proof of the wrong statement.

    Falsifier

    What would retire it

    What is recursed, the step or only the final proof?

  4. 04 The bound

    Observation

    What the study says

    This does not make proving free.

    Model

    What has to hold

    This does not make proving free.

    Falsifier

    What would retire it

    What is the constraint system?

03 Sequence

One action, as an operating tape

  1. 01Choose the constraint system.
  2. 02Fold successive steps.
  3. 03Compress the folding transcript in the recursive argument.
  4. 04What is recursed, the step or only the final proof?

04 Load-bearing

The argument, and where a pitch drops it

  1. What the paper is for

    The cut

    Ask which constraint system is folded. If the answer is 'R1CS' and the circuit is lookups, they are not describing this paper.

    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 custom constraint that is wrong is a wrong proof of the wrong statement.

  2. What happened after

    The cut

    Production folding stacks cite Nova and then this generalisation when they leave R1CS.

    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

    This does not make proving free.

  • Cryptography · Not re-measured

    A custom constraint that is wrong is a wrong proof of the wrong statement.

  • Model · Not re-measured

    It is not a consensus change.

06 Divergence

What happened after the paper

Production folding stacks cite Nova and then this generalisation when they leave R1CS.

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

  4. 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

Nova folds R1CS. Systems people wanted to ship were using higher-degree constraints and lookups, which do not fit that relation.

What the design proposes

  • The relation being folded is no longer fixed as plain R1CS.
  • Recursion is how a long computation becomes one proof.
  • Custom constraints are a benefit only if the verifier's check matches them.

How the mechanism is specified

  • Choose the constraint system.
  • Fold successive steps.
  • Compress the folding transcript in the recursive argument.

What this page does not treat as proven

  • This does not make proving free.
  • A custom constraint that is wrong is a wrong proof of the wrong statement.
  • It is not a consensus change.

Why the desk still reads it

Ask which constraint system is folded. If the answer is 'R1CS' and the circuit is lookups, they are not describing this paper.

09 Lexicon

Terms, opened into the record

CCS
A customisable constraint system, not a single fixed arithmetisation.
Recursion
A proof that verifies a previous proof.

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.

Concepts

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.