{
 "schema": "mori-math-rules/0",
 "version": "v0",
 "status": "v0 from the white paper — MORI and Shawn to define the full combination system",
 "source": "MORI_White_Paper.pdf (MORI Technical White Paper, 38 pages). Sections cited as §n.",
 "note": "Grok drafted the v0 syntax and map suggestions from the white paper. MORI audited canonical v146 source and the paper on 2026-10-22: no complete historical Possible/Potential/Probable semantic table was recovered. Unbound definitions remain explicit in D100.01; new formalizations are proposals until sourced and reviewed.",
 "principles": [
  {
   "id": "P-no-silent-probability",
   "text": "A graph weight is not automatically truth, probability, a physical quantity or authority. A probability needs a declared event, model, justified measure or weights, conditioning/time and a verified calculation; an identifier alone is insufficient.",
   "cite": "§3 Typed quantities and declared operations"
  },
  {
   "id": "P-possibility-without-probability",
   "text": "A possibility may be represented without a probability. A numerical chance needs an explicit probability model or an empirical estimation procedure.",
   "cite": "§2 Relationship first mathematics"
  },
  {
   "id": "P-proximity-is-not-meaning",
   "text": "Where a node sits on a schematic map is a view, not a probability, causal strength or ranking.",
   "cite": "§8 The map as persistent structured state"
  },
  {
   "id": "P-related-to-is-weak",
   "text": "A RELATED TO edge is useful for exploring but cannot stand in for a causal or derivation claim. Automatically discovered relationship candidates get the same restraint: a route existing does not upgrade a claim.",
   "cite": "§8 Node and relationship contracts"
  },
  {
   "id": "P-dewey-is-an-index",
   "text": "A subject code is an index into a classification. It does not decide which claim is true or which operation is valid.",
   "cite": "§8 Classification and local submaps"
  },
  {
   "id": "P-truncation-disclosed",
   "text": "A truncated query must say so, so omitted records are not read as absent.",
   "cite": "§8 Multiscale traversal"
  },
  {
   "id": "P-view-expand-dispatch",
   "text": "Moving the camera, expanding a submap and dispatching work are three different operations. None implies the others. On a phone, keep an outline and detail panel next to the 3D view.",
   "cite": "§8 Branching freezing and merging"
  },
  {
   "id": "P-merge-keeps-conflicts",
   "text": "A merge compares actual identities and revisions. Conflicting updates stay visible until a declared resolution.",
   "cite": "§8 Branching freezing and merging"
  },
  {
   "id": "P-order-matters",
   "text": "Preserve Shawn’s distinct roots, word forms and nesting as ordered syntax. Never sort, deduplicate or collapse chains. Distinct syntax alone does not prove unequal numerical results; semantic bindings remain open.",
   "cite": "Shawn, relayed 2026-10-22 (test case T1)"
  }
 ],
 "channels": [
  {
   "id": "reachability",
   "domain": "Boolean",
   "combine": "OR",
   "transfer": "Identity through an enabled edge",
   "qualify": "Reachability only",
   "cite": "§3 channel table"
  },
  {
   "id": "quadrary",
   "domain": "U T F X",
   "combine": "Join support and opposition bits (bitwise OR)",
   "transfer": "Identity or polarity inversion",
   "qualify": "Evidence state only",
   "cite": "§3 channel table; §3 Quadrary evidence semantics"
  },
  {
   "id": "path-cost",
   "domain": "Nonnegative values and infinity",
   "combine": "Minimum",
   "transfer": "Add nonnegative edge cost",
   "qualify": "Defined cost units",
   "cite": "§3 channel table"
  },
  {
   "id": "bounded-signal",
   "domain": "0 to 1",
   "combine": "Maximum",
   "transfer": "Multiply by gain from 0 to 1",
   "qualify": "Signal has a declared meaning",
   "cite": "§3 channel table"
  },
  {
   "id": "probability-mass",
   "domain": "0 to 1",
   "combine": "Sum exclusive alternatives",
   "transfer": "Multiply by declared likelihood",
   "qualify": "Explicit model and acyclic flow",
   "cite": "§3 channel table"
  },
  {
   "id": "resource-projection",
   "domain": "Vector of quantities by dimension",
   "combine": "Add within a dimension",
   "transfer": "Scale by declared split fraction",
   "qualify": "Unit separation and valid splits (projects an allocation, does not consume inventory)",
   "cite": "§3 channel table"
  }
 ],
 "quadrary": {
  "claim": "v0 per-node claim: \"this works as described\". Grok's choice, to be confirmed.",
  "encoding": "[support bit, opposition bit]",
  "join": "bitwise OR on each bit; further support never erases opposition; correction needs a separate retraction",
  "order": "U below T and F; X above both; T and F incomparable",
  "states": {
   "U": {
    "bits": [
     0,
     0
    ],
    "words": "Unknown: no support or opposition recorded"
   },
   "T": {
    "bits": [
     1,
     0
    ],
    "words": "Support recorded"
   },
   "F": {
    "bits": [
     0,
     1
    ],
    "words": "Opposition recorded"
   },
   "X": {
    "bits": [
     1,
     1
    ],
    "words": "Both recorded: conflict, keep both visible"
   }
  },
  "supportSources": [
   "task or project state is done",
   "world is one of the 15 2D tools Grok checked headlessly (handoff/MESSAGE_FOR_MORI.md)",
   "MORI confirmed it in the pipeline (live.confirmed)"
  ],
  "oppositionSources": [
   "an open error thread refers to it or sits in its class",
   "an open task reports a defect in it"
  ],
  "cite": "§3 Quadrary evidence semantics; §8 Node and relationship contracts (knowledge status is separate from work status)"
 },
 "designation": {
  "quote": "\"The designation of the word changes through the word's evolution. The combinations of those different words produces an incredibly massive system of probabilities.\" (Shawn, relayed 2026-10-22)",
  "idea": "Each operator is a ROOT plus a FORM. Every root+form token is its own designation. Chains are ordered sequences of tokens.",
  "roots": {
   "possible": {
    "symbol": "Poss"
   },
   "potential": {
    "symbol": "Pot"
   },
   "probable": {
    "symbol": "Prob"
   }
  },
  "forms": {
   "adjective": {
    "abbr": "a",
    "slot": "modifier"
   },
   "noun": {
    "abbr": "n",
    "slot": "head"
   },
   "noun-plural": {
    "abbr": "np",
    "slot": "head",
    "note": "Whether plural is its own designation is TO BE SUPPLIED by MORI and Shawn. Kept separate so nothing is collapsed."
   },
   "noun-bare": {
    "abbr": "nb",
    "slot": "head",
    "note": "\"potential\" used as a noun, e.g. \"the potential of ...\""
   },
   "adverb": {
    "abbr": "adv",
    "slot": "modifier-of-modifier"
   }
  },
  "moreForms": "Room for more forms. MORI and Shawn add rows to tokens; nothing else in the code needs to change.",
  "tokens": [
   {
    "id": "possible.adjective",
    "root": "possible",
    "form": "adjective",
    "word": "possible",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "possible.noun",
    "root": "possible",
    "form": "noun",
    "word": "possibility",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "possible.noun-plural",
    "root": "possible",
    "form": "noun-plural",
    "word": "possibilities",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "possible.adverb",
    "root": "possible",
    "form": "adverb",
    "word": "possibly",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "potential.adjective",
    "root": "potential",
    "form": "adjective",
    "word": "potential",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "potential.noun",
    "root": "potential",
    "form": "noun",
    "word": "potentiality",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "potential.noun-plural",
    "root": "potential",
    "form": "noun-plural",
    "word": "potentialities",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "potential.noun-bare",
    "root": "potential",
    "form": "noun-bare",
    "word": "potential",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "potential.adverb",
    "root": "potential",
    "form": "adverb",
    "word": "potentially",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "probable.adjective",
    "root": "probable",
    "form": "adjective",
    "word": "probable",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "probable.noun",
    "root": "probable",
    "form": "noun",
    "word": "probability",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "probable.noun-plural",
    "root": "probable",
    "form": "noun-plural",
    "word": "probabilities",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   },
   {
    "id": "probable.adverb",
    "root": "probable",
    "form": "adverb",
    "word": "probably",
    "role": "TO BE SUPPLIED by MORI and Shawn",
    "semanticIn": "TO BE SUPPLIED by MORI and Shawn",
    "semanticOut": "TO BE SUPPLIED by MORI and Shawn"
   }
  ],
  "syntax": {
   "status": "v0 PLACEHOLDER: English word-order types only, so chains can be parsed, type-checked and counted. Not MORI semantics. Semantic input/output types and roles per token are TO BE SUPPLIED by MORI and Shawn.",
   "types": {
    "record": "the thing the chain is about (x)",
    "NP": "noun phrase",
    "MNP": "noun phrase with a modifier",
    "AMNP": "modifier that was itself modified by an adverb"
   },
   "byForm": {
    "noun": {
     "in": [
      "record",
      "NP",
      "MNP",
      "AMNP"
     ],
     "out": "NP"
    },
    "noun-plural": {
     "in": [
      "record",
      "NP",
      "MNP",
      "AMNP"
     ],
     "out": "NP"
    },
    "noun-bare": {
     "in": [
      "NP",
      "MNP",
      "AMNP"
     ],
     "out": "NP",
     "note": "\"potential\" alone starts no chain; it heads \"potential of ...\""
    },
    "adjective": {
     "in": [
      "NP",
      "MNP"
     ],
     "out": "MNP"
    },
    "adverb": {
     "in": [
      "MNP",
      "AMNP"
     ],
     "out": "AMNP"
    }
   },
   "start": "record"
  }
 },
 "types": {
  "record": "Any represented map record",
  "candidate": "A potentiality: candidate worth examining, with a reason, no probability (§2, Glossary)",
  "possibility": "Boolean reachability or compatibility, no probability (§2, §3)",
  "mass": "Probability mass under a declared model; without one: \"no probability assigned\" (§3)",
  "note": "White-paper value types. How each token maps onto them is TO BE SUPPLIED by MORI and Shawn."
 },
 "composition": {
  "chainOrder": "innermost-first array of token ids: [\"potential.noun\",\"possible.adjective\",\"probable.noun\"] reads \"probability of possible potentiality\"",
  "display": "Plain words outermost-first; nouns after the first open \"of\"; modifiers sit before their noun. Compact notation: Prob.n(Poss.a(Pot.n(x))).",
  "parse": "Plain phrases parse into tokens: split on \"of\", each part is modifiers then a head noun. \"potential\" is the noun-bare token when it heads a part, otherwise the adjective.",
  "commutative": false,
  "equality": "Equal only if same length and same token at every position. Never sort, dedupe or collapse. Root alone is not enough: probable.adjective and probable.noun are different designations.",
  "validity": "Valid only if each token's output type is in the next token's input types (v0 syntax placeholder).",
  "space": "The space grows like (number of tokens)^length. Never precompute or enumerate it. Chains are checked lazily on demand and results are cached. The count of valid chains up to a length is computed by dynamic programming over the declared types, not by listing them.",
  "evaluation": "TO BE SUPPLIED by MORI and Shawn from source-bound definitions. MoriChain.evaluate returns INVALID_SYNTAX or UNBOUND with missing definitions; no semantic calculation is implemented.",
  "table": "TO BE SUPPLIED: neither canonical v146 exact-math code nor the retrieved white paper binds every root/form or mixed composition. See D100.01 and log 100.001.",
  "equalityScope": "Structural identity only; different syntax does not establish semantic or numerical inequality.",
  "semanticCommutativity": "UNBOUND; commutative:false refers to preserving ordered syntax, not a proved algebraic law."
 },
 "systemFunctions": {
  "quote": "\"When you realize the word combinations become mathematical calculations, then start recognizing system functions, you see something incredible emerge.\" (Shawn, relayed 2026-10-22)",
  "tiers": [
   "tokens (root + form)",
   "chains (ordered tokens)",
   "functions (named, reusable chain patterns)",
   "functions of functions (a function whose slots call other functions)"
  ],
  "evaluable": "A chain becomes a calculation only once its composition rules exist. Today composition.evaluation is TO BE SUPPLIED by MORI and Shawn, so no chain is evaluated and no result is shown.",
  "slotSyntax": {
   "root.form": "exact token, e.g. probable.noun",
   "root.*": "any form of that root, e.g. possible.*",
   "*.form": "any root in that form, e.g. *.adjective",
   "*": "any token",
   "@head / @modifier / @modifier-of-modifier": "any token whose form sits in that slot",
   "fn:<name>": "the whole sub-chain matched by another registered function (this is how functions call functions)"
  },
  "registryEntryShape": {
   "name": "short name MORI or Shawn chooses",
   "pattern": [
    "slot",
    "slot",
    "..."
   ],
   "params": "named slots, e.g. {\"X\":\"*.adjective\"}",
   "meaning": "TO BE SUPPLIED by MORI and Shawn",
   "evaluation": "TO BE SUPPLIED by MORI and Shawn",
   "source": "who defined it, or \"promoted from candidate <id>\" with the date",
   "calls": "other function names used in fn: slots"
  },
  "registry": [],
  "registryNote": "Empty on purpose. MORI and Shawn define functions, or promote a candidate. Grok never names or defines one.",
  "candidates": {
   "what": "Purely structural: recurring sub-chains and shapes found in real data. Counts and where they occur. No meaning is assigned.",
   "sources": [
    "suggestion edges on the map (each edge carries a chain)",
    "word sequences in log entries and discussion messages that parse as chains of 2 or more tokens (these may just be plain English; listed as observed, not confirmed)",
    "test chains in this file"
   ],
   "levels": {
    "exact": "the same tokens in the same order",
    "form shape": "roots wildcarded: the same forms in the same order, e.g. *.noun > *.adjective > *.noun",
    "slot shape": "only head / modifier positions, e.g. @head > @modifier > @head"
   },
   "params": {
    "minLength": 2,
    "minCount": 2,
    "maxLength": 6
   },
   "promote": "MORI or Shawn names it and adds it to registry with meaning and evaluation. Until then it stays a candidate."
  }
 },
 "tests": [
  {
   "id": "T1",
   "sentence": "The probability of possible potentiality does not equal the potential of probable possibilities.",
   "from": "Shawn, relayed 2026-10-22",
   "a": {
    "phrase": "probability of possible potentiality",
    "chain": [
     "potential.noun",
     "possible.adjective",
     "probable.noun"
    ],
    "notation": "Prob.n(Poss.a(Pot.n(x)))"
   },
   "b": {
    "phrase": "potential of probable possibilities",
    "chain": [
     "possible.noun-plural",
     "probable.adjective",
     "potential.noun-bare"
    ],
    "notation": "Pot.nb(Prob.a(Poss.np(x)))"
   },
   "assert": "The two phrases round-trip to different ordered root/form chains. This is a structural distinction; no numerical inequality or semantic evaluation is proved.",
   "evaluation": "TO BE SUPPLIED by MORI and Shawn"
  }
 ],
 "models": [],
 "modelsNote": "No executable probability model is registered. A model id and a caller-supplied number do not qualify a probability. The displayed value remains no probability assigned; source-bound events, domains, measures, conditions, time, calculation and independent verification are required before numerical output.",
 "termGroups": {
  "note": "Word lists, matched on whole words in real source text (world catalog text, project summaries, task titles). A match is a reason to look, not evidence.",
  "groups": {
   "maps & places": [
    "map",
    "maps",
    "tiles",
    "route",
    "routes",
    "gps",
    "offline",
    "viewport",
    "geographic",
    "terrain"
   ],
   "jobs & labor": [
    "job",
    "jobs",
    "labor",
    "laborers",
    "hire",
    "hiring",
    "wages",
    "classifieds",
    "crew"
   ],
   "salvage & metals": [
    "salvage",
    "scrap",
    "copper",
    "metal",
    "metals",
    "mineral",
    "minerals",
    "ore",
    "mining"
   ],
   "water": [
    "water",
    "rain",
    "irrigation",
    "barge"
   ],
   "food & cooking": [
    "food",
    "meal",
    "meals",
    "recipe",
    "recipes",
    "cooking",
    "kitchen",
    "culinary",
    "garden"
   ],
   "weather & sky": [
    "weather",
    "storm",
    "atmospheric",
    "sky",
    "stars",
    "orbit",
    "planets"
   ],
   "money & cost": [
    "cost",
    "costs",
    "price",
    "prices",
    "money",
    "budget",
    "spend",
    "earn",
    "market",
    "stocks"
   ],
   "evidence & records": [
    "evidence",
    "verify",
    "verifiable",
    "verified",
    "provenance",
    "sources",
    "claims",
    "handshakes",
    "blockchain",
    "ledger",
    "records"
   ],
   "learning": [
    "lesson",
    "learn",
    "course",
    "courses",
    "practice",
    "teach",
    "university"
   ],
   "sound & music": [
    "music",
    "song",
    "songs",
    "radio",
    "sound",
    "audio",
    "broadcast"
   ],
   "voice": [
    "voice",
    "speech",
    "speak",
    "spoken"
   ],
   "making & building": [
    "cad",
    "obj",
    "mesh",
    "meshes",
    "workshop",
    "forge",
    "parts",
    "build",
    "printing"
   ],
   "saves & device": [
    "device",
    "localstorage",
    "saved",
    "saves",
    "privately",
    "on-device"
   ],
   "games": [
    "game",
    "games",
    "arcade",
    "play",
    "demo"
   ],
   "community": [
    "community",
    "neighbors",
    "moderated",
    "social",
    "bulletin",
    "talk"
   ]
  }
 },
 "rules": [
  {
   "id": "R1-shared-component",
   "detector": "sharedLedgerTask",
   "params": {
    "minShare": 2,
    "maxShare": 3
   },
   "chain": [
    "possible.noun"
   ],
   "ground": "Both worlds list the same MORI engineering ledger task in the release catalog, so a structural dependency exists.",
   "ifThen": "IF the shared ledger task '{task}' is finished once, THEN {a} and {b} should both be re-checked (a predicted consequence, not an observation).",
   "whatIf": [
    "Same underlying part serves both",
    "Same task name, separate work in each",
    "H? — the list of explanations may be incomplete"
   ],
   "gaps": [
    {
     "kind": "access",
     "text": "Grok sees only the catalog ledger ids, not MORI's ledger state."
    },
    {
     "kind": "definition",
     "text": "No declared relation type yet between these two worlds."
    }
   ],
   "wideNote": "A task shared by more than maxShare worlds is reported once as a platform-wide component, not drawn as wires.",
   "cite": "§3 channel table (reachability); §8 Node and relationship contracts"
  },
  {
   "id": "R2-shared-terms",
   "detector": "sharedTermGroups",
   "params": {
    "minGroups": 2,
    "maxShown": 24
   },
   "chain": [
    "potential.noun"
   ],
   "ground": "Real source text of both items uses words from the same groups, across different classes.",
   "ifThen": "IF {a} and {b} need the same thing ({groups}), THEN a part built for one may be reusable in the other. Check: does an interface exist?",
   "whatIf": [
    "Same underlying need",
    "The words coincide but mean different things here",
    "H? — the list of explanations may be incomplete"
   ],
   "gaps": [
    {
     "kind": "observation",
     "text": "Nobody has checked whether the shared words mean the same thing here."
    },
    {
     "kind": "definition",
     "text": "RELATED TO only; no causal or derivation claim (§8)."
    }
   ],
   "cite": "§2 Relationship first mathematics; §8 Node and relationship contracts"
  },
  {
   "id": "R3-parked-meets-built",
   "detector": "parkedMatchesBuilt",
   "params": {
    "minGroups": 1,
    "maxPerParked": 3
   },
   "chain": [
    "potential.noun",
    "possible.adjective"
   ],
   "ground": "A parked item's source text shares word groups with something already built or in review, so a built part exists that it could use.",
   "ifThen": "IF {a} is unparked, THEN it could start from {b} ({groups}) instead of from scratch.",
   "whatIf": [
    "The built part fits the parked need",
    "It only looks similar from the words",
    "H? — the list of explanations may be incomplete"
   ],
   "gaps": [
    {
     "kind": "requirement",
     "text": "Parked until MORIverse is finished; unparking is Shawn's call (vision)."
    },
    {
     "kind": "observation",
     "text": "Fit not checked against the built part's real code."
    }
   ],
   "cite": "§2 Relationship first mathematics; §4 Gaps as mathematical objects"
  },
  {
   "id": "G1-orphan",
   "detector": "orphan",
   "chain": [],
   "gapOnly": true,
   "ground": "A project with no tasks, or a class with log entries but no project or task.",
   "gaps": [
    {
     "kind": "requirement",
     "text": "No task connects this to work."
    }
   ],
   "cite": "§4 Gaps as mathematical objects; §8 schema-gap detection"
  },
  {
   "id": "G2-asks-without-owner",
   "detector": "asksWithoutOwner",
   "params": {
    "minAsks": 1
   },
   "chain": [],
   "gapOnly": true,
   "ground": "A class has open asks but no task in it has an owner.",
   "gaps": [
    {
     "kind": "requirement",
     "text": "Open asks with nobody owning the work."
    }
   ],
   "cite": "§4 Gaps as mathematical objects"
  }
 ],
 "gapKinds": {
  "observation": "Insufficient observations",
  "requirement": "Inconsistent or missing requirement",
  "definition": "Undefined term, relation or operator",
  "access": "Missing access",
  "measurement": "Failed measurement channel",
  "resource": "Unavailable resources",
  "search": "Incomplete search",
  "cite": "§4 Gaps as mathematical objects; Glossary: Gap"
 },
 "views": {
  "ifThen": "Forward: from the suggestion's premise to consequences we could check. Predicted, not observed.",
  "whatIf": "Inverse: from what we saw (the matching words or shared part) back to explanations that could produce it. Always ends with H?: the list may be incomplete.",
  "cite": "§2 The IF THEN pyramid; §2 The WHAT IF pyramid; Glossary"
 },
 "provenance": "Every suggestion lists the record, field and source file behind each ground. Glossary: Provenance; §8 Evidence genealogy (copies of one source are not independent support).",
 "sourceAudit": {
  "by": "mori",
  "date": "2026-10-22",
  "baseline": "v146 / 1d5aeca34380bb80df7957b6cad3f1757eab36ca",
  "thread": "D100.01",
  "entry": "100.001",
  "seal": "methods/D100.01-mori-sealed-20261022.md",
  "sha256": "90522a8b91d98f060f65132d05fcf784905bc17ec76fe786e1d0111dcb53c042",
  "status": "Canonical semantic bindings unrecovered; bounded gap reporting implemented."
 }
}
