scaffold_count
plain-language theorem explainer
The definition scaffold_count tallies the number of choke points marked as scaffolds in the inevitability structure. Researchers assessing the completeness of the Recognition Science foundation cite this count when evaluating remaining gaps before the inevitability theorem is fully closed. It arises from a direct filter on the all_choke_points list followed by a length computation.
Claim. Let $C$ be the list of all choke points. Then scaffold_count equals the cardinality of the sublist of $C$ consisting of those $c$ for which status$(c)=$``scaffold''.
background
The InevitabilityStructure module organizes Recognition Science claims into necessity gates called choke points. These gates cover cost uniqueness (T5: J(x) = ½(x + x⁻¹) - 1), selection by defect minimization, discreteness, ledger symmetry, self-similarity forcing phi, and dimension D=3. Each choke point carries a status string that is either closed or scaffold.
proof idea
One-line definition that filters all_choke_points for entries whose status equals ``scaffold'' and returns the length of the resulting list.
why it matters
The count is invoked by the inevitability_structure_summary theorem, which states closed_count = 1 and scaffold_count = 3. It therefore quantifies the open steps in the inevitability theorem: any zero-parameter framework deriving observables must either match RS or violate at least one gate. The module doc identifies the three option buckets (cost, existence, admissible frameworks) that this count helps track.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.