Jump to content

The Principia Machina/TPS/1.4 Design basis: Difference between revisions

From The Invariance Itself
Status line: TPS 0.5.0 declared final 2026-10-03 (it said proposed); the lead only, outside the preformatted block; D(TPS) unchanged (tpm_status 0.1.3)
m 1 revision imported
 
(No difference)

Latest revision as of 13:23, 7 October 2026

Instruction artifact, machine-optimized text: TPS, section 1.4 Design basis. Part of TPS and the TPM hub. Human-only edit (TPS 5.13). TPS 0.1.0 was declared final at revision 4 on 2026-09-22, a version declaration recorded in the foundations record; the chain begins at TPX's first landing (TPS 5.6.7). TPS 0.1.1, which changed only the status lines, was declared final on 2026-09-26, TPS 0.3.0, revision 6, on 2026-09-28, and TPS 0.4.0, revision 7, on 2026-09-30. This page is revision 8 of the tree, declared final as TPS 0.5.0 by H-DECL on 2026-10-03 (naming TPS_0.5.0.txt by its file digest and its D(TPS)); revision 7 is carried whole, and revision 5, proposed as 0.2.0, stays undeclared. The text below is this section of the TPS artifact at 0.5.0, verbatim; the whole artifact and its file digest are on The Principia Machina/TPS. Human readers: the contents page is the map.

TPS 1.4  DESIGN BASIS
purpose: the measures under which the machinery was chosen; machinery
         ranked by that basis, physics results ranked by each container's
         TMS
governs: 1.4 | version: 0.5.0 (proposed) | class: instruction artifact
audience: operator

BASIS 1.4.1  Every choice of machinery recorded in part 8 was ranked
       lexicographically, lower better on each axis: correctness, error
       opportunity, cost. [I-010]
BASIS 1.4.2  Correctness counts two kinds of defect. A soundness defect
       is a construction the check accepts that it should reject; any
       count above zero excludes the option. A completeness defect is a
       named case the check omits; these rank and do not exclude. A rule
       still to be written is an obligation, not a completeness defect.
       [I-010]
BASIS 1.4.3  Error opportunity counts unforced human authoring
       operations per unit of work. A verification gate at an
       irreversible action is exempt if and only if it poses a specific
       check question the mechanism does not already answer. [I-010]
BASIS 1.4.4  Cost is tokens, time and compute; tiebreak only. A tie on
       all three is reported in one word; the human selects. [I-010]
BASIS 1.4.5  The declaring-authority separation is untouchable regardless
       of its cost: a named human declares TFK amendments, container
       state and closeout. [I-010]
1.4.6  This basis ranks machinery only. Physics results are ranked by
       each container's TMS under the strike skeleton (see 4.3). [I-010]