evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_e7c83e20336f0b96"}
- id
- vea_6ea7c32b85ccd9e2
- frontier
- Erdős problems frontier
- source
- vs_cffdf9c10f0c54ba
- finding
- vf_b02751141ee46bce
finding binding
boundopen_question
Erdős Problem #1056 remains OPEN. Statement: Let $k ≥ 2$. Does there exist a prime $p$ and consecutive intervals $I_0,\dots,I_k$ such that $\prod\limits_{n{\in}I_i}n \equiv 1 \mod n$ for all $1 \le i \le k$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A060427.
source binding
source-boundcap_61973ee16b553d57 · vc_e7c83e20336f0b96
vs_cffdf9c10f0c54ba
review context
unverified2 events
2 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_e7c83e20336f0b96"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_928b25134531c709
caveats
No caveats recorded.
Review, event, and evaluation records
4events
vev_08815bb4e7ee548dfinding.notedExternal corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #1056 (listed in erdos_problems_attempted.txt of google-deepmind/alphaproof-nexus-results@0647711a7118) and did not solve it (9 of 242 attempted Erdős problems solved). Their Lean formalization of the statement lives in google-deepmind/formal-conjectures. Treat as evidence the open obligations here are genuine, not low-hanging.
reviewer:will-blair · 2026-06-10
vev_500df26a666ab310finding.assertedCandidate claim vc_e7c83e20336f0b96 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_131a2323d5c2a903finding.noteExternal corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #1056 (listed in erdos_problems_attempted.txt of google-deepmind/alphaproof-nexus-results@0647711a7118) and did not solve it (9 of 242 attempted Erdős problems solved). Their Lean formalization of the statement lives in google-deepmind/formal-conjectures. Treat as evidence the open obligations here are genuine, not low-hanging.
applied · agent:nexus-ingest-2026-06-10 · 2026-06-10
vpr_525bfa80249883d7finding.addCandidate claim vc_e7c83e20336f0b96 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.