Research corpus PrivacyBLC-STUDY-0101

Nova: Recursive Zero-Knowledge Arguments from Folding Schemes

Incrementally verifiable computation without putting a SNARK inside a SNARK. A folding scheme compresses two instances of a computation into one instance of the same size. Repeating that fold is the recursion. The paper is about prover cost, not about a chain.

Official external source only
Design paper
Official source

Compare

Record

Authors: Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla
Date: 2021
Publisher: Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla
Version: Source cited by the 2021 study. The study is the reading. This page does not add a second essay.
Document ID: BLC-STUDY-0101
DOI: None recorded
Last reviewed: 1 October 2026
Licence: No licence recorded. Rights status under review.

No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.

Direct answer

Where to read

Official source — ePrint 2021/370
Blockchain Lab study, the canonical readingOriginal commentary. Not a transcription of the paper.

Metadata and commentary only. The reading is the study page.

Full text

Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.

What changed

The study separates the text from later network behaviour. This bibliographic page does not repeat that essay.

Relationships

Canonical readingNova study
Related paperHalo
Related paperPLONK
Related paperCairo

Cite this record

These citations point at the source document. They are not a licence to copy it.

Author–date

Kothapalli, A., Setty, S., & Tzialla, I. (2021). Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla. https://eprint.iacr.org/2021/370

BibTeX

@techreport{nova2021,
  title = {Nova: Recursive Zero-Knowledge Arguments from Folding Schemes},
  author = {Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla},
  year = {2021},
  institution = {Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla},
  url = {https://eprint.iacr.org/2021/370},
  note = {Rights status: Official external source only. Blockchain Lab record: https://blockchainlab.com/research/corpus/papers/nova}
}

RIS

TY  - RPRT
TI  - Nova: Recursive Zero-Knowledge Arguments from Folding Schemes
AU  - Abhiram Kothapalli
AU  - Srinath Setty
AU  - Ioanna Tzialla
PY  - 2021
PB  - Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla
UR  - https://eprint.iacr.org/2021/370
N1  - Rights status: Official external source only
ER  -

CSL-JSON

[
  {
    "type": "report",
    "id": "BLC-STUDY-0101",
    "title": "Nova: Recursive Zero-Knowledge Arguments from Folding Schemes",
    "author": [
      {
        "literal": "Abhiram Kothapalli"
      },
      {
        "literal": "Srinath Setty"
      },
      {
        "literal": "Ioanna Tzialla"
      }
    ],
    "issued": {
      "date-parts": [
        [
          2021
        ]
      ]
    },
    "publisher": "Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla",
    "URL": "https://eprint.iacr.org/2021/370",
    "note": "Rights status: Official external source only. Not a licence to republish the paper."
  }
]

JSON BibTeX file RIS file CSL-JSON

Rights record

Source status: Official source
Use status: Metadata and commentary only. The reading is the study page.
Rights: Official external source only
Training and retrieval: Not permitted from this site. There is no rights-cleared full text to retrieve or to train on.

Rights and licensing Corrections