{
  "check": "conservation_laws_unified",
  "headline": "The Conservation Laws of Quantum-Safe Wi-Fi Authentication",
  "honesty": "every law carries an explicit Tier label; no byte-size / thermodynamic claim; no legal / essentiality / FTO / price conclusion (technical necessity only).",
  "ladder": [
    {
      "cite": "Naor-Rothblum FOCS'05/JACM'09; CCMT ICALP'09",
      "id": "LAW 1",
      "make": "reassembly-conservation",
      "name": "Reassembly Memory Conservation Floor",
      "ok": true,
      "statement": "buffer(B) + [per-frame-auth]*N >= N  (buffer-all OR gate; no third option)",
      "tier": "Tier-1 general bound cited (Naor-Rothblum/CCMT); deployed dichotomy machine-checked over model M"
    },
    {
      "cite": "GMS 1974; Simmons CRYPTO'84; Stinson'88; Maurer'00",
      "id": "LAW 2",
      "make": "authentication-conservation",
      "name": "Authentication-Entropy Conservation Law",
      "ok": true,
      "statement": "H(K) >= 2k to bound deception <= 2^{-k}  (movable but irreducible)",
      "tier": "Tier-1 unconditional in the one-time-authentication model; deployed as the conservation law"
    },
    {
      "cite": "Barak-Mahmoody CRYPTO'09; Impagliazzo-Rudich STOC'89",
      "id": "ROOT",
      "make": "structured-hardness",
      "name": "Structured-Hardness Necessity",
      "ok": true,
      "statement": "unstructured KE broken in O(n^2) queries -> quantum-safe KE must embed structured hardness",
      "tier": "Tier-3 ORACLE-RELATIVE; bounds the QUERY gap, NOT bytes (explicitly not a size floor)"
    },
    {
      "cite": "cross-session corollary of LAW 1 + TranscriptForge.ec (Sprint 134)",
      "id": "#12/#13",
      "make": "impossibility-filing",
      "name": "DoS trichotomy + transcript-binding uniqueness",
      "ok": true,
      "statement": "{unbounded admission, bounded memory, no gate} impossible; root-binding unique in the modeled space",
      "tier": "Tier-3 model-relative impossibilities (both)"
    }
  ],
  "ok": true,
  "verdict": "real"
}