Source authenticated

Conditional binary disjunctivity of the Erdős–Borwein constant reported

VibeMathed recorded: Conditional binary disjunctivity of the Erdős–Borwein constant reported. Consult the linked registry entry for the original report and scope.

Exact FrontierDelta

Prior state unknown→Conditional binary disjunctivity of the Erdős–Borwein constant source-authenticated; hypotheses and independent review remain explicit

Scope and record

Occurred: Sep 7, 2026

Delta type: Not quantified

Canonical aliases: None recorded

Confidence: Not scored

Open the source record ↗

Attribution

First-party finding bundle importer
system · event recorded by

VibeMathed
registry · attributed to

Captain Sude
human · attributed to

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record for the Erdős–Borwein constant

specialist registry · passed

Current dataset generated 2026-09-09T14:02:34.563Z. The record reports significance 25, resolution candidate, publication preprint, and verification lean-checked with statement unaudited. This is attributed registry metadata, not MFN proof or expert review. The overall dataset remains adapter-invalid because a separate S²×S⁴ record has significance null.

Source ↗

Explicit AGP and prime-interval hypotheses

code · pending

Defines AGP and PrimeIntervalSupply as explicit theorem hypotheses. The source does not formalize these inputs in the package; do not flatten the conditional result into an unconditional theorem.

Source ↗

Disjunctivity of the Erdős–Borwein constant, pinned paper

preprint · pending

Primary mathematical statement source, retrieved from the immutable commit. The paper states every finite binary word occurs infinitely often and gives a quantitative bound; this draft records only the qualitative conditional scope. No repository or paper license was declared; retain a link only.

Source ↗

Pinned Lean verification record and axiom audit

lean artifact · pending

The source reports Lean 4.33.1 and Mathlib v4.33.1, a successful build, no sorryAx in the delivered source, and final endpoints depending only on propext, Classical.choice, and Quot.sound. These are source-reported verification facts; MFN did not replay the build.

Source ↗

Artifacts and verifiers

Explicit AGP and prime-interval hypotheses

code · pending

Artifact ↗

SHA-256: bf56a66741afbd9eb555539995bc242fdad39333e7e923ad2c0c08ef695b09ec

Disjunctivity of the Erdős–Borwein constant, pinned paper

preprint · pending

Artifact ↗

SHA-256: 47bb42f894ff64221a77c566303564fa871236408a30c2b1aaa538833b11b14e

Pinned Lean verification record and axiom audit

lean artifact · pending

Artifact ↗

SHA-256: 3df62076ae3d3d440c2feb38f90d49a72eb0c407c8fa055655623b55b197d93a

Compute record

No linked compute attempts recorded.

Lineage and corrections

This event attributed to VibeMathed

This event attributed to Captain Sude

Pinned Lean verification record and axiom audit evidence for this event

Whether the Erdős–Borwein constant is 2-dense parent of this event

VibeMathed record for the Erdős–Borwein constant evidence for this event

Under the explicit hypotheses AGP and PrimeIntervalSupply defined in the pinned Lean source, the formal development derives that every finite binary word occurs arbitrarily late, hence infinitely often, in the binary expansion of the Erdős–Borwein constant $E$ ; the accompanying paper reports this as 2-density. parent of this event

This event evidence for Under the explicit hypotheses AGP and PrimeIntervalSupply defined in the pinned Lean source, the formal development derives that every finite binary word occurs arbitrarily late, hence infinitely often, in the binary expansion of the Erdős–Borwein constant $E$ ; the accompanying paper reports this as 2-density.

This event derived from Disjunctivity of the Erdős–Borwein constant

Disjunctivity of the Erdős–Borwein constant, pinned paper evidence for this event

Explicit AGP and prime-interval hypotheses evidence for this event

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem Explore evidence graph