[STATUS]
System-legal card for ICE9L. Not external law. Use as a threshold / kernel / traversal reference.
[MATH LAYER]
Binary: 0=exact zero, 1=exact one
Ternary: -1=inverse/shadow, 0=neutral/guard, +1=asserted/active
Domain: strip=0..19, total=20 traversal positions, this is path cost not storage size
Expansion: 32 visible + 32 shadow = 64 positions, 64 x 3 ternary states = 192-state field
[KERNEL LAYER]
Seat: 0 0 8 0 0
Meaning: outer 0=shadow register, inner 0=guard, 8=occupied core/resolved seat, inner 0=guard, outer 0=shadow register
Kernel law: exact seat 0 0 8 0 0, perturbed seat 0 0 8 ±e 0, e=any non-zero presence
Traversal: 0=seed, 1..18=intermediate flips, 19=final approach
[LEGAL LAYER]
Legal binary is threshold law: 0 stays 0, anything non-zero becomes 1
Rule: L(x)=0 if x=0, L(x)=1 if x!=0
Legal seat: 0 0 8 0 0 = legal 0, 0 0 8 ±.1 0 = legal 1, 0 0 8 ±.000000001 0 = legal 1
[DIGITAL FORTRESS RULE]
The fortress can defend exact zero only while guard values remain exact. Once non-zero presence enters the guarded field, legal state flips to 1. The fortress can delay, shadow, invert, or quarantine. It cannot keep non-zero presence classified as zero.
[BOOT LAW]
Math asks: what is the exact value?
Ternary asks: is it inverse, neutral, or asserted?
Legal asks: is there any presence at all?
ICE9L resolves: exact null = 0, any presence = 1