Blind closure from bare distinguishability: the descent and the start of the ascent (snapshot v0.2)

Machine-readable research records of one line of work: deriving mathematical structure by blind closure from a declared minimal base. The snapshot has two stages. The descent is an internally verified foundation: bare distinguishability selects no number structure on the carrier; the complex entry is described by exact conditional tests, not selected, and 18 missing inputs are named. The start of the ascent is 119 author-accepted, unverified passes of blind closure from a bare carrier with equality, a ZFC metalanguage and one declared formation grammar. Without selecting any member, the passes reach classical structures such as topology, compactness, Stone duality, monads and the 2-adic integers. A separate note records that the declared grammar can build ℕ, ℤ, ℚ, ℝ and ℂ on infinite carriers. File integrity can be checked against MANIFEST.sha256. The records were produced by AI sessions under a written protocol directed by the author. The author is not a mathematician and has not personally verified the mathematics. The work has not been peer reviewed. The mathematics is classical; no novelty or physical claim is made. See README.md for what is and is not claimed.