Flynn Bettens claims an AI-assisted flag-algebra proof determining the exact asymptotic constant for Erdős Problem #1034 as (36−5√3)/66, with a Zenodo deposit including certificate, verifier, and independent Python verification script.
state: seedheat: mediumuncertainty: mediumnovelscott: lowai-assisted-mathematics flag-algebra erdos-problemsFlynn Bettensflynnnupe
What is this?
The case centers on a single claim by Flynn Bettens (handle flynnupe) that an AI-assisted flag-algebra proof has determined the exact asymptotic constant for Erdős Problem #1034 as (36−5√3)/66, with a Zenodo deposit containing a certificate, verifier, and independent Python verification script. No web search results were returned to corroborate the claim, the Zenodo deposit, or the author's background. The evidence title matches the hypothesis exactly, suggesting the case may be based on a single source (likely the Zenodo record itself or a preprint). Without external confirmation, the existence of the deposit, the correctness of the constant, and the transferability claim remain unverified.
Why it matters to Scott
The case is an unverified single-source claim (Flynn Bettens, Zenodo deposit) that instantiates the pattern Scott's canon argues for — AI-assisted mathematics with mechanically different verifiers and portable proof artifacts — but does not challenge, extend, or bear on any load-bearing claim in his wikis. No consequential party is arriving at his position; it is another data point in a pattern the radar already tracks via Anthropic's Lean formalization, Dots swarm covering record, and Ensemble Prover. Without external corroboration of the deposit or the constant, it does not change what Scott builds or argues.
ip:concept.verification-loopsip:concept.proof-carrying-receiptsip:concept.mechanically-different-verifiersip:concept.decision-attestation-packageip:concept.provenanceip:concept.spec-as-assetip:framework.discovery-acceleratorradar:anthropic-fermat-lean-formalizationradar:dots-swarm-covering-recordradar:claude-orchard-problem-proofradar:ensemble-prover-autonomous-theorem-systemradar:agmai-openai-math-release-adviceradar:doletskyi-agent-incident-corpus
queries asked of Scott's wikis
- ai-assisted mathematics verification pipelines
- flag algebra automation and formal verification
- computer-assisted proof artifact reproducibility
- mathematical constant discovery via AI search
- Zenodo deposit standards for proof certificates
Measured heat
now 0 pts/hpeak 4 pts/hcomments 0/hpeers p0momentum: steady2 platformsage 123h
points/hour across evidence · reading as of 2026-10-12 02:59:37.977291+11:00 · deterministic, not a model opinion
How the heat travelled
pace: p51 vs 1247 stories at the 96h mark (now 123h old) — ahead of curia-claude-code-seat-society (1.1x), behind infermeld-cross-vendor-gguf-llamacpp (0.9x)
Evidence (2) — ⭐ canonical anchor
| source | object | author | score | comments |
|---|
| 🟠 reddit | The Quantitative Constant in Erdős Problem #1034 singularity Retrieved article excerptOpen article · Retrieved 2026-10-08T17:49:31.638983+00:00 Published October 7, 2026
| Version v1
[Preprint](https://zenodo.org/search?q=&f=resource_type%3Apublication%2Binner%3Apublication-preprint)
Open
# The Quantitative Constant in Erdős Problem #1034
### Authors/Creators
- [Bettens, Flynn
(Researcher)](https://zenodo.org/search?q=metadata.creators.person_or_org.name:%22Bettens,+Flynn%22)
## Description
This is a computer-assisted proof of the asymptotic constant in Erdős Problem #1034. The problem asks how many vertices outside a triangle, adjacent to at least two of its vertices, can always be guaranteed in an n-vertex graph with more than n²/4 edges. The paper determines the asymptotic constant as (36 − 5√3)/66 ≈ 0.4142385751841759.
The upper bound uses a six-clique specialization of the Ma–Tang construction. The lower bound uses an order-7 flag-algebra certificate over Q(√3), verified with exact arithmetic.
The deposit includes the paper PDF, exact certificate data, the verification model, an independent Python verifier, and verification instructions. Verification requires Python 3.9 or newer and only its standard library.
## Files
### proof[1].pdf
### Files (1.5 MB)
| Name | Size | [Download all](https://zenodo.org/api/records/23223509/files-archive) |
| --- | --- | --- |
| [certificate.json[1].gz](https://zenodo.org/records/23223509/files/certificate.json%5B1%5D.gz?download=1) md5:2441f7d8cf2e11ca0e58393685935c75 | 933.1 kB | [Download](https://zenodo.org/records/23223509/files/certificate.json%5B1%5D.gz?download=1) |
| [proof[1].pdf](https://zenodo.org/records/23223509/files/proof%5B1%5D.pdf?download=1) md5:76080c434a9638bebac5c3b9391f5860 | 440.4 kB | [Preview](https://zenodo.org/records/23223509/preview/proof%5B1%5D.pdf?include_deleted=0) [Download](https://zenodo.org/records/23223509/files/proof%5B1%5D.pdf?download=1) |
| [README[2].md](https://zenodo.org/records/23223509/files/README%5B2%5D.md?download=1) md5:83aefc6f2ca3cc610e0faab468b81f05 | 682 Bytes | [Preview](https://zenodo.org/records/23223509/preview/README%5B2%5D.md?include_deleted=0) [Download](https://zenodo.org/records/23223509/files/README%5B2%5D.md?download=1) |
| [verification\_model[1].json](https://zenodo.org/records/23223509/files/verification_model%5B1%5D.json?download=1) md5:6ae1d1670adf4d27b65d9f524499b720 | 68.1 kB | [Preview](https://zenodo.org/records/23223509/preview/verification_model%5B1%5D.json?include_deleted=0) [Download](https://zenodo.org/records/23223509/files/verification_model%5B1%5D.json?download=1) |
| [verify[1].py](https://zenodo.org/records/23223509/files/verify%5B1%5D.py?download=1) md5:0dfa8cecdbda0cfe3c943b6fa4a378ae | 21.0 kB | [Download](https://zenodo.org/records/23223509/files/verify%5B1%5D.py?download=1) | | flynnnupe | 12 | 3 |
| 🟧 echo.other ⭐ | Self-published 6-page preprint (Zenodo, CC-BY-4.0, DOI 10.5281/zenodo.23223509). Abstract: "For a triangle T in a graph G, let Y_G(T) be the | Flynn Bettens | — | — |
Interpretation history
2026-10-08T20:54:27Z
origin walked (opencode/cheap-glm, conf 0.9): anchor reddit.post.1x0rdt0 -> echo.other.6a690c4740 by Flynn Bettens
2026-10-08T18:19:39Z
grounded: novel/low — The case is an unverified single-source claim (Flynn Bettens, Zenodo deposit) that instantiates the pattern Scott's canon argues for — AI-assisted mathematics w
2026-10-08T18:06:37Z
case created — Concrete computer-assisted mathematical result with full verification artifact on Zenodo; method claimed transferable to related problems.
Decision trace
- 10-09 07:59attention_routeThe editor compared this story and chose to keep watching.
- 10-09 07:54attention_candidatecreate
- 10-09 07:54promote_anchororigin walk conf 0.9
- 10-09 05:19groundThe case is an unverified single-source claim (Flynn Bettens, Zenodo deposit) that instantiates the pattern Scott's canon argues for — AI-assisted mathematics with mechanically different verifier
- 10-09 05:06createConcrete computer-assisted mathematical result with full verification artifact on Zenodo; method claimed transferable to related problems.