Encyclopedia Verification Verification Knobs Count
ARTICLE 2 claims 1 theorem 1 model
Verification Knobs Count
A knob is any adjustable parameter a theory can turn to fit data; Recognition Science counts zero of them in its proof layer.
The count of knobs
In any scientific theory, a knob is an adjustable parameter you can turn to make predictions match measurements. The more knobs a theory has, the easier it is to fit almost anything, and the less impressive any single agreement becomes. Recognition Science keeps a formal count of such knobs across its machine-checked library of formal theorems. That count is zero.
The definition is a single line in the framework's library: the number of knobs is the natural number 0. A companion theorem, proved by direct computation, states that this count equals zero. The proof is immediate from the definition, which is exactly what a count of zero should be. There is nothing to solve, no equation to balance, and no hidden parameter waiting to be tuned.
What makes this count meaningful is what it does not claim. Setting a number to zero is trivial; the interesting question is whether the framework's results actually flow from that zero-knob starting point. The library's own documentation is explicit on this point: zero adjustable parameters is an architectural goal, not a consequence of the numeral identity 0 = 0. The count records the current state of the proof layer, not a promise about every future development.
In Recognition Science, the framework models physical structure as forced by a single cost function, with constants like the golden ratio emerging from the mathematics rather than being inserted by hand. The knob count of zero is the formal expression of that ambition: the framework's theorems carry no free parameters in their proof layer. Whether the empirical predictions succeed is a separate question, checked against measurements, not settled by the count itself.
The practical consequence is simple. When a Recognition Science result agrees with an experiment, the agreement is not purchased with adjustable parameters. That is the standard against which the framework asks to be judged, and the knob count is the ledger entry that records the commitment.
MODEL knobsCount · IndisputableMonolith/Verification/KnobsCount.lean
def knobsCount : Nat := 0
THEOREM no_knobs_proof_layer · IndisputableMonolith/Verification/KnobsCount.lean
/--- **CERT(definitional)**: No knobs in the current proof layer. -/
@[simp] theorem no_knobs_proof_layer : knobsCount = 0 := rfl
What this page does not claim
Zero knobs is not a proof that the framework's empirical predictions are correct. The count does not cover parameters that might appear in future unformalized derivations. The knob count is a record of the current proof layer, not an architectural guarantee for all time.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Verification/KnobsCount.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- How does the framework ensure that no hidden knobs enter through definitions rather than through explicit parameters?
- What would change if a future theorem required a nonzero knob count?
- How does the zero-knob count interact with the framework's empirical comparisons against measured particle masses?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
MODEL knobsCount · IndisputableMonolith/Verification/KnobsCount.lean
def knobsCount : Nat := 0The number of knobs is the natural number 0. knobsCount · IndisputableMonolith/Verification/KnobsCount.leanTHEOREM no_knobs_proof_layer · IndisputableMonolith/Verification/KnobsCount.lean
/--- **CERT(definitional)**: No knobs in the current proof layer. -/ @[simp] theorem no_knobs_proof_layer : knobsCount = 0 := rflA companion theorem, proved by direct computation, states that this count equals zero. no_knobs_proof_layer · IndisputableMonolith/Verification/KnobsCount.lean