4.6 The strike shape and the known limit (TPS 0.1.0)

Instruction artifact, machine-optimized text: TPS 0.1.0, section 4.6 The strike shape and the known limit. Part of TPS 0.1.0 and the TPM hub. Human-only edit (TPS 5.13). Version 0.1.0, proposed, revision 3; declaration pending. The text below is this section of the TPS 0.1.0 artifact, verbatim; the whole artifact and its file digest are on The Principia Machina/TPS 0.1.0. Human readers: the contents page is the map.

TPS 4.6  THE STRIKE SHAPE AND THE KNOWN LIMIT
purpose: the withdrawal record's five fields; no container-level
         invalidation; a(r) gameable, atomicity INSPECTION
governs: 4.6 | version: 0.1.0 (proposed) | class: instruction artifact
audience: operator, agent

4.6.1  STRIKE SHAPE. A strike is a withdrawal record: entry-level,
       forward-only, carrying what it withdrew, what withdrew it, what
       supersedes it, what still stands, and the withdrawing version.
       Container-level invalidation is not in the shape. [I-078]
4.6.2  A STRIKE is a withdrawal record in the strike shape, issued under
       SR1-SR9 (see 1.1, 3.3.3). [I-036]
4.6.3  NAMED COMPLETENESS DEFECTS, replacing the single known-limit
       line of the first revision (D41.2):
         (1) bundling. Atomicity remains a judgment, now made once per
             assumption at the allocation of its ASSUMPTION RECORD
             (see 4.2, row 23).
         (2) s(r) moves with record boundaries: a(r) runs over the
             closure while s(r) counts r's own derivation only.
4.6.4  OPEN AND STATED (D41.2). Under-declaration, an assumption or a
       citation left out, is an SR2 validity failure and is caught
       exactly as well as derivations are checked. Step granularity
       rests on the UWC's STEP CONVENTION; TPX counts declared steps.
4.6.5  The seven adversarial cases run in the synthetic suite as a
       REPORT-ONLY corpus: bundling many assumptions into one; hiding
       assumptions transitively; importing assumptions through cited
       records; choosing a favorable derivation decomposition; creating
       artificial short derivations; splitting one assumption into
       many; strategically choosing record boundaries. No probe is
       added to the certification suite and N is unchanged (see 5.14,
       7.2). [D41.2]