{"schema_version":"source-reader-v1","record":{"source_id":"prime-gaps-246-lean","versions":[{"work":{"authors":["Axiom Math","PrimeGapsLib contributors"],"kind":"research_project","publication":"project","publication_note":"Public formal source; build and independent mathematical review are separate checks.","ai_role":"self_reported","ai_note":"Axiom Math’s formalization work concerns proof translation and certificates; no independent discovery credit is assigned from the repository alone.","artifacts":[{"kind":"formal_code","title":"PrimeGapsLib: a formal deduction of the 246 bound — pinned source","url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","version":"1faa7b14e82ddebc2772dfb9153922f01b106477","assessment":"not_executed","note":"Public source inspected for statement and assumptions; this proof project has not been executed by OpenMath."}],"published":{"value":"2026-08-18"}},"id":"prime-gaps:source:246-lean:v1","source_id":"prime-gaps-246-lean","title":"PrimeGapsLib: a formal deduction of the 246 bound","owner":"Axiom Math, PrimeGapsLib contributors","url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","subject_scope":"The public revision proves prime-gap bounds of 246 assuming Bombieri–Vinogradov and includes numerical certificates. It does not contain the 212 formalization reported in the later paper.","revision":"1faa7b14e82ddebc2772dfb9153922f01b106477","content_sha256":"3c8edc561d416edcef84fe56f53fb2570abd9a837bb2de67766a3b2b279675ab","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-08-18","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","attribution":"Axiom Math, PrimeGapsLib contributors","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"prime-gaps:entry:246-lean:v1","source_version_id":"prime-gaps:source:246-lean:v1","item_id":"246-lean","url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","wording":"The public revision proves prime-gap bounds of 246 assuming Bombieri–Vinogradov and includes numerical certificates. It does not contain the 212 formalization reported in the later paper.","wording_kind":"paraphrase","locator":"README main results; PrimeGaps/Bounded246.lean","supersedes":null}],"problems":[{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7}],"selected_version_id":"prime-gaps:source:246-lean:v1","available_versions":[{"id":"prime-gaps:source:246-lean:v1","revision":"1faa7b14e82ddebc2772dfb9153922f01b106477","observed_on":"2026-10-13","title":"PrimeGapsLib: a formal deduction of the 246 bound","publication":"project","content_sha256":"3c8edc561d416edcef84fe56f53fb2570abd9a837bb2de67766a3b2b279675ab","used_in_current_publications":true}],"usages":[{"id":"source-use-f0285b984475196d2f3c","entry_id":"prime-gaps:entry:246-lean:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Formal deduction from Bombieri–Vinogradov","claim":{"id":"claim-prime-gaps-bv-implies-246","version":1,"slug":"prime-gaps-bv-implies-246","title":"Bombieri–Vinogradov implies recurring gaps at most 246"},"fragment":"claim-prime-gaps-bv-implies-246","assessment":{"id":"prime-gaps:report:246-conditional:v1","entry_id":"prime-gaps:entry:246-lean:v1","state":"resolved","source_label":"Formal deduction from Bombieri–Vinogradov","scope":"The implication to the 246 bound, not a Lean proof of its analytic premise.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-637557217026e3a1f5ed","entry_id":"prime-gaps:entry:246-lean:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"formalization","title":"Lean: 246 from Bombieri–Vinogradov","claim":{"id":"claim-prime-gaps-bv-implies-246","version":1,"slug":"prime-gaps-bv-implies-246","title":"Bombieri–Vinogradov implies recurring gaps at most 246"},"fragment":"claim-prime-gaps-bv-implies-246","assessment":null,"superseded":false,"formalization":{"title":"Lean: 246 from Bombieri–Vinogradov","url":"https://github.com/AxiomMath/PrimeGapsLib/blob/1faa7b14e82ddebc2772dfb9153922f01b106477/PrimeGaps/Bounded246.lean","note":"Complete as an implication with the stated premise. This is the public 246 artifact, not the later reported 212 certificate.","target":{"id":"claim-prime-gaps-bv-implies-246","version":1},"proof_status":"reported_complete","source_entry_ids":["prime-gaps:entry:246-lean:v1"],"declaration":"bombieriVinogradov_implies_frequently_prime_gap_le_246","source_commit":"1faa7b14e82ddebc2772dfb9153922f01b106477","alignment":"staff_linked","checked_on":"2026-10-13"},"update":null},{"id":"source-use-3fab6f62813331ab13d5","entry_id":"prime-gaps:entry:246-lean:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"milestone","title":"A public formal deduction for 246","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-7179eacb0e2da9b95e7e","entry_id":"prime-gaps:entry:246-lean:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"question","title":"How small can prime gaps be?","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-577907862cfd1c9d966b","entry_id":"prime-gaps:entry:246-lean:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"reading","title":"Inspect the formal statement, assumptions and reported checks.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-462074b7d0b0010b3aac","entry_id":"prime-gaps:entry:246-lean:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Bombieri–Vinogradov implies recurring gaps at most 246","claim":{"id":"claim-prime-gaps-bv-implies-246","version":1,"slug":"prime-gaps-bv-implies-246","title":"Bombieri–Vinogradov implies recurring gaps at most 246"},"fragment":"claim-prime-gaps-bv-implies-246","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[{"id":"prime-gaps:entry:246-lean:v1","source_version_id":"prime-gaps:source:246-lean:v1","item_id":"246-lean","url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","wording":"The public revision proves prime-gap bounds of 246 assuming Bombieri–Vinogradov and includes numerical certificates. It does not contain the 212 formalization reported in the later paper.","wording_kind":"paraphrase","locator":"README main results; PrimeGaps/Bounded246.lean","supersedes":null}],"linked_sources":[{"work":{"authors":["Axiom Math","PrimeGapsLib contributors"],"kind":"research_project","publication":"project","publication_note":"Public formal source; build and independent mathematical review are separate checks.","ai_role":"self_reported","ai_note":"Axiom Math’s formalization work concerns proof translation and certificates; no independent discovery credit is assigned from the repository alone.","artifacts":[{"kind":"formal_code","title":"PrimeGapsLib: a formal deduction of the 246 bound — pinned source","url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","version":"1faa7b14e82ddebc2772dfb9153922f01b106477","assessment":"not_executed","note":"Public source inspected for statement and assumptions; this proof project has not been executed by OpenMath."}],"published":{"value":"2026-08-18"}},"id":"prime-gaps:source:246-lean:v1","source_id":"prime-gaps-246-lean","title":"PrimeGapsLib: a formal deduction of the 246 bound","owner":"Axiom Math, PrimeGapsLib contributors","url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","subject_scope":"The public revision proves prime-gap bounds of 246 assuming Bombieri–Vinogradov and includes numerical certificates. It does not contain the 212 formalization reported in the later paper.","revision":"1faa7b14e82ddebc2772dfb9153922f01b106477","content_sha256":"3c8edc561d416edcef84fe56f53fb2570abd9a837bb2de67766a3b2b279675ab","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-08-18","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://github.com/AxiomMath/PrimeGapsLib/tree/1faa7b14e82ddebc2772dfb9153922f01b106477","attribution":"Axiom Math, PrimeGapsLib contributors","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}]}}