Recursive Proofs
Recursive Proofs is a method in zero-knowledge proof systems that enables a proof to be verified by another proof of the same type, thereby allowing succinct verification of a sequence of computations through iterative proof composition.
77
Publications
6.3K
Citations
130
Authors
73
Institutions
Publications per year
2017–2026
7
77
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Nir Bitansky, Ran Canetti, Alessandro Chiesa et al. · 2013 · 299 citations
Proofs and Refutations: The Logic of Mathematical Discovery.
Daniel Isaacson, Imre Lakatos, John Worrall et al. · The Philosophical Quarterly · 1978 · 280 citations
Humanities, Mathematics, Philosophy +13
1–5 of 77
130
5
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 130
73
Stanford University
Stanford, United States
6 h-index
12 publications
670 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
12 publications
440 citations
University of Oxford
Oxford, United Kingdom
5 h-index
6 publications
133 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
77 citations
Palo Alto Research Center
Palo Alto, United States
2 h-index
2 publications
61 citations
Steklov Mathematical Institute
Moscow, Russia
2 h-index
2 publications
92 citations
Danish National Research Foundation
Copenhagen, Denmark
2 h-index
2 publications
179 citations
Laboratory Preuves, Programmes et Systèmes
Paris, France
2 h-index
2 publications
53 citations
1–8 of 73
5 publications · 107 citations
5
h-index
3 publications · 213 citations
3
h-index
3 publications · 136 citations
3
h-index
3 publications · 35 citations
3
h-index
ENTCS · 3 publications · 2.8K citations
3
h-index
1–5