proposed
reason
Candidate claim vc_c0bc8dce9a810f0b imported from artifact packet cap_6fcdb44f3a2ff0c6
finding type
theoretical
proposed confidence
0.99
confidence basis
agent-imported candidate claim; reviewer acceptance required
frontiers / frontier
Formal-conjectures Lean proofs (kernel-verified)
- id
- vfr_97d7d25957384f80
- license
- CC-BY-4.0
- findings
- 2
- accepted core
- 0
- contested
- 0
- links
- 0
- sources
- 2
- evidence
- 2
- avg conf
- 0.99
e4/4 · finding.asserted · reviewer:will · 2026-06-03 · null→5d1d
Reviewable change
back to reviewadd a finding
acceptedThe Lean 4 theorem `Erdos1054.f_undefined_at_2` — f 2 = 0 — for the Erdős-1054 function f(n) = least m such that n is a sum of the k smallest divisors of m (some k ≥ 1), f is UNDEFINED at n=2 (junk value 0). Proof: any such sum is 1 + R where the i=0 term is the least divisor 1 and every other term is 0 or a strictly larger divisor (≥ 2), so the sum is never 2. — is formally proven and kernel-verified in formal-conjectures (zero `sorry`, no extra axioms). Verifier: lean4-kernel + Mathlib v4.27.0 (lake build green; `#print axioms` = [propext, Classical.choice, Quot.sound] only — NO sorryAx).
- id
- vpr_46734a4a9d2acfe0
- frontier
- Formal-conjectures Lean proofs (kernel-verified)
- kind
- finding.add
- created
- 2026-06-03
- findings
- +1
- state
- null → 5d1df621
accept gate
1 of 4 on record- —
- signature
- reviewer:will · no key registered on this bundle
- ✓
- chain
- null → 5d1df621
- —
- witness
- no verifier attachment on record for this target
- —
- grade
- in state · unreviewed
timeline
- 2026-06-03proposeproposed · finding.addagent:canopus-lean-2026-06-03
vpr_46734a4a9d2acfe0Candidate claim vc_c0bc8dce9a810f0b imported from artifact packet cap_6fcdb44f3a2ff0c6 - 2026-06-03acceptfinding.assertedreviewer:will
null→5d1df621vev_8e115d71ace1e871Candidate claim vc_c0bc8dce9a810f0b imported from artifact packet cap_6fcdb44f3a2ff0c6
provenance
proposed by
agent:canopus-lean-2026-06-03
actor type
agent
created at
2026-06-03
target type
finding
affected
inspect finding →The Lean 4 theorem `Erdos1054.f_undefined_at_2` — f 2 = 0 — for the Erdős-1054 function f(n) = least m such that n is a sum of the k smallest divisors of m (some k ≥ 1), f is UNDEFINED at n=2 (junk value 0). Proof: any such sum is 1 + R where the i=0 term is the least divisor 1 and every other term is 0 or a strictly larger divisor (≥ 2), so the sum is never 2. — is formally proven and kernel-verified in formal-conjectures (zero `sorry`, no extra axioms). Verifier: lean4-kernel + Mathlib v4.27.0 (lake build green; `#print axioms` = [propext, Classical.choice, Quot.sound] only — NO sorryAx).
vf_b8e3badb634a19a0Diff
Read-only frontier; diff not recomputed.
Review chain
- 01requestopen review →
Change request
Formal-conjectures Lean proofs (kernel-verified) receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
- 02packetopen the campaign →
Diff packet
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
- 03checksinspect checks →
Check output
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
- 04reviewread queue →
Reviewer decision
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
- 05acceptedinspect events →
Accepted event
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.