{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G3QBDEDJEZXJ44MZV7JDAPJ3IE","short_pith_number":"pith:G3QBDEDJ","schema_version":"1.0","canonical_sha256":"36e0119069266e9e7199afd2303d3b4131eb8607fb2fb6a3902d51415887a7f7","source":{"kind":"arxiv","id":"2606.22851","version":1},"attestation_state":"computed","paper":{"title":"Faster enumeration of primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SC"],"primary_cat":"math.NT","authors_text":"David Harvey","submitted_at":"2026-06-22T04:54:20Z","abstract_excerpt":"We describe several new algorithms for finding all prime numbers up to a given bound $N$, achieving the first ever speedup by a positive power of $\\log N$ over the ancient sieve of Eratosthenes. The fastest version, which is not fully rigorous, runs in \\[ N (\\log \\log N)^{1+o(1)} \\] bit operations when analysed in the multitape Turing model. This improves on the best existing algorithms due to Pritchard (1981), Atkin--Bernstein (2004) and Sergeev (2016) by a factor of almost $\\log N$. We also present a rigorous randomised (Las Vegas) variant that is slower by a factor of $(\\log \\log N)^{1+o(1)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.22851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T04:54:20Z","cross_cats_sorted":["cs.DS","cs.SC"],"title_canon_sha256":"d8e0cfb6eecf51f16ba84f369b1a6e80e906a40e278dde63d4876dd794e7b99a","abstract_canon_sha256":"c3592f8b4d36d63ad4e57d20ce3d211046f46a19b3d7d89d9cda1d402e24898e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:01.449908Z","signature_b64":"mggVEfxrE1cx586xelhGDK6YpD8eMqsRCEm3W40qnblZhpNLcmr+q4qLVzWUtDH9MpY4rqMyHKiGKHPtMaf3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36e0119069266e9e7199afd2303d3b4131eb8607fb2fb6a3902d51415887a7f7","last_reissued_at":"2026-06-23T03:14:01.449441Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:01.449441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster enumeration of primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SC"],"primary_cat":"math.NT","authors_text":"David Harvey","submitted_at":"2026-06-22T04:54:20Z","abstract_excerpt":"We describe several new algorithms for finding all prime numbers up to a given bound $N$, achieving the first ever speedup by a positive power of $\\log N$ over the ancient sieve of Eratosthenes. The fastest version, which is not fully rigorous, runs in \\[ N (\\log \\log N)^{1+o(1)} \\] bit operations when analysed in the multitape Turing model. This improves on the best existing algorithms due to Pritchard (1981), Atkin--Bernstein (2004) and Sergeev (2016) by a factor of almost $\\log N$. We also present a rigorous randomised (Las Vegas) variant that is slower by a factor of $(\\log \\log N)^{1+o(1)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22851","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22851/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.22851","created_at":"2026-06-23T03:14:01.449500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22851v1","created_at":"2026-06-23T03:14:01.449500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22851","created_at":"2026-06-23T03:14:01.449500+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3QBDEDJEZXJ","created_at":"2026-06-23T03:14:01.449500+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3QBDEDJEZXJ44MZ","created_at":"2026-06-23T03:14:01.449500+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3QBDEDJ","created_at":"2026-06-23T03:14:01.449500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE","json":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE.json","graph_json":"https://pith.science/api/pith-number/G3QBDEDJEZXJ44MZV7JDAPJ3IE/graph.json","events_json":"https://pith.science/api/pith-number/G3QBDEDJEZXJ44MZV7JDAPJ3IE/events.json","paper":"https://pith.science/paper/G3QBDEDJ"},"agent_actions":{"view_html":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE","download_json":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE.json","view_paper":"https://pith.science/paper/G3QBDEDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22851&json=true","fetch_graph":"https://pith.science/api/pith-number/G3QBDEDJEZXJ44MZV7JDAPJ3IE/graph.json","fetch_events":"https://pith.science/api/pith-number/G3QBDEDJEZXJ44MZV7JDAPJ3IE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE/action/storage_attestation","attest_author":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE/action/author_attestation","sign_citation":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE/action/citation_signature","submit_replication":"https://pith.science/pith/G3QBDEDJEZXJ44MZV7JDAPJ3IE/action/replication_record"}},"created_at":"2026-06-23T03:14:01.449500+00:00","updated_at":"2026-06-23T03:14:01.449500+00:00"}