Research corpus PrivacyBLC-STUDY-0168

Pinocchio: Nearly Practical Verifiable Computation

Compile the program to a quadratic arithmetic program and prove it was satisfied. Verification is a small number of pairings, independent of the program's length, after a trusted setup.

Official external source only
Design paper
Official source

Compare

Record

Authors: Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova
Date: 2013
Publisher: Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova
Version: Source cited by the 2013 study. The study is the reading. This page does not add a second essay.
Document ID: BLC-STUDY-0168
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

Compile the program to a quadratic arithmetic program and prove it was satisfied. Verification is a small number of pairings, independent of the program's length, after a trusted setup.

Where to read

Official source — ePrint 2013/279
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

A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name.

Relationships

Canonical readingPinocchio study
Related paperGroth16
Related paperPLONK

Cite this record

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

Author–date

Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013). Pinocchio: Nearly Practical Verifiable Computation. Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova. https://eprint.iacr.org/2013/279

BibTeX

@techreport{zksnarkpinocchio2013,
  title = {Pinocchio: Nearly Practical Verifiable Computation},
  author = {Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova},
  year = {2013},
  institution = {Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova},
  url = {https://eprint.iacr.org/2013/279},
  note = {Rights status: Official external source only. Blockchain Lab record: https://blockchainlab.com/research/corpus/papers/zksnark-pinocchio}
}

RIS

TY  - RPRT
TI  - Pinocchio: Nearly Practical Verifiable Computation
AU  - Bryan Parno
AU  - Jon Howell
AU  - Craig Gentry
AU  - Mariana Raykova
PY  - 2013
PB  - Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova
UR  - https://eprint.iacr.org/2013/279
N1  - Rights status: Official external source only
ER  -

CSL-JSON

[
  {
    "type": "report",
    "id": "BLC-STUDY-0168",
    "title": "Pinocchio: Nearly Practical Verifiable Computation",
    "author": [
      {
        "literal": "Bryan Parno"
      },
      {
        "literal": "Jon Howell"
      },
      {
        "literal": "Craig Gentry"
      },
      {
        "literal": "Mariana Raykova"
      }
    ],
    "issued": {
      "date-parts": [
        [
          2013
        ]
      ]
    },
    "publisher": "Bryan Parno, Jon Howell, Craig Gentry and Mariana Raykova",
    "URL": "https://eprint.iacr.org/2013/279",
    "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