@eir-labs/coltrane 0.8.0 → 0.9.0

package/dist/src/institution_enforcement.js

@@ -0,0 +1,442 @@
+// Institutional-law ENFORCEMENT — the seam that makes Coltrane's own laws machine-checkable
+// at the moment of action, rather than prose that sounds binding.
+//
+// Coltrane's public position is that an institutional law is decidable when an action is
+// attempted. Today institutions/coltrane.json ships three ADICO laws whose `check.predicate`
+// is a real s-expression that NOTHING evaluates, and composeStandard verifies chair caps at
+// dispatch while verifying no chair obligation at all. This module is the repair: a
+// zero-dependency in-house s-expression evaluator with a fixed verdict codomain, and an
+// admissibility check that refuses an institution document claiming more enforcement than it
+// has.
+//
+// GREEN STATUS. The signatures below and the `Verdict` codomain are the fixed seam authored by
+// the red spec; this change fills the bodies WITHOUT touching either. The evaluator is a total
+// four-plus-valued reducer over a supplied fact record; admissibility is a separate, explicitly
+// invoked pure function. Neither is wired into loadGenome — a universal gate would refuse
+// quartet.json (unmarked obligations, non-fact-decidable operators) and break "loads unchanged".
+// See docs/specs/coltrane-enforces-its-laws.md.
+/** The five closed verdict values as data — for codomain-closure and exhaustiveness assertions. */
+export const VERDICTS = [
+    "PERMIT",
+    "DENY",
+    "NOT_APPLICABLE",
+    "UNDECIDED",
+    "DEAD_NAME",
+];
+// ── An in-house, zero-dependency s-expression reader ──────────────────────────────────────────
+// SMT-LIB2 is itself s-expression many-sorted first-order logic, so a Z3 backend later sits behind
+// the SAME `evaluate()` signature; this reader is the fact-only front half. It is TOTAL over
+// well-formed input and throws only ParseError on malformed input — which `evaluate` catches
+// (runtime never throws) and which admissibility surfaces as a static refusal.
+class ParseError extends Error {
+}
+function isDelimiter(c) {
+    return c === "(" || c === ")" || c === '"' || c === " " || c === "\t" || c === "\n" || c === "\r";
+}
+function tokenize(src) {
+    const out = [];
+    const n = src.length;
+    let i = 0;
+    while (i < n) {
+        const c = src[i];
+        if (c === " " || c === "\t" || c === "\n" || c === "\r") {
+            i++;
+            continue;
+        }
+        if (c === "(") {
+            out.push({ t: "(" });
+            i++;
+            continue;
+        }
+        if (c === ")") {
+            out.push({ t: ")" });
+            i++;
+            continue;
+        }
+        if (c === '"') {
+            let j = i + 1;
+            let s = "";
+            while (j < n && src[j] !== '"') {
+                if (src[j] === "\\" && j + 1 < n) {
+                    s += src[j + 1];
+                    j += 2;
+                    continue;
+                }
+                s += src[j];
+                j++;
+            }
+            if (j >= n)
+                throw new ParseError("unterminated string literal");
+            out.push({ t: "str", v: s });
+            i = j + 1;
+            continue;
+        }
+        let j = i;
+        while (j < n && !isDelimiter(src[j]))
+            j++;
+        out.push({ t: "sym", v: src.slice(i, j) });
+        i = j;
+    }
+    return out;
+}
+function parse(src) {
+    const toks = tokenize(src);
+    let pos = 0;
+    function readExpr() {
+        if (pos >= toks.length)
+            throw new ParseError("unexpected end of input");
+        const tok = toks[pos];
+        if (tok.t === "(") {
+            pos++;
+            const items = [];
+            while (pos < toks.length && toks[pos].t !== ")")
+                items.push(readExpr());
+            if (pos >= toks.length)
+                throw new ParseError("unbalanced parenthesis");
+            pos++; // consume the ")"
+            return { kind: "list", items };
+        }
+        if (tok.t === ")")
+            throw new ParseError("unexpected )");
+        pos++;
+        return tok.t === "str" ? { kind: "str", value: tok.v } : { kind: "sym", name: tok.v };
+    }
+    const expr = readExpr();
+    if (pos !== toks.length)
+        throw new ParseError("trailing tokens after expression");
+    return expr;
+}
+// ── The operator table — the UNION across both shipped institutions ───────────────────────────
+// coltrane's fact-decidable core plus quartet's collection/temporal operators. An operator in this
+// set is IMPLEMENTED (it does not trip the admissibility "unimplemented operator" refusal); one
+// outside it is an unimplemented operator — an admissibility refusal statically, and UNDECIDED at
+// runtime. Some KNOWN operators (subseteq/forall/resolvable/…) still cannot be reduced from facts
+// alone, so they too return UNDECIDED at runtime — that is an honest non-decision, not an unknown.
+const KNOWN_OPERATORS = new Set([
+    "=>",
+    "and",
+    "or",
+    "not",
+    "=",
+    "is-agent",
+    "human-governor",
+    "require",
+    "allow",
+    "deny",
+    "subseteq",
+    "forall",
+    "resolvable",
+    "nonempty",
+    "declared_before",
+    "has",
+    "backed_by_contract",
+]);
+/** `allow` / `deny` are verdict ATOMS, not variables — excluded when collecting free variables. */
+const VERDICT_ATOMS = new Set(["allow", "deny"]);
+function resolveOperand(node, facts) {
+    if (node.kind === "str")
+        return { ok: true, value: node.value };
+    if (node.kind === "sym")
+        return { ok: true, value: facts[node.name] };
+    return { ok: false };
+}
+function asBool(node, facts) {
+    if (node.kind !== "list" || node.items.length === 0)
+        return "U";
+    const head = node.items[0];
+    if (head.kind !== "sym")
+        return "U";
+    const args = node.items.slice(1);
+    switch (head.name) {
+        case "and": {
+            let seenUndecided = false;
+            for (const a of args) {
+                const b = asBool(a, facts);
+                if (b === false)
+                    return false;
+                if (b === "U")
+                    seenUndecided = true;
+            }
+            return seenUndecided ? "U" : true;
+        }
+        case "or": {
+            let seenUndecided = false;
+            for (const a of args) {
+                const b = asBool(a, facts);
+                if (b === true)
+                    return true;
+                if (b === "U")
+                    seenUndecided = true;
+            }
+            return seenUndecided ? "U" : false;
+        }
+        case "not": {
+            if (args.length !== 1)
+                return "U";
+            const b = asBool(args[0], facts);
+            return b === "U" ? "U" : !b;
+        }
+        case "=": {
+            if (args.length !== 2)
+                return "U";
+            const l = resolveOperand(args[0], facts);
+            const r = resolveOperand(args[1], facts);
+            if (!l.ok || !r.ok)
+                return "U";
+            return l.value === r.value;
+        }
+        case "is-agent": {
+            if (args.length !== 1)
+                return "U";
+            const v = resolveOperand(args[0], facts).value;
+            return !!v && typeof v === "object" && v.is_agent === true;
+        }
+        case "human-governor": {
+            if (args.length !== 1)
+                return "U";
+            const v = resolveOperand(args[0], facts).value;
+            return !!v && typeof v === "object" && v.human_governor === true;
+        }
+        default:
+            // A KNOWN-but-not-fact-decidable operator (subseteq/forall/resolvable/nonempty/…) or one this
+            // evaluator does not implement: it cannot be reduced from the supplied facts. UNDECIDED, never
+            // a silent true/false.
+            return "U";
+    }
+}
+function asVerdict(node, facts) {
+    if (node.kind === "sym") {
+        if (node.name === "allow")
+            return "PERMIT";
+        if (node.name === "deny")
+            return "DENY";
+        return "UNDECIDED";
+    }
+    if (node.kind === "str")
+        return "UNDECIDED";
+    if (node.items.length === 0)
+        return "UNDECIDED";
+    const head = node.items[0];
+    if (head.kind !== "sym")
+        return "UNDECIDED";
+    const args = node.items.slice(1);
+    switch (head.name) {
+        case "=>": {
+            // The guard/consequent form: P false → the law does not govern this action (NOT_APPLICABLE);
+            // P true → reduce the consequent; P undecidable → UNDECIDED (never a decision).
+            if (args.length !== 2)
+                return "UNDECIDED";
+            const p = asBool(args[0], facts);
+            if (p === "U")
+                return "UNDECIDED";
+            if (p === false)
+                return "NOT_APPLICABLE";
+            return asVerdict(args[1], facts);
+        }
+        case "require": {
+            // An obligation's check: R holds → the obligation is met (PERMIT); R fails → the or_else fires
+            // (DENY); R undecidable → UNDECIDED.
+            if (args.length !== 1)
+                return "UNDECIDED";
+            const r = asBool(args[0], facts);
+            if (r === "U")
+                return "UNDECIDED";
+            return r ? "PERMIT" : "DENY";
+        }
+        case "allow":
+            return "PERMIT";
+        case "deny":
+            return "DENY";
+        default:
+            // A boolean/collection operator in verdict position, or an unimplemented one: the fact-only
+            // evaluator cannot reduce it to a decision.
+            return "UNDECIDED";
+    }
+}
+/**
+ * Evaluate a law's `check` against a supplied fact record and return exactly one Verdict.
+ *
+ * The interface is the fixed seam: an SMT/solver backend (SMT-LIB2 is itself s-expression
+ * many-sorted first-order logic) is reachable later behind this identical signature without
+ * changing any caller — solve-vs-evaluate stays inside the box, provided the in-house evaluator
+ * keeps "cannot decide" explicit (UNDECIDED) rather than defaulting.
+ *
+ * Total: it never throws. A declared input the fact record does not supply is DEAD_NAME (fail
+ * closed); an unparseable or irreducible predicate is UNDECIDED; neither is ever a PERMIT or DENY.
+ */
+export function evaluate(check, facts) {
+    // Fail closed on a dead name FIRST: a name the law declares in `check.inputs` but the fact record
+    // does not supply. The exact analogue of resolveAgentGrants().unknown — a promised name with no
+    // backing. Checked before reduction so a missing input never masquerades as a decision.
+    const inputs = check.inputs;
+    for (const name of Object.keys(inputs)) {
+        if (!Object.prototype.hasOwnProperty.call(facts, name))
+            return "DEAD_NAME";
+    }
+    let ast;
+    try {
+        ast = parse(check.predicate);
+    }
+    catch {
+        // A predicate that does not parse cannot be reduced from facts. Runtime never throws and never
+        // decides; an unparseable predicate is REFUSED statically by checkInstitutionAdmissibility.
+        return "UNDECIDED";
+    }
+    return asVerdict(ast, facts);
+}
+function asRecord(v) {
+    return v !== null && typeof v === "object" ? v : {};
+}
+/** Walk a parsed predicate, partitioning symbols into operators (head position) and free variables
+ *  (operand position, excluding the verdict atoms allow/deny and string literals). */
+/** Operators that BIND their first argument: `(forall x collection body)` introduces `x` for the
+ *  body's extent. Without this the binder reads as a free variable, and a well-formed law is
+ *  refused for referencing an input it was never supposed to declare — which is how the first real
+ *  run of the admissibility check reported two correct quartet laws as broken. Knowing `forall` as
+ *  an operator is not the same as knowing it as a binder. */
+const BINDING_OPERATORS = new Set(["forall", "exists"]);
+function collectSymbols(node, vars, ops, isHead, bound = new Set()) {
+    if (node.kind === "list") {
+        if (node.items.length === 0)
+            return;
+        const head = node.items[0];
+        // A binding form: item[1] is the variable it introduces, in scope for everything after it. The
+        // binder itself is never a free variable and never an input the law must declare.
+        if (head?.kind === "sym" && BINDING_OPERATORS.has(head.name) && node.items[1]?.kind === "sym") {
+            const inner = new Set(bound);
+            inner.add(node.items[1].name);
+            ops.add(head.name);
+            // Skip items[0] (the operator, already recorded) and items[1] (the binder, not a reference).
+            for (let i = 2; i < node.items.length; i++)
+                collectSymbols(node.items[i], vars, ops, false, inner);
+            return;
+        }
+        for (let i = 0; i < node.items.length; i++)
+            collectSymbols(node.items[i], vars, ops, i === 0, bound);
+        return;
+    }
+    if (node.kind === "sym") {
+        if (isHead)
+            ops.add(node.name);
+        // A symbol bound by an enclosing quantifier is a reference to that binding, not a free
+        // variable. Everything else still is — the fix must narrow the false positive, not grant
+        // amnesty to genuinely undeclared names appearing inside a quantifier body.
+        else if (!VERDICT_ATOMS.has(node.name) && !bound.has(node.name))
+            vars.add(node.name);
+    }
+    // string literals are values, not names
+}
+function checkLaw(law, offenders) {
+    const l = asRecord(law);
+    const ref = typeof l.aim === "string" && l.aim.length > 0 ? l.aim : "(law)";
+    const push = (reason) => {
+        offenders.push({ kind: "law", ref, reason });
+    };
+    const check = asRecord(l.check);
+    const predicate = check.predicate;
+    const inputs = asRecord(check.inputs);
+    if (typeof predicate !== "string") {
+        push("law has no check.predicate to evaluate");
+        return;
+    }
+    let ast;
+    try {
+        ast = parse(predicate);
+    }
+    catch (e) {
+        push(`predicate does not parse: ${e instanceof Error ? e.message : String(e)}`);
+        return;
+    }
+    const vars = new Set();
+    const ops = new Set();
+    collectSymbols(ast, vars, ops, false);
+    const declared = new Set(Object.keys(inputs));
+    // Var-declaration closure, both directions: every free variable is declared, AND every declared
+    // input is referenced (an unused declaration is a typo-mask that overclaims the law's surface).
+    for (const v of vars) {
+        if (!declared.has(v))
+            push(`predicate references undeclared variable "${v}"`);
+    }
+    for (const d of declared) {
+        if (!vars.has(d))
+            push(`declared input "${d}" is never referenced by the predicate`);
+    }
+    // Every operator the predicate names must be implemented; an unknown operator must not pass.
+    for (const op of ops) {
+        if (!KNOWN_OPERATORS.has(op))
+            push(`predicate uses an unimplemented operator "${op}"`);
+    }
+    // or_else is the ADICO slot that separates a RULE from a norm; the schema's z.string() lets ''
+    // through, so admissibility is where an empty consequence-on-breach is caught.
+    if (typeof l.or_else !== "string" || l.or_else.trim() === "") {
+        push("or_else is empty — a rule needs a stated consequence on breach");
+    }
+}
+function checkChair(chair, offenders) {
+    const c = asRecord(chair);
+    const role = typeof c.role === "string" ? c.role : "(chair)";
+    const obligations = Array.isArray(c.obligations) ? c.obligations : [];
+    for (const raw of obligations) {
+        const ob = asRecord(raw);
+        const aim = typeof ob.aim === "string" ? ob.aim : "(obligation)";
+        // Verified OR explicitly marked declared-tier. There is no verifier surface in this genome, so
+        // an obligation states its tier: "enforced" claims a verifier backs it, "declared" states it is
+        // a norm with no runtime check. An UNMARKED obligation is refused — silence must not pass a norm
+        // off as a rule.
+        if (ob.tier !== "declared" && ob.tier !== "enforced") {
+            offenders.push({
+                kind: "obligation",
+                ref: `${role} :: ${aim}`,
+                reason: "obligation is neither verified nor explicitly marked declared-tier",
+            });
+        }
+    }
+}
+/**
+ * Refuse an institution document that claims more enforcement than it has. Per law: the predicate
+ * parses; every free variable is declared in `check.inputs` and every declared input is referenced;
+ * every operator is implemented; `or_else` is non-empty. Per chair obligation: it is verified OR
+ * explicitly marked declared-tier — an unmarked unverified obligation is refused, so silence cannot
+ * pass a norm off as a rule. Collects every offender and refuses once (collect-all / refuse-once,
+ * mirroring runtime.ts's PreflightDispatchError sweep).
+ *
+ * This is an explicitly-invoked pure function; it is deliberately NOT wired into loadGenome, so
+ * quartet.json (unmarked obligations, non-fact-decidable operators) still loads unchanged.
+ */
+export function checkInstitutionAdmissibility(doc) {
+    const offenders = [];
+    const institution = asRecord(doc.institution);
+    const laws = Array.isArray(institution.laws) ? institution.laws : [];
+    for (const law of laws)
+        checkLaw(law, offenders);
+    const chairs = Array.isArray(doc.chairs) ? doc.chairs : [];
+    for (const chair of chairs)
+        checkChair(chair, offenders);
+    return { admitted: offenders.length === 0, offenders };
+}
+/**
+ * The STATIC half of evaluability, reused by the committed-work layer so acceptance and law share
+ * one grammar rather than minting a second: a LawCheck is evaluable when its predicate parses and
+ * every free variable it references is declared in `inputs`. This is exactly the undeclared-variable
+ * refusal checkLaw applies — a predicate naming a variable it never declares can never reduce to a
+ * decision, so an UNMARKED commitment carrying one must be refused (silence must not pass a stated
+ * intention off as a checkable commitment). Total: returns false on a predicate that does not parse.
+ */
+export function lawCheckIsEvaluable(check) {
+    let ast;
+    try {
+        ast = parse(check.predicate);
+    }
+    catch {
+        return false;
+    }
+    const vars = new Set();
+    const ops = new Set();
+    collectSymbols(ast, vars, ops, false);
+    for (const v of vars) {
+        if (!Object.prototype.hasOwnProperty.call(check.inputs, v))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=institution_enforcement.js.map

package/dist/src/institution_enforcement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"institution_enforcement.js","sourceRoot":"","sources":["../../src/institution_enforcement.ts"],"names":[],"mappings":"AAAA,4FAA4F;AAC5F,kEAAkE;AAClE,EAAE;AACF,yFAAyF;AACzF,6FAA6F;AAC7F,4FAA4F;AAC5F,oFAAoF;AACpF,wFAAwF;AACxF,6FAA6F;AAC7F,OAAO;AACP,EAAE;AACF,+FAA+F;AAC/F,+FAA+F;AAC/F,gGAAgG;AAChG,0FAA0F;AAC1F,iGAAiG;AACjG,gDAAgD;AAqBhD,mGAAmG;AACnG,MAAM,CAAC,MAAM,QAAQ,GAAuB;IAC1C,QAAQ;IACR,MAAM;IACN,gBAAgB;IAChB,WAAW;IACX,WAAW;CACZ,CAAC;AAWF,iGAAiG;AACjG,mGAAmG;AACnG,6FAA6F;AAC7F,6FAA6F;AAC7F,+EAA+E;AAE/E,MAAM,UAAW,SAAQ,KAAK;CAAG;AASjC,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AACpG,CAAC;AAED,SAAS,QAAQ,CAAC,GAAW;IAC3B,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACxD,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACrB,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACrB,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC/B,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;oBACjB,CAAC,IAAI,CAAC,CAAC;oBACP,SAAS;gBACX,CAAC;gBACD,CAAC,IAAI,GAAG,CAAC,CAAC,CAAE,CAAC;gBACb,CAAC,EAAE,CAAC;YACN,CAAC;YACD,IAAI,CAAC,IAAI,CAAC;gBAAE,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;YAChE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YAAE,CAAC,EAAE,CAAC;QAC3C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,KAAK,CAAC,GAAW;IACxB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,SAAS,QAAQ;QACf,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,UAAU,CAAC,yBAAyB,CAAC,CAAC;QACxE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAE,CAAC;QACvB,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAClB,GAAG,EAAE,CAAC;YACN,MAAM,KAAK,GAAY,EAAE,CAAC;YAC1B,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAE,CAAC,CAAC,KAAK,GAAG;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YACzE,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;YACvE,GAAG,EAAE,CAAC,CAAC,kBAAkB;YACzB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,cAAc,CAAC,CAAC;QACxD,GAAG,EAAE,CAAC;QACN,OAAO,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IACxF,CAAC;IACD,MAAM,IAAI,GAAG,QAAQ,EAAE,CAAC;IACxB,IAAI,GAAG,KAAK,IAAI,CAAC,MAAM;QAAE,MAAM,IAAI,UAAU,CAAC,kCAAkC,CAAC,CAAC;IAClF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iGAAiG;AACjG,mGAAmG;AACnG,gGAAgG;AAChG,kGAAkG;AAClG,kGAAkG;AAClG,mGAAmG;AACnG,MAAM,eAAe,GAAwB,IAAI,GAAG,CAAS;IAC3D,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,GAAG;IACH,UAAU;IACV,gBAAgB;IAChB,SAAS;IACT,OAAO;IACP,MAAM;IACN,UAAU;IACV,QAAQ;IACR,YAAY;IACZ,UAAU;IACV,iBAAiB;IACjB,KAAK;IACL,oBAAoB;CACrB,CAAC,CAAC;AAEH,mGAAmG;AACnG,MAAM,aAAa,GAAwB,IAAI,GAAG,CAAS,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;AAS9E,SAAS,cAAc,CAAC,IAAW,EAAE,KAAiB;IACpD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IAChE,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACtE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;AACvB,CAAC;AAED,SAAS,MAAM,CAAC,IAAW,EAAE,KAAiB;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAChE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;IAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,GAAG,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,aAAa,GAAG,KAAK,CAAC;YAC1B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,KAAK;oBAAE,OAAO,KAAK,CAAC;gBAC9B,IAAI,CAAC,KAAK,GAAG;oBAAE,aAAa,GAAG,IAAI,CAAC;YACtC,CAAC;YACD,OAAO,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QACpC,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,IAAI,aAAa,GAAG,KAAK,CAAC;YAC1B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,IAAI;oBAAE,OAAO,IAAI,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG;oBAAE,aAAa,GAAG,IAAI,CAAC;YACtC,CAAC;YACD,OAAO,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QACrC,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YAClC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAClC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,GAAG,CAAC,CAAC,CAAC;YACT,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YAClC,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAC1C,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE;gBAAE,OAAO,GAAG,CAAC;YAC/B,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC;QAC7B,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YAClC,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC;YAChD,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAK,CAA6B,CAAC,QAAQ,KAAK,IAAI,CAAC;QAC1F,CAAC;QACD,KAAK,gBAAgB,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YAClC,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC;YAChD,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAK,CAA6B,CAAC,cAAc,KAAK,IAAI,CAAC;QAChG,CAAC;QACD;YACE,8FAA8F;YAC9F,+FAA+F;YAC/F,uBAAuB;YACvB,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,IAAW,EAAE,KAAiB;IAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,QAAQ,CAAC;QAC3C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC;QACxC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,WAAW,CAAC;IAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;IAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,WAAW,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,6FAA6F;YAC7F,gFAAgF;YAChF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,WAAW,CAAC;YAC1C,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,GAAG;gBAAE,OAAO,WAAW,CAAC;YAClC,IAAI,CAAC,KAAK,KAAK;gBAAE,OAAO,gBAAgB,CAAC;YACzC,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,+FAA+F;YAC/F,qCAAqC;YACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,WAAW,CAAC;YAC1C,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,GAAG;gBAAE,OAAO,WAAW,CAAC;YAClC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;QAC/B,CAAC;QACD,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,MAAM,CAAC;QAChB;YACE,4FAA4F;YAC5F,4CAA4C;YAC5C,OAAO,WAAW,CAAC;IACvB,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAe,EAAE,KAAiB;IACzD,kGAAkG;IAClG,gGAAgG;IAChG,wFAAwF;IACxF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,OAAO,WAAW,CAAC;IAC7E,CAAC;IACD,IAAI,GAAU,CAAC;IACf,IAAI,CAAC;QACH,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,+FAA+F;QAC/F,4FAA4F;QAC5F,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC;AAsBD,SAAS,QAAQ,CAAC,CAAU;IAC1B,OAAO,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,CAA6B,CAAC,CAAC,CAAC,EAAE,CAAC;AACnF,CAAC;AAED;sFACsF;AACtF;;;;6DAI6D;AAC7D,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AAExD,SAAS,cAAc,CACrB,IAAW,EACX,IAAiB,EACjB,GAAgB,EAChB,MAAe,EACf,QAA6B,IAAI,GAAG,EAAE;IAEtC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,+FAA+F;QAC/F,kFAAkF;QAClF,IAAI,IAAI,EAAE,IAAI,KAAK,KAAK,IAAI,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,KAAK,EAAE,CAAC;YAC9F,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;YAC7B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC9B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,6FAA6F;YAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACpG,OAAO;QACT,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;QACtG,OAAO;IACT,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACxB,IAAI,MAAM;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,uFAAuF;QACvF,yFAAyF;QACzF,4EAA4E;aACvE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvF,CAAC;IACD,wCAAwC;AAC1C,CAAC;AAED,SAAS,QAAQ,CAAC,GAAY,EAAE,SAAkC;IAChE,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;IAC5E,MAAM,IAAI,GAAG,CAAC,MAAc,EAAQ,EAAE;QACpC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;IAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;QAClC,IAAI,CAAC,wCAAwC,CAAC,CAAC;QAC/C,OAAO;IACT,CAAC;IACD,IAAI,GAAU,CAAC;IACf,IAAI,CAAC;QACH,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IACzB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,6BAA6B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChF,OAAO;IACT,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9C,gGAAgG;IAChG,gGAAgG;IAChG,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,6CAA6C,CAAC,GAAG,CAAC,CAAC;IAChF,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,mBAAmB,CAAC,wCAAwC,CAAC,CAAC;IACvF,CAAC;IACD,6FAA6F;IAC7F,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,6CAA6C,EAAE,GAAG,CAAC,CAAC;IACzF,CAAC;IACD,+FAA+F;IAC/F,+EAA+E;IAC/E,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC7D,IAAI,CAAC,gEAAgE,CAAC,CAAC;IACzE,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,KAAc,EAAE,SAAkC;IACpE,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7D,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;QACjE,+FAA+F;QAC/F,gGAAgG;QAChG,iGAAiG;QACjG,iBAAiB;QACjB,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACrD,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,YAAY;gBAClB,GAAG,EAAE,GAAG,IAAI,OAAO,GAAG,EAAE;gBACxB,MAAM,EAAE,oEAAoE;aAC7E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,6BAA6B,CAAC,GAAwB;IACpE,MAAM,SAAS,GAA4B,EAAE,CAAC;IAC9C,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IACrE,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACzD,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,SAAS,EAAE,CAAC;AACzD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAe;IACjD,IAAI,GAAU,CAAC;IACf,IAAI,CAAC;QACH,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC3E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/src/institution_loader.d.ts

@@ -0,0 +1,63 @@
+import type { LoadError } from "./loader.js";
+import type { InstitutionOutput, OrganizationOutput, AgentRecordOutput, InstitutionalChairOutput, ChairAssignmentOutput, ForebearOutput, LineageEdgeOutput, NorthstarOutput, TourOutput, ResourceOutput } from "./genome_schema.js";
+/** The multi-section institution document as it lives on disk (shape per institutions/quartet.json).
+ *  Each present section is validated LOSS-FREE against its already-authored per-section schema in
+ *  src/genome_schema.ts; an absent optional section is treated as empty, not as an error. This IS
+ *  the `definition` a store row carries (see docs spec ITEM 4) — file and store backings share it so
+ *  they cannot drift. */
+export interface InstitutionDocumentSections {
+    institution: InstitutionOutput;
+    organizations?: readonly OrganizationOutput[];
+    agent_records?: readonly AgentRecordOutput[];
+    org_members?: readonly {
+        org_slug: string;
+        agent_slug: string;
+    }[];
+    chairs?: readonly InstitutionalChairOutput[];
+    assignments?: readonly ChairAssignmentOutput[];
+    forebears?: readonly ForebearOutput[];
+    lineage_edges?: readonly LineageEdgeOutput[];
+    northstars?: readonly NorthstarOutput[];
+}
+/** A validated, ADMITTED institution carried in the loaded genome, keyed by institution slug.
+ *  Only documents that (a) parse, (b) validate section-by-section, and (c) pass
+ *  checkInstitutionAdmissibility appear here — an inadmissible one fails closed into a load_error. */
+export interface LoadedInstitution {
+    slug: string;
+    document: InstitutionDocumentSections;
+}
+/**
+ * SEAM (RED — body throws). Read every institutions/*.json under `root`, validate each present
+ * section against its per-section schema, invoke checkInstitutionAdmissibility on the schema-valid
+ * document, and return the admitted institutions keyed by slug PLUS one load_error of kind
+ * "institution" per file that is malformed, schema-invalid, inadmissible, or a duplicate slug.
+ *
+ * TOTAL by contract: the GREEN body must never throw for an institution reason — a bad document is
+ * a per-file load_error and drops out; the rest of the genome loads. Deliberately NOT wired into
+ * loadGenome yet: wiring it (after the agent/standard/org maps exist) is the GREEN change these red
+ * tests demand. Until then this throws, so the tree compiles and red is honest.
+ */
+export declare function loadInstitutions(root: string): {
+    institutions: Map<string, LoadedInstitution>;
+    load_errors: LoadError[];
+};
+/** A tour document as it lives on disk: the tour plus the resources its draws name. */
+export interface LoadedTour {
+    slug: string;
+    document: {
+        tour: TourOutput;
+        resources: ResourceOutput[];
+    };
+}
+/**
+ * Read every tours/*.json under `root`, validate the tour + resources against their schemas, resolve
+ * each tour against its institution from the ALREADY-LOADED institutions map (its chairs, so an
+ * accountable office / responsible chair is checked against real chairs), and invoke
+ * checkTourAdmissibility fail-closed. An admitted tour is carried keyed by slug; a malformed,
+ * schema-invalid, inadmissible, unresolved-institution, or duplicate-slug document drops out as one
+ * "tour" load_error. TOTAL — it never throws for a tour reason.
+ */
+export declare function loadTours(root: string, institutions: ReadonlyMap<string, LoadedInstitution>): {
+    tours: Map<string, LoadedTour>;
+    load_errors: LoadError[];
+};