{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RWILKYPLNQK2IVSKYFA7G2N5G6","short_pith_number":"pith:RWILKYPL","schema_version":"1.0","canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","source":{"kind":"arxiv","id":"1202.3695","version":4},"attestation_state":"computed","paper":{"title":"Deterministic elliptic curve primality proving for a special sequence of numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong","submitted_at":"2012-02-16T20:57:44Z","abstract_excerpt":"We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N) arithmetic operations in the ring Z/NZ, implying a bit complexity that is quasi-quadratic in log N. Notably, neither of the classical \"N-1\" or \"N+1\" primality tests apply to the integers in our sequence. We discuss how this algorithm may be applied, in combination with sieving techniques, to efficiently search for very large primes. This has a"},"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":"1202.3695","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-16T20:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"7e431b0864e4f609ca05a050cb63bda1556015faf5be48d859f43e51e17b6984","abstract_canon_sha256":"a4b2f5fe2a58c9df9ab1bdc097c920f724b4935110ab4767d1bc263946c054cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:30.350837Z","signature_b64":"0gH0zaRLM+3PD1URtksCUyaBlop4xXBRfgoAuXgSt1cDBdtkjPWW9phwocd3KNYY10sWVoi/qggpOJMR7z6tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","last_reissued_at":"2026-05-18T02:22:30.350117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:30.350117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic elliptic curve primality proving for a special sequence of numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong","submitted_at":"2012-02-16T20:57:44Z","abstract_excerpt":"We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N) arithmetic operations in the ring Z/NZ, implying a bit complexity that is quasi-quadratic in log N. Notably, neither of the classical \"N-1\" or \"N+1\" primality tests apply to the integers in our sequence. We discuss how this algorithm may be applied, in combination with sieving techniques, to efficiently search for very large primes. This has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3695","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1202.3695","created_at":"2026-05-18T02:22:30.350235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3695v4","created_at":"2026-05-18T02:22:30.350235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3695","created_at":"2026-05-18T02:22:30.350235+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWILKYPLNQK2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWILKYPLNQK2IVSK","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWILKYPL","created_at":"2026-05-18T12:27:20.899486+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/RWILKYPLNQK2IVSKYFA7G2N5G6","json":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6.json","graph_json":"https://pith.science/api/pith-number/RWILKYPLNQK2IVSKYFA7G2N5G6/graph.json","events_json":"https://pith.science/api/pith-number/RWILKYPLNQK2IVSKYFA7G2N5G6/events.json","paper":"https://pith.science/paper/RWILKYPL"},"agent_actions":{"view_html":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6","download_json":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6.json","view_paper":"https://pith.science/paper/RWILKYPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3695&json=true","fetch_graph":"https://pith.science/api/pith-number/RWILKYPLNQK2IVSKYFA7G2N5G6/graph.json","fetch_events":"https://pith.science/api/pith-number/RWILKYPLNQK2IVSKYFA7G2N5G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/action/storage_attestation","attest_author":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/action/author_attestation","sign_citation":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/action/citation_signature","submit_replication":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/action/replication_record"}},"created_at":"2026-05-18T02:22:30.350235+00:00","updated_at":"2026-05-18T02:22:30.350235+00:00"}