The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Every Prime Has a Succinct Certificate
Abstract
To prove that a number n is composite, it suffices to exhibit the working for the multiplication of a pair of factors. This working, represented as af string, is of length bounded by a polynomial in $\log _2 n$. We show that the same property holds for the primes. It is noteworthy that almost no other set is known to have the property that short proofs for membership or nonmembership exist for all candidates without being known to have the property that such proofs are easy to come by. It remains an open problem whether a prime n can be recognized in only $\log _2^\alpha n$ operations of a Turing machine for any fixed $\alpha $. The proof system used for certifying primes is as follows. Axiom. $(x,y,1)$. Inference Rules. \[ R_1 :\quad(p,x,a),q \vdash (p,x,qa)\quad\text{provided }x^{(p - 1)/q} \not\equiv 1(\bmod p)\text{ and }q | (p - 1). \]\[ R_2 :\quad(p,x,p - 1) \vdash p\quad\text{provided } x^{p - 1} \equiv 1(\bmod p). \] Theorem 1. pis a theorem$\equiv p$is a prime. Theorem 2. pis a theorem$\supset p$has a proof of$\lceil {4\log _2 p} \rceil $lines.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Minimum partition of a matroid into independent subsets
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.004 · Cited by 444
Factoring Polynomials Over Finite Fields
Berlekamp, E. R. (1967) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1967.tb03174.x · Cited by 317
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Agrawal, M., Kayal, N., & Saxena, N. (2004) · Annals of Mathematics · doi:10.4007/annals.2004.160.781 · Cited by 931
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
On the Structure of Polynomial Time Reducibility
Ladner, R. E. (1975) · Journal of the ACM · doi:10.1145/321864.321877 · Cited by 781
On the complexity of the parity argument and other inefficient proofs of existence
Papadimitriou, C. H. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80063-7 · Cited by 778
Algebraic methods for interactive proof systems
Lund, C., Fortnow, L., Karloff, H., & Nisan, N. (1992) · Journal of the ACM · doi:10.1145/146585.146605 · Cited by 711
Riemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
A Catalog of Complexity Classes
JOHNSON, D. S. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50007-2 · Cited by 556
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Chor, B., & Goldreich, O. (1988) · SIAM Journal on Computing · doi:10.1137/0217015 · Cited by 544
Elliptic curves and primality proving
Atkin, A. O. L., & Morain, F. (1993) · Mathematics of Computation · doi:10.1090/s0025-5718-1993-1199989-x · Cited by 399
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Kabanets, V., & Impagliazzo, R. (2004) · computational complexity · doi:10.1007/s00037-004-0182-6 · Cited by 378
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
On total functions, existence theorems and computational complexity
Megiddo, N., & Papadimitriou, C. H. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90200-l · Cited by 291
Quantum Computers, Factoring, and Decoherence
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995) · Science · doi:10.1126/science.270.5242.1633 · Cited by 289
Complexity Measures for Public-Key Cryptosystems
Grollmann, J., & Selman, A. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217018 · Cited by 282
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Metadata
- Authors
- Pratt, V. R.
- Venue
- SIAM Journal on Computing
- Published
- 1975-09
- Volume
- 4
- Issue
- 3
- Pages
- 214-220
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2045664183
- Cited by
- 309
- References
- 4
- FWCI
- 4.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.