@real-life/trust-protocol 0.1.0

package/dist/identity.js

@@ -0,0 +1,87 @@
+// identity — the Identity Layer: one root seed, every context derived.
+//
+// A person holds ONE secret. Everything else is derived from it through
+// the ordinary rltp/anchor family: the community anchor that carries the
+// stable social identity, a pair anchor per relationship, a member
+// anchor per group, public personas. No two contexts link to each other
+// unless their holder deliberately discloses the link.
+//
+// The label registry is CLOSED (Identity §6.1, unchanged since 0.13):
+// exactly three label forms derive, and this API rejects every other
+// string before any key derivation — fail closed, no repair. `self`,
+// `recovery`, `carrier` and `device/…` are not labels; recovery and the
+// carrier-relationship identity have their own fixed derivations outside
+// this registry and are deliberately NOT part of this module yet.
+//
+// Fresh-always (Encounter §4.4): a ceremony mints a pair context whose
+// label digests the NONCE BYTES, so nothing correlatable is displayed —
+// not even to someone who scanned the same person yesterday.
+import { toU } from './core.js';
+import { hkdf, edFromSeed, xFromSeed, anchorOfEd, mkOfX, digestBytes } from './crypto.js';
+import { allowed15, WHITE_SPACE_15 } from './unicode15.js';
+// ── the closed registry (Identity §6.1) ─────────────────────────────────
+// A digest component is the ONE canonical u rendering of a sha2-256
+// multihash: 47 characters, no padding, no non-zero trailing bits, no z.
+const digestComponent = (d) => d.length === 47 && d[0] === 'u' && toU(d) === d;
+// §6.2 — the ordered persona-name pipeline. NFC is the one permitted
+// normalization (applied, not rejected); every later check runs on the
+// NFC result — and every Unicode property is evaluated against the
+// PINNED 15.0 data in unicode15.ts, never the platform's tables (review
+// 2, B-1: Node 22 ships Unicode 16 — a post-15.0 code point must not
+// derive an anchor on one runtime and be rejected on another).
+const personaName = (raw) => {
+    if (!raw.isWellFormed())
+        return null; // no lone surrogates
+    const name = raw.normalize('NFC'); // NFC of 15.0-assigned code points is version-stable by Unicode's guarantee
+    const cps = [...name];
+    if (cps.length < 1 || cps.length > 64)
+        return null;
+    if (new TextEncoder().encode(name).length > 256)
+        return null;
+    if (name.includes('/'))
+        return null; // labels have exactly the components the registry shows
+    for (const c of cps)
+        if (!allowed15(c.codePointAt(0)))
+            return null; // assigned in 15.0, no Cc/Cf
+    if (WHITE_SPACE_15.has(cps[0].codePointAt(0)) || WHITE_SPACE_15.has(cps[cps.length - 1].codePointAt(0)))
+        return null;
+    return name;
+};
+/**
+ * The canonical form of a registry label, or null for everything the
+ * closed registry rejects. Personas come back NFC-normalized — for them
+ * the canonical label may differ from the input; label equality IS
+ * anchor identity, so derivation always uses the canonical form.
+ */
+export function canonicalLabel(label) {
+    if (typeof label !== 'string')
+        return null;
+    if (label.startsWith('group/'))
+        return digestComponent(label.slice(6)) ? label : null;
+    if (label.startsWith('pair/'))
+        return digestComponent(label.slice(5)) ? label : null;
+    if (label.startsWith('persona/')) {
+        const name = personaName(label.slice(8));
+        return name === null ? null : 'persona/' + name;
+    }
+    return null; // self, recovery, carrier, device/…, and every unknown form: fail closed
+}
+export async function labeledContext(rootIkm, label) {
+    const canonical = canonicalLabel(label);
+    if (canonical === null)
+        throw new Error(`not a label of the closed registry (Identity §6.1): ${JSON.stringify(label)}`);
+    const ed = await edFromSeed(await hkdf(rootIkm, 'rltp/anchor/ed/' + canonical));
+    const x = await xFromSeed(await hkdf(rootIkm, 'rltp/anchor/x/' + canonical));
+    return { label: canonical, ed, x, anchor: anchorOfEd(ed.pubRaw), keyAgreement: mkOfX(x.pubRaw) };
+}
+// fresh-always (Encounter §4.4): label = pair/<multihash over the NONCE
+// BYTES>. The nonce is the holder's own, fresh, and exactly 32 bytes —
+// a shorter one weakens the label to below its specified entropy (B-2).
+export async function pairContext(rootIkm, nonce) {
+    if (!(nonce instanceof Uint8Array) || nonce.length !== 32)
+        throw new Error('pair nonce must be exactly 32 bytes (Identity §6.1)');
+    return labeledContext(rootIkm, 'pair/' + await digestBytes(nonce));
+}
+/** The community anchor: an ordinary group context over the community's genesis digest. */
+export const communityContext = (rootIkm, genesisDigest) => labeledContext(rootIkm, 'group/' + genesisDigest);
+//# sourceMappingURL=identity.js.map

package/dist/identity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"identity.js","sourceRoot":"","sources":["../src/identity.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,EAAE;AACF,wEAAwE;AACxE,yEAAyE;AACzE,mEAAmE;AACnE,wEAAwE;AACxE,uDAAuD;AACvD,EAAE;AACF,sEAAsE;AACtE,qEAAqE;AACrE,qEAAqE;AACrE,wEAAwE;AACxE,yEAAyE;AACzE,kEAAkE;AAClE,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,6DAA6D;AAC7D,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAA;AAC/B,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAEzF,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAe1D,2EAA2E;AAC3E,oEAAoE;AACpE,yEAAyE;AACzE,MAAM,eAAe,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;AAE/F,qEAAqE;AACrE,uEAAuE;AACvE,mEAAmE;AACnE,wEAAwE;AACxE,qEAAqE;AACrE,+DAA+D;AAC/D,MAAM,WAAW,GAAG,CAAC,GAAW,EAAiB,EAAE;IACjD,IAAI,CAAE,GAA8C,CAAC,YAAY,EAAE;QAAE,OAAO,IAAI,CAAA,CAAC,qBAAqB;IACtG,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA,CAAE,4EAA4E;IAC/G,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAA;IACrB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,CAAA;IAClD,IAAI,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,IAAI,CAAA;IAC5D,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA,CAAoB,wDAAwD;IAC/G,KAAK,MAAM,CAAC,IAAI,GAAG;QAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;YAAE,OAAO,IAAI,CAAA,CAAC,6BAA6B;IACjG,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;QAAE,OAAO,IAAI,CAAA;IACxH,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAE,KAAa;IAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAA;IAC1C,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC;QAAE,OAAO,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;IACrF,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;IACpF,IAAI,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACxC,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAA;IACjD,CAAC;IACD,OAAO,IAAI,CAAA,CAAC,yEAAyE;AACvF,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAAE,OAAmB,EAAE,KAAa;IACtE,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC,CAAA;IACvC,IAAI,SAAS,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,uDAAuD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACvH,MAAM,EAAE,GAAG,MAAM,UAAU,CAAC,MAAM,IAAI,CAAC,OAAO,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC,CAAA;IAC/E,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,MAAM,IAAI,CAAC,OAAO,EAAE,gBAAgB,GAAG,SAAS,CAAC,CAAC,CAAA;IAC5E,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAA;AAClG,CAAC;AAED,wEAAwE;AACxE,uEAAuE;AACvE,wEAAwE;AACxE,MAAM,CAAC,KAAK,UAAU,WAAW,CAAE,OAAmB,EAAE,KAAiB;IACvE,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAA;IACjI,OAAO,cAAc,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,WAAW,CAAC,KAAK,CAAC,CAAC,CAAA;AACpE,CAAC;AAED,2FAA2F;AAC3F,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,OAAmB,EAAE,aAAqB,EAAoB,EAAE,CAC/F,cAAc,CAAC,OAAO,EAAE,QAAQ,GAAG,aAAa,CAAC,CAAA","sourcesContent":["// identity — the Identity Layer: one root seed, every context derived.\n//\n// A person holds ONE secret. Everything else is derived from it through\n// the ordinary rltp/anchor family: the community anchor that carries the\n// stable social identity, a pair anchor per relationship, a member\n// anchor per group, public personas. No two contexts link to each other\n// unless their holder deliberately discloses the link.\n//\n// The label registry is CLOSED (Identity §6.1, unchanged since 0.13):\n// exactly three label forms derive, and this API rejects every other\n// string before any key derivation — fail closed, no repair. `self`,\n// `recovery`, `carrier` and `device/…` are not labels; recovery and the\n// carrier-relationship identity have their own fixed derivations outside\n// this registry and are deliberately NOT part of this module yet.\n//\n// Fresh-always (Encounter §4.4): a ceremony mints a pair context whose\n// label digests the NONCE BYTES, so nothing correlatable is displayed —\n// not even to someone who scanned the same person yesterday.\nimport { toU } from './core.js'\nimport { hkdf, edFromSeed, xFromSeed, anchorOfEd, mkOfX, digestBytes } from './crypto.js'\nimport type { KeyPair } from './crypto.js'\nimport { allowed15, WHITE_SPACE_15 } from './unicode15.js'\n\n/**\n * One derived identity context: its label, both key pairs, and the two\n * public forms others see — the did:key anchor and the multikey for key\n * agreement. Contexts never link to each other without a deliberate act.\n */\nexport interface Context {\n  label: string\n  ed: KeyPair\n  x: KeyPair\n  anchor: string\n  keyAgreement: string\n}\n\n// ── the closed registry (Identity §6.1) ─────────────────────────────────\n// A digest component is the ONE canonical u rendering of a sha2-256\n// multihash: 47 characters, no padding, no non-zero trailing bits, no z.\nconst digestComponent = (d: string): boolean => d.length === 47 && d[0] === 'u' && toU(d) === d\n\n// §6.2 — the ordered persona-name pipeline. NFC is the one permitted\n// normalization (applied, not rejected); every later check runs on the\n// NFC result — and every Unicode property is evaluated against the\n// PINNED 15.0 data in unicode15.ts, never the platform's tables (review\n// 2, B-1: Node 22 ships Unicode 16 — a post-15.0 code point must not\n// derive an anchor on one runtime and be rejected on another).\nconst personaName = (raw: string): string | null => {\n  if (!(raw as unknown as { isWellFormed(): boolean }).isWellFormed()) return null // no lone surrogates\n  const name = raw.normalize('NFC')  // NFC of 15.0-assigned code points is version-stable by Unicode's guarantee\n  const cps = [...name]\n  if (cps.length < 1 || cps.length > 64) return null\n  if (new TextEncoder().encode(name).length > 256) return null\n  if (name.includes('/')) return null                    // labels have exactly the components the registry shows\n  for (const c of cps) if (!allowed15(c.codePointAt(0)!)) return null // assigned in 15.0, no Cc/Cf\n  if (WHITE_SPACE_15.has(cps[0]!.codePointAt(0)!) || WHITE_SPACE_15.has(cps[cps.length - 1]!.codePointAt(0)!)) return null\n  return name\n}\n\n/**\n * The canonical form of a registry label, or null for everything the\n * closed registry rejects. Personas come back NFC-normalized — for them\n * the canonical label may differ from the input; label equality IS\n * anchor identity, so derivation always uses the canonical form.\n */\nexport function canonicalLabel (label: string): string | null {\n  if (typeof label !== 'string') return null\n  if (label.startsWith('group/')) return digestComponent(label.slice(6)) ? label : null\n  if (label.startsWith('pair/')) return digestComponent(label.slice(5)) ? label : null\n  if (label.startsWith('persona/')) {\n    const name = personaName(label.slice(8))\n    return name === null ? null : 'persona/' + name\n  }\n  return null // self, recovery, carrier, device/…, and every unknown form: fail closed\n}\n\nexport async function labeledContext (rootIkm: Uint8Array, label: string): Promise<Context> {\n  const canonical = canonicalLabel(label)\n  if (canonical === null) throw new Error(`not a label of the closed registry (Identity §6.1): ${JSON.stringify(label)}`)\n  const ed = await edFromSeed(await hkdf(rootIkm, 'rltp/anchor/ed/' + canonical))\n  const x = await xFromSeed(await hkdf(rootIkm, 'rltp/anchor/x/' + canonical))\n  return { label: canonical, ed, x, anchor: anchorOfEd(ed.pubRaw), keyAgreement: mkOfX(x.pubRaw) }\n}\n\n// fresh-always (Encounter §4.4): label = pair/<multihash over the NONCE\n// BYTES>. The nonce is the holder's own, fresh, and exactly 32 bytes —\n// a shorter one weakens the label to below its specified entropy (B-2).\nexport async function pairContext (rootIkm: Uint8Array, nonce: Uint8Array): Promise<Context> {\n  if (!(nonce instanceof Uint8Array) || nonce.length !== 32) throw new Error('pair nonce must be exactly 32 bytes (Identity §6.1)')\n  return labeledContext(rootIkm, 'pair/' + await digestBytes(nonce))\n}\n\n/** The community anchor: an ordinary group context over the community's genesis digest. */\nexport const communityContext = (rootIkm: Uint8Array, genesisDigest: string): Promise<Context> =>\n  labeledContext(rootIkm, 'group/' + genesisDigest)\n"]}

package/dist/index.d.ts

@@ -0,0 +1,6 @@
+export * from './core.js';
+export * from './crypto.js';
+export * from './identity.js';
+export * from './encounter.js';
+export * from './delivery.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAwBA,cAAc,WAAW,CAAA;AACzB,cAAc,aAAa,CAAA;AAC3B,cAAc,eAAe,CAAA;AAC7B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,eAAe,CAAA"}

package/dist/index.js

@@ -0,0 +1,29 @@
+// @real-life/trust-protocol — the cryptographic core of RLTP.
+//
+// What this entry point IS: the wire-level primitives of the converged
+// layers, reproducing the shipped test vectors byte for byte — the
+// canonical form, the derivation of identity contexts under the closed
+// label registry, the encounter wire builders, the sealed envelope and
+// the generic receive chain.
+//
+// What it is NOT (yet): the layers' state machines. Identity's recovery
+// and carrier derivations, Encounter's ceremony record and acceptance
+// machinery, Delivery's type-specific stages and residual bookkeeping
+// live in the specification and its conformance fixtures, not here. A
+// conformant implementation builds ON this module; importing it is not
+// yet conformance. The README states per module which casting's wire
+// forms it implements.
+//
+//   core       the form every artifact obeys
+//   crypto     the primitives, and the Data Integrity proof
+//   identity   context derivation under the closed registry (§6.1/§6.2)
+//   encounter  the ceremony's wire forms: challenges, cards, credentials
+//   delivery   the sealed envelope and the generic receive stages 1–4
+//
+// Specification, schemas and vectors: https://rltp.real-life.org
+export * from './core.js';
+export * from './crypto.js';
+export * from './identity.js';
+export * from './encounter.js';
+export * from './delivery.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,EAAE;AACF,uEAAuE;AACvE,mEAAmE;AACnE,uEAAuE;AACvE,uEAAuE;AACvE,6BAA6B;AAC7B,EAAE;AACF,wEAAwE;AACxE,sEAAsE;AACtE,sEAAsE;AACtE,sEAAsE;AACtE,uEAAuE;AACvE,qEAAqE;AACrE,uBAAuB;AACvB,EAAE;AACF,6CAA6C;AAC7C,4DAA4D;AAC5D,wEAAwE;AACxE,yEAAyE;AACzE,sEAAsE;AACtE,EAAE;AACF,iEAAiE;AAEjE,cAAc,WAAW,CAAA;AACzB,cAAc,aAAa,CAAA;AAC3B,cAAc,eAAe,CAAA;AAC7B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,eAAe,CAAA","sourcesContent":["// @real-life/trust-protocol — the cryptographic core of RLTP.\n//\n// What this entry point IS: the wire-level primitives of the converged\n// layers, reproducing the shipped test vectors byte for byte — the\n// canonical form, the derivation of identity contexts under the closed\n// label registry, the encounter wire builders, the sealed envelope and\n// the generic receive chain.\n//\n// What it is NOT (yet): the layers' state machines. Identity's recovery\n// and carrier derivations, Encounter's ceremony record and acceptance\n// machinery, Delivery's type-specific stages and residual bookkeeping\n// live in the specification and its conformance fixtures, not here. A\n// conformant implementation builds ON this module; importing it is not\n// yet conformance. The README states per module which casting's wire\n// forms it implements.\n//\n//   core       the form every artifact obeys\n//   crypto     the primitives, and the Data Integrity proof\n//   identity   context derivation under the closed registry (§6.1/§6.2)\n//   encounter  the ceremony's wire forms: challenges, cards, credentials\n//   delivery   the sealed envelope and the generic receive stages 1–4\n//\n// Specification, schemas and vectors: https://rltp.real-life.org\n\nexport * from './core.js'\nexport * from './crypto.js'\nexport * from './identity.js'\nexport * from './encounter.js'\nexport * from './delivery.js'\n"]}

package/dist/probe/continuity.d.ts

@@ -0,0 +1,99 @@
+import * as C from './deps.js';
+import type { Person } from './deps.js';
+export declare const snapshotPriors: (p: Person) => {
+    own: any[];
+    counterpart: string[];
+};
+export declare function buildProbe(p: Person, newKey: string, ent?: any): Promise<{
+    to: any;
+    kind: string;
+    env: C.Envelope;
+}[] | null>;
+export declare function receiveContinuity(p: Person, env: any, when: number, ent?: any): Promise<{
+    handled: boolean;
+    partial: boolean;
+    error?: undefined;
+    matches?: undefined;
+    chained?: undefined;
+    name?: undefined;
+    outbound?: undefined;
+    outboundError?: undefined;
+} | {
+    handled: boolean;
+    matches: number;
+    error?: undefined;
+    partial?: undefined;
+    chained?: undefined;
+    name?: undefined;
+    outbound?: undefined;
+    outboundError?: undefined;
+} | {
+    handled: boolean;
+    matches: number;
+    chained: boolean;
+    name: any;
+    outbound: {
+        to: any;
+        kind: string;
+        env: C.Envelope;
+    }[];
+    outboundError: string | undefined;
+    error?: undefined;
+    partial?: undefined;
+} | {
+    handled: boolean;
+    error: string;
+    chained?: undefined;
+    name?: undefined;
+    outbound?: undefined;
+    outboundError?: undefined;
+} | {
+    handled: boolean;
+    chained: boolean;
+    name: any;
+    outbound: {
+        to: any;
+        kind: string;
+        env: C.Envelope;
+    }[];
+    outboundError: string;
+    error?: undefined;
+} | {
+    handled: boolean;
+    chained: boolean;
+    name: any;
+    outbound: {
+        to: any;
+        kind: string;
+        env: C.Envelope;
+    }[];
+    error?: undefined;
+    outboundError?: undefined;
+} | {
+    handled: boolean;
+    doc: any;
+} | {
+    handled: boolean;
+    duplicate: boolean;
+} | {
+    handled: boolean;
+    duplicate?: undefined;
+}>;
+/**
+ * The host's producing call for a mapping the receiver still owes
+ * (review 6, B-3): a transient seal failure during probe/mapping
+ * handling persists the obligation in contMappingDue; this call — not a
+ * redelivery, which the freshness rule forbids — builds and returns it.
+ */
+export declare function flushContinuity(p: Person, newKey: string, when: number, ent?: any): Promise<{
+    outbound: never[];
+    pending: boolean;
+} | {
+    outbound: {
+        to: any;
+        kind: string;
+        env: C.Envelope;
+    }[];
+    pending?: undefined;
+}>;
+//# sourceMappingURL=continuity.d.ts.map

package/dist/probe/continuity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"continuity.d.ts","sourceRoot":"","sources":["../../src/probe/continuity.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,CAAC,MAAM,WAAW,CAAA;AAC9B,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAiBvC,eAAO,MAAM,cAAc,GAAI,GAAG,MAAM;;;CAGtC,CAAA;AAGF,wBAAsB,UAAU,CAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,GAAE,GAAQ;;;;YAkBzE;AAgDD,wBAAsB,iBAAiB,CAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAE,GAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAOxF;AAsGD;;;;;GAKG;AACH,wBAAsB,eAAe,CAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAE,GAAQ;;;;;;;;;;GAkB5F"}

package/dist/probe/continuity.js

@@ -0,0 +1,303 @@
+// continuity.mjs — rltp-visibility §6a im Simulator: continuity-probe@1 +
+// continuity-mapping@1. „Kontinuität wird NACH der Zeremonie aufgelöst,
+// nie in ihr" (Encounter 4.4): jedes Enactment UND jede Vorstellung prägt
+// ein frisches Tupel; ob es ein Wiedersehen war, klärt die Probe über den
+// frischen Kanal — automatisch, ohne Dialog, ohne Namen.
+//
+// Die Probe ist das dritte Mitglied EINER Familie (Stern, Mapping, Probe:
+// geblendete Werte unter Beziehungs-Schlüsseln): die EIGENEN bisherigen
+// pair-Anker reisen als HMAC unter k_p (DH des NEUEN Kanals), gepolstert
+// auf Vielfache von 256, sortiert, sequenziert. Nur wer eine der
+// Beziehungen wirklich hält, kann matchen; ein leerer Bestand sendet
+// trotzdem (sonst leakte die Abwesenheit die Kardinalität „null").
+//
+// Die Maschine (6a.4): EIN Wähler (Record-Seite = lexikographisch
+// kleinerer neuer pair-Anker), EINE endgültige Wahl (eingefroren,
+// Abweichung = Äquivokation), EIN Auslöser (Record-Seite kettet atomar
+// mit ihrer Wahl; die Gegenseite NUR auf deren verifiziertes Mapping —
+// ihr eigenes ist ein Match-Report). Kette: neues Tupel wird Kopf, das
+// alte deaktiviert; Evidenz akkumuliert AUF DER BEZIEHUNG (✓ bleibt ✓),
+// für Dritte unsichtbar. Wer die Probe nicht beantworten kann, IST
+// protokollisch eine neue Beziehung (Identity 9.3).
+import { jcs } from '../core.js';
+import * as C from './deps.js';
+import { hmac } from './trust.js';
+const say = (p, m) => p.log.push(m);
+const CHUNK = 256;
+// ── Schlüssel (Spec-Infostrings, richtungsgebunden) ─────────────────────
+// k_p = HKDF(ECDH(newPairX_sender, newPairX_recipient),
+//            'rltp/visibility/blind/probe/' + senderNewPair + '/' + recipientNewPair)
+const kProbe = async (xPriv, theirKa, senderAnchor, recipientAnchor) => C.hkdf(await C.ecdh(xPriv, C.xRawOfMk(theirKa)), 'rltp/visibility/blind/probe/' + senderAnchor + '/' + recipientAnchor);
+const kMac = async (xPriv, theirKa, info) => C.hkdf(await C.ecdh(xPriv, C.xRawOfMk(theirKa)), info);
+// ── Schnappschuss-Helfer (Prior-Candidate-Set, Sicht des Halters) ───────
+// wird von introduce.mjs BEI TUPEL-ERZEUGUNG aufgerufen: aktive Heads,
+// das frische Tupel selbst ausgeschlossen; deaktivierte Glieder nie.
+export const snapshotPriors = (p) => ({
+    own: [...p.contacts.values()].filter((c) => !c.deactivated && c.channel?.own).map((c) => c.channel.own.anchor),
+    counterpart: [...p.contacts.entries()].filter(([, c]) => !c.deactivated).map(([k]) => k),
+});
+// ── continuity-probe@1: bauen ───────────────────────────────────────────
+export async function buildProbe(p, newKey, ent = {}) {
+    const t = p.contacts.get(newKey);
+    if (!t?.channel?.own)
+        return null;
+    t.probeSeqOut = (t.probeSeqOut ?? 0) + 1;
+    const kp = await kProbe(t.channel.own.x.priv, t.channel.counterpartKa, t.channel.own.anchor, newKey);
+    const entries = [];
+    for (const a of t.priorCands?.own ?? [])
+        entries.push(await hmac(kp, a));
+    // Polstern auf das nächste Vielfache von 256 (leerer Bestand → 1 Voll-Polster-Chunk)
+    const total = Math.max(CHUNK, Math.ceil(entries.length / CHUNK) * CHUNK);
+    while (entries.length < total)
+        entries.push(C.b64uOf(ent.pad ?? C.rand(32)));
+    entries.sort();
+    const outbound = [];
+    for (let i = 0; i * CHUNK < entries.length; i++) {
+        const body = { type: 'continuity-probe@1', probe: String(t.probeSeqOut), seq: String(i + 1), last: (i + 1) * CHUNK >= entries.length, blinded: entries.slice(i * CHUNK, (i + 1) * CHUNK) };
+        outbound.push({ to: t, kind: 'continuity-probe@1 (geblendet, gepolstert, versiegelt)', env: await C.seal({ ...body, mac: await hmac(kp, jcs(body)) }, t.channel.counterpartKa, ent) });
+    }
+    say(p, `Kontinuitäts-Probe an ${t.name}: ${t.priorCands?.own.length ?? 0} eigene Beziehungs-Anker, geblendet + gepolstert (${entries.length})`);
+    return outbound;
+}
+// ── continuity-mapping@1: bauen ─────────────────────────────────────────
+// prior = EIGENER alter pair-Anker · next = eigener neuer · to = neuer der
+// Gegenseite; mac1 unter dem ALTEN Beziehungs-Schlüssel, mac2 unter dem
+// NEUEN — nur derselbe Schlüssel-Inhaber kann beide (für die Adressatin
+// fälschbar: Klasse V, abstreitbar).
+async function buildMapping(p, newKey, oldKey, when, ent = {}) {
+    const t = p.contacts.get(newKey), old = p.contacts.get(oldKey);
+    const body = { type: 'continuity-mapping@1', prior: old.channel.own.anchor, next: t.channel.own.anchor, to: newKey, revision: '1', issuedAt: C.iso(when) };
+    const msg = jcs(body);
+    const doc = { ...body,
+        mac1: await hmac(await kMac(old.channel.own.x.priv, old.channel.counterpartKa, 'rltp/visibility/mac/cont1'), msg),
+        mac2: await hmac(await kMac(t.channel.own.x.priv, t.channel.counterpartKa, 'rltp/visibility/mac/cont2'), msg) };
+    return { to: t, kind: 'continuity-mapping@1 (mac1 alt · mac2 neu, versiegelt)', env: await C.seal(doc, t.channel.counterpartKa, ent) };
+}
+// ── die Kette: neues Tupel wird Kopf, das alte deaktiviert ──────────────
+// Tupel-Ebene bleibt (Stern-Salts, Probe-Sequenzen); KETTEN-Ebene wandert:
+// Kontakt-Gedächtnis, Evidenz (✓ akkumuliert), Offenlegungen, Gruppen.
+function chainTuple(p, newKey, oldKey) {
+    const head = p.contacts.get(newKey), old = p.contacts.get(oldKey);
+    if (!head || !old || old.deactivated)
+        return false; // idempotent
+    old.deactivated = true;
+    old.chainedInto = newKey;
+    head.chain = [...(old.chain ?? []), oldKey];
+    if (old.state === '✓' || head.state === '✓') {
+        head.state = '✓';
+        head.provenance = 'ceremony';
+    }
+    else if (old.state === '⇄' || head.state === '⇄')
+        head.state = '⇄';
+    head.since = [old.since, head.since].filter(Boolean).sort()[0];
+    head.name = old.name; // lokales Kontakt-Gedächtnis
+    head.selfAnchor ??= old.selfAnchor;
+    head.mapping ??= old.mapping;
+    head.trustGiven ??= old.trustGiven;
+    head.trustReceived ??= old.trustReceived;
+    head.trustPaused ??= old.trustPaused;
+    head.sentMapping ??= old.sentMapping;
+    head.starReceived ??= old.starReceived;
+    head.starInfo ??= old.starInfo;
+    head.sharedGroups = [...new Set([...(old.sharedGroups ?? []), ...(head.sharedGroups ?? [])])];
+    say(p, `Kontinuität: ${head.name} wiedererkannt — neues Tupel an die Beziehung gekettet (${head.state}, ${head.chain.length + 1} Enactments)`);
+    return true;
+}
+// ── Empfangs-Dispatch ───────────────────────────────────────────────────
+const iAmRecord = (t, newKey) => t.channel.own.anchor < newKey; // lexikographisch kleinerer NEUER Anker
+const tupleOf = (p, rkid) => {
+    const ctx = p.contexts.get(rkid);
+    if (!ctx)
+        return null;
+    const e = [...p.contacts.entries()].find(([, c]) => c.channel?.own?.anchor === ctx.anchor);
+    return e ? { key: e[0], t: e[1], ctx } : null;
+};
+export async function receiveContinuity(p, env, when, ent = {}) {
+    const opened = await C.openEnvelope(p, env); // Stufen 1–4, Cache-Lesung
+    if (opened.duplicate)
+        return { handled: true, duplicate: true };
+    if (opened.error)
+        return { handled: false };
+    const r = await receiveContinuityInner(p, env, opened.doc, when, ent);
+    if (r?.handled && !r.error)
+        C.effectDone(p, opened.digest);
+    return r;
+}
+async function receiveContinuityInner(p, env, doc, when, ent = {}) {
+    const hit = tupleOf(p, env.rkid);
+    if (!hit)
+        return { handled: false };
+    if (doc?.type === 'continuity-probe@1')
+        return handleProbe(p, hit, doc, when, ent);
+    if (doc?.type === 'continuity-mapping@1')
+        return handleMapping(p, hit, doc, when, ent);
+    return { handled: false, doc };
+}
+async function handleProbe(p, { key, t }, doc, when, ent) {
+    // form BEFORE fields (M-3): mac, sequence and chunk list as used below
+    if (!C.shaped(doc, { mac: 'string', probe: 'string', seq: 'string', blinded: 'array' }) || typeof doc.last !== 'boolean'
+        || !C.intStr(doc.probe) || !C.intStr(doc.seq) // NaN in probeSeqIn wäre Replay-Zustandskorruption (Review 9, P-B1)
+        || doc.blinded.length !== 256 // die Chunkform ist FEST: genau 256 Einträge (Review 10, P-B1-Rest)
+        || !doc.blinded.every((b) => typeof b === 'string'))
+        return { handled: true, error: 'malformed probe' };
+    // Senderseitiger k_p, aus Empfängersicht nachgerechnet (Richtung!)
+    const kp = await kProbe(t.channel.own.x.priv, t.channel.counterpartKa, key, t.channel.own.anchor);
+    const { mac, ...body } = doc;
+    if ((await hmac(kp, jcs(body))) !== mac)
+        return { handled: true, error: 'probe mac' };
+    if (BigInt(doc.probe) <= BigInt(t.probeSeqIn ?? '0'))
+        return { handled: true, error: 'probe replay (nicht streng größer)' };
+    // Chunk-Sammlung pro (Tupel, probe); höhere probe verwirft die offene
+    if (t.probeAsm?.probe !== doc.probe)
+        t.probeAsm = { probe: doc.probe, blinded: [], next: 1 };
+    if (Number(doc.seq) !== t.probeAsm.next)
+        return { handled: true, error: 'malformed probe (chunk order)' };
+    t.probeAsm.next += 1;
+    t.probeAsm.blinded.push(...doc.blinded);
+    if (!doc.last)
+        return { handled: true, partial: true };
+    // finaler Chunk: union lesen, dann vollzieht sich der EFFEKT (consume
+    // + Wahl + Kette) VOR dem fehlbaren Mapping-Bau — bewusst, denn die
+    // Frische-Regel verbietet Chunk-Replays als Retry-Weg; ein Bau-Fehler
+    // wird als getypte Pflicht persistiert und über flushContinuity()
+    // eingelöst (Reviews 5–8)
+    const union = t.probeAsm.blinded;
+    const consume = () => { t.probeAsm = null; t.probeSeqIn = doc.probe; }; // als STRING — BigInt-Vergleich, 18 Stellen exakt
+    // Schnitt gegen die GEGENSEITEN-Anker des eigenen Prior-Candidate-Sets
+    const matches = [];
+    for (const cp of t.priorCands?.counterpart ?? []) {
+        if (union.includes(await hmac(kp, cp)))
+            matches.push(cp);
+    }
+    if (!matches.length) {
+        consume();
+        say(p, `Probe von ${t.name}: kein Match — ehrlich eine neue Beziehung`);
+        return { handled: true, matches: 0 };
+    }
+    const outbound = [];
+    let chained = false;
+    let outboundError;
+    if (iAmRecord(t, key)) {
+        // Record-Seite: einmal wählen, endgültig; Kette atomar mit der Wahl
+        if (!t.contChosen) {
+            const choice = matches[0]; // Wahl frei — hier: erster Match (reichste Historie wäre App-Sache)
+            consume();
+            t.contChosen = choice;
+            chained = chainTuple(p, key, choice);
+            try {
+                outbound.push(await buildMapping(p, key, choice, when, ent));
+            }
+            catch (err) {
+                t.contMappingDue = { prior: choice, kind: 'choice' };
+                outboundError = String(err?.message ?? err);
+            }
+        }
+        else
+            consume();
+    }
+    else {
+        // Nicht-Record: Match-Report (löst NIE eine Kette aus)
+        if (!t.contReported) {
+            consume();
+            t.contReported = matches[0];
+            try {
+                outbound.push(await buildMapping(p, key, matches[0], when, ent));
+            }
+            catch (err) {
+                t.contMappingDue = { prior: matches[0], kind: 'report' };
+                outboundError = String(err?.message ?? err);
+            }
+        }
+        else
+            consume();
+    }
+    return { handled: true, matches: matches.length, chained, name: chained ? t.name : undefined, outbound, outboundError };
+}
+async function handleMapping(p, { key, t }, doc, when, ent) {
+    if (!C.shaped(doc, { mac1: 'string', mac2: 'string', prior: 'string', next: 'string', to: 'string' }))
+        return { handled: true, error: 'malformed mapping' };
+    const { mac1, mac2, ...body } = doc;
+    const fail = (why) => { say(p, `Kontinuitäts-Mapping verworfen: ${why}`); return { handled: true, error: why }; };
+    if (body.to !== t.channel.own.anchor)
+        return fail('to ≠ eigener neuer Anker');
+    if (body.next !== key)
+        return fail('next ≠ neuer Anker der Gegenseite');
+    // prior MUSS im Schnappschuss liegen (nie das frische Tupel, nie tiefere Kettenglieder)
+    if (!(t.priorCands?.counterpart ?? []).includes(body.prior))
+        return fail('prior nicht im Prior-Candidate-Set');
+    const old = p.contacts.get(body.prior);
+    if (!old?.channel?.own)
+        return fail('alte Beziehung ohne eigenen Kontext');
+    const msg = jcs(body);
+    if ((await hmac(await kMac(old.channel.own.x.priv, old.channel.counterpartKa, 'rltp/visibility/mac/cont1'), msg)) !== mac1)
+        return fail('mac1 (alter Beziehungs-Schlüssel)');
+    if ((await hmac(await kMac(t.channel.own.x.priv, t.channel.counterpartKa, 'rltp/visibility/mac/cont2'), msg)) !== mac2)
+        return fail('mac2 (neuer Beziehungs-Schlüssel)');
+    const senderIsRecord = key < t.channel.own.anchor;
+    const outbound = [];
+    if (senderIsRecord) {
+        // Record-Freeze: abweichendes prior derselben (next,to) = Äquivokation
+        if (t.contRecordPrior && t.contRecordPrior !== body.prior)
+            return fail('Äquivokation — Record-Wahl ist eingefroren');
+        // fehlbare Arbeit VOR der Mutation (B-2): erst das Alignment-Mapping
+        // bauen, dann Freeze + Kette in einem synchronen Zug
+        t.contRecordPrior = body.prior;
+        chainTuple(p, key, body.prior);
+        if (!t.contAligned) {
+            try {
+                const mapping = await buildMapping(p, key, body.prior, when, ent);
+                t.contAligned = true;
+                if (t.contMappingDue?.prior === body.prior)
+                    delete t.contMappingDue;
+                outbound.push(mapping);
+            }
+            catch (err) {
+                t.contMappingDue = { prior: body.prior, kind: 'align' };
+                return { handled: true, chained: p.contacts.get(body.prior)?.deactivated === true, name: t.name, outbound, outboundError: String(err?.message ?? err) };
+            }
+        }
+    }
+    else {
+        // Match-Report der Nicht-Record-Seite: darf die Wahl INFORMIEREN, kettet nie
+        if (iAmRecord(t, key) && !t.contChosen) {
+            const mapping = await buildMapping(p, key, body.prior, when, ent);
+            t.contChosen = body.prior;
+            chainTuple(p, key, body.prior);
+            outbound.push(mapping);
+        }
+    }
+    return { handled: true, chained: p.contacts.get(body.prior)?.deactivated === true, name: t.name, outbound };
+}
+/**
+ * The host's producing call for a mapping the receiver still owes
+ * (review 6, B-3): a transient seal failure during probe/mapping
+ * handling persists the obligation in contMappingDue; this call — not a
+ * redelivery, which the freshness rule forbids — builds and returns it.
+ */
+export async function flushContinuity(p, newKey, when, ent = {}) {
+    const t = p.contacts.get(newKey);
+    if (!t?.contMappingDue)
+        return { outbound: [] };
+    // Single-Flight (Review 7, B-3): zwei parallele Flushes liefern nie
+    // zwei Mappings für EINE Pflicht
+    if (t.contFlushPending)
+        return { outbound: [], pending: true };
+    t.contFlushPending = true;
+    try {
+        const due = t.contMappingDue;
+        const mapping = await buildMapping(p, newKey, due.prior, when, ent);
+        // der Flush stellt GENAU den Zustand her, den der gelungene
+        // Direktpfad hinterlassen hätte — kind-bewusst. Und er löscht NUR
+        // die Pflicht, die er selbst gebaut hat: ist während des await eine
+        // NEUERE an ihre Stelle getreten, bleibt sie stehen (Review 8, B-3)
+        if (due.kind === 'align')
+            t.contAligned = true;
+        if (t.contMappingDue === due)
+            delete t.contMappingDue;
+        return { outbound: [mapping] };
+    }
+    finally {
+        t.contFlushPending = false;
+    }
+}
+//# sourceMappingURL=continuity.js.map

package/dist/probe/continuity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"continuity.js","sourceRoot":"","sources":["../../src/probe/continuity.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,wEAAwE;AACxE,0EAA0E;AAC1E,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,wEAAwE;AACxE,yEAAyE;AACzE,iEAAiE;AACjE,qEAAqE;AACrE,mEAAmE;AACnE,EAAE;AACF,kEAAkE;AAClE,kEAAkE;AAClE,uEAAuE;AACvE,uEAAuE;AACvE,uEAAuE;AACvE,wEAAwE;AACxE,mEAAmE;AACnE,oDAAoD;AACpD,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAA;AAChC,OAAO,KAAK,CAAC,MAAM,WAAW,CAAA;AAE9B,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEjC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACnD,MAAM,KAAK,GAAG,GAAG,CAAA;AAEjB,2EAA2E;AAC3E,wDAAwD;AACxD,sFAAsF;AACtF,MAAM,MAAM,GAAG,KAAK,EAAE,KAAgB,EAAE,OAAe,EAAE,YAAoB,EAAE,eAAuB,EAAE,EAAE,CACxG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAE,CAAC,EAAE,8BAA8B,GAAG,YAAY,GAAG,GAAG,GAAG,eAAe,CAAC,CAAA;AAC1H,MAAM,IAAI,GAAG,KAAK,EAAE,KAAgB,EAAE,OAAe,EAAE,IAAY,EAAE,EAAE,CACrE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAE,CAAC,EAAE,IAAI,CAAC,CAAA;AAEzD,2EAA2E;AAC3E,uEAAuE;AACvE,qEAAqE;AACrE,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC;IAC5C,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;IAC9G,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;CACzF,CAAC,CAAA;AAEF,2EAA2E;AAC3E,MAAM,CAAC,KAAK,UAAU,UAAU,CAAE,CAAS,EAAE,MAAc,EAAE,MAAW,EAAE;IACxE,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IAChC,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG;QAAE,OAAO,IAAI,CAAA;IACjC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACpG,MAAM,OAAO,GAAG,EAAE,CAAA;IAClB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,GAAG,IAAI,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IACxE,qFAAqF;IACrF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAA;IACxE,OAAO,OAAO,CAAC,MAAM,GAAG,KAAK;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC5E,OAAO,CAAC,IAAI,EAAE,CAAA;IACd,MAAM,QAAQ,GAAG,EAAE,CAAA;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAA;QAC1L,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,wDAAwD,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,MAAM,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;IACxL,CAAC;IACD,GAAG,CAAC,CAAC,EAAE,yBAAyB,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,qDAAqD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IAC/I,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED,2EAA2E;AAC3E,2EAA2E;AAC3E,wEAAwE;AACxE,wEAAwE;AACxE,qCAAqC;AACrC,KAAK,UAAU,YAAY,CAAE,CAAS,EAAE,MAAc,EAAE,MAAc,EAAE,IAAY,EAAE,MAAW,EAAE;IACjG,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IAC9D,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,sBAAsB,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAA;IAC1J,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;IACrB,MAAM,GAAG,GAAG,EAAE,GAAG,IAAI;QACnB,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,2BAA2B,CAAC,EAAE,GAAG,CAAC;QACjH,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,2BAA2B,CAAC,EAAE,GAAG,CAAC,EAAE,CAAA;IACjH,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,wDAAwD,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,CAAA;AACxI,CAAC;AAED,2EAA2E;AAC3E,2EAA2E;AAC3E,uEAAuE;AACvE,SAAS,UAAU,CAAE,CAAS,EAAE,MAAc,EAAE,MAAc;IAC5D,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW;QAAE,OAAO,KAAK,CAAA,CAAC,aAAa;IAChE,GAAG,CAAC,WAAW,GAAG,IAAI,CAAA;IACtB,GAAG,CAAC,WAAW,GAAG,MAAM,CAAA;IACxB,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAA;IAC3C,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;QAAC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;IAAC,CAAC;SAC1F,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG;QAAE,IAAI,CAAC,KAAK,GAAG,GAAG,CAAA;IAClE,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAC9D,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAA,CAAC,6BAA6B;IAClD,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC;IAAC,IAAI,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO,CAAA;IAChE,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC;IAAC,IAAI,CAAC,aAAa,KAAK,GAAG,CAAC,aAAa,CAAA;IAC5E,IAAI,CAAC,WAAW,KAAK,GAAG,CAAC,WAAW,CAAC;IAAC,IAAI,CAAC,WAAW,KAAK,GAAG,CAAC,WAAW,CAAA;IAC1E,IAAI,CAAC,YAAY,KAAK,GAAG,CAAC,YAAY,CAAC;IAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC,QAAQ,CAAA;IACtE,IAAI,CAAC,YAAY,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7F,GAAG,CAAC,CAAC,EAAE,gBAAgB,IAAI,CAAC,IAAI,2DAA2D,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAA;IAC9I,OAAO,IAAI,CAAA;AACb,CAAC;AAED,2EAA2E;AAC3E,MAAM,SAAS,GAAG,CAAC,CAAM,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAA,CAAC,wCAAwC;AACpH,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,IAAY,EAAE,EAAE;IAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAChC,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAA;IACrB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAA;IAC1F,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;AAC/C,CAAC,CAAA;AAED,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAE,CAAS,EAAE,GAAQ,EAAE,IAAY,EAAE,MAAW,EAAE;IACvF,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA,CAAiB,2BAA2B;IACvF,IAAI,MAAM,CAAC,SAAS;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAA;IAC/D,IAAI,MAAM,CAAC,KAAK;QAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAA;IAC3C,MAAM,CAAC,GAAG,MAAM,sBAAsB,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;IACrE,IAAI,CAAC,EAAE,OAAO,IAAI,CAAE,CAAS,CAAC,KAAK;QAAE,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;IACnE,OAAO,CAAC,CAAA;AACV,CAAC;AACD,KAAK,UAAU,sBAAsB,CAAE,CAAS,EAAE,GAAQ,EAAE,GAAQ,EAAE,IAAY,EAAE,MAAW,EAAE;IAC/F,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;IAChC,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAA;IACnC,IAAI,GAAG,EAAE,IAAI,KAAK,oBAAoB;QAAE,OAAO,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;IAClF,IAAI,GAAG,EAAE,IAAI,KAAK,sBAAsB;QAAE,OAAO,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;IACtF,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAA;AAChC,CAAC;AAED,KAAK,UAAU,WAAW,CAAE,CAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAO,EAAE,GAAQ,EAAE,IAAY,EAAE,GAAQ;IACtF,uEAAuE;IACvE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,SAAS;WACnH,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAG,oEAAoE;WACjH,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,GAAG,CAAmB,oEAAoE;WACjH,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAA;IAC9G,mEAAmE;IACnE,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IACjG,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG,CAAA;IAC5B,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,EAAE,CAAA;IACrF,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,UAAU,IAAI,GAAG,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,oCAAoC,EAAE,CAAA;IAC3H,sEAAsE;IACtE,IAAI,CAAC,CAAC,QAAQ,EAAE,KAAK,KAAK,GAAG,CAAC,KAAK;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAA;IAC5F,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,+BAA+B,EAAE,CAAA;IACzG,CAAC,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAA;IACpB,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAA;IACvC,IAAI,CAAC,GAAG,CAAC,IAAI;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA;IACtD,sEAAsE;IACtE,oEAAoE;IACpE,sEAAsE;IACtE,kEAAkE;IAClE,0BAA0B;IAC1B,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAA;IAChC,MAAM,OAAO,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,KAAK,CAAA,CAAC,CAAC,CAAA,CAAE,kDAAkD;IACzH,uEAAuE;IACvE,MAAM,OAAO,GAAG,EAAE,CAAA;IAClB,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,UAAU,EAAE,WAAW,IAAI,EAAE,EAAE,CAAC;QACjD,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC1D,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QAAC,OAAO,EAAE,CAAC;QAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,IAAI,4CAA4C,CAAC,CAAC;QAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,CAAA;IAAC,CAAC;IACjJ,MAAM,QAAQ,GAAG,EAAE,CAAA;IACnB,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,aAAa,CAAA;IACjB,IAAI,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACtB,oEAAoE;QACpE,IAAI,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA,CAAC,oEAAoE;YAC9F,OAAO,EAAE,CAAA;YACT,CAAC,CAAC,UAAU,GAAG,MAAM,CAAA;YACrB,OAAO,GAAG,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;YACpC,IAAI,CAAC;gBAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAA;YAAC,CAAC;YACpE,OAAO,GAAQ,EAAE,CAAC;gBAAC,CAAC,CAAC,cAAc,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;gBAAC,aAAa,GAAG,MAAM,CAAC,GAAG,EAAE,OAAO,IAAI,GAAG,CAAC,CAAA;YAAC,CAAC;QACxH,CAAC;;YAAM,OAAO,EAAE,CAAA;IAClB,CAAC;SAAM,CAAC;QACN,uDAAuD;QACvD,IAAI,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC;YACpB,OAAO,EAAE,CAAA;YACT,CAAC,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YAC3B,IAAI,CAAC;gBAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAA;YAAC,CAAC;YACxE,OAAO,GAAQ,EAAE,CAAC;gBAAC,CAAC,CAAC,cAAc,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;gBAAC,aAAa,GAAG,MAAM,CAAC,GAAG,EAAE,OAAO,IAAI,GAAG,CAAC,CAAA;YAAC,CAAC;QAC5H,CAAC;;YAAM,OAAO,EAAE,CAAA;IAClB,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAA;AACzH,CAAC;AAED,KAAK,UAAU,aAAa,CAAE,CAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAO,EAAE,GAAQ,EAAE,IAAY,EAAE,GAAQ;IACxF,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAA;IAC3J,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG,CAAA;IACnC,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,mCAAmC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAA,CAAC,CAAC,CAAA;IACxH,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC,0BAA0B,CAAC,CAAA;IAC7E,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC,mCAAmC,CAAC,CAAA;IACvE,wFAAwF;IACxF,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,WAAW,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,oCAAoC,CAAC,CAAA;IAC9G,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACtC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG;QAAE,OAAO,IAAI,CAAC,qCAAqC,CAAC,CAAA;IAC1E,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;IACrB,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,2BAA2B,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,mCAAmC,CAAC,CAAA;IAC5K,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,2BAA2B,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,mCAAmC,CAAC,CAAA;IACxK,MAAM,cAAc,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAA;IACjD,MAAM,QAAQ,GAAG,EAAE,CAAA;IACnB,IAAI,cAAc,EAAE,CAAC;QACnB,uEAAuE;QACvE,IAAI,CAAC,CAAC,eAAe,IAAI,CAAC,CAAC,eAAe,KAAK,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,4CAA4C,CAAC,CAAA;QACpH,qEAAqE;QACrE,qDAAqD;QACrD,CAAC,CAAC,eAAe,GAAG,IAAI,CAAC,KAAK,CAAA;QAC9B,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAC9B,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC;gBAAC,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC;gBAAC,IAAI,CAAC,CAAC,cAAc,EAAE,KAAK,KAAK,IAAI,CAAC,KAAK;oBAAE,OAAO,CAAC,CAAC,cAAc,CAAC;gBAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YAAC,CAAC;YAC5L,OAAO,GAAQ,EAAE,CAAC;gBAAC,CAAC,CAAC,cAAc,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gBAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,WAAW,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,CAAC,GAAG,EAAE,OAAO,IAAI,GAAG,CAAC,EAAE,CAAA;YAAC,CAAC;QACvO,CAAC;IACH,CAAC;SAAM,CAAC;QACN,6EAA6E;QAC7E,IAAI,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;YACjE,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAA;YACzB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;YAC9B,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,WAAW,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAA;AAC7G,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAE,CAAS,EAAE,MAAc,EAAE,IAAY,EAAE,MAAW,EAAE;IAC3F,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IAChC,IAAI,CAAC,CAAC,EAAE,cAAc;QAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC/C,oEAAoE;IACpE,iCAAiC;IACjC,IAAI,CAAC,CAAC,gBAAgB;QAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA;IAC9D,CAAC,CAAC,gBAAgB,GAAG,IAAI,CAAA;IACzB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,CAAC,CAAC,cAAc,CAAA;QAC5B,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;QACnE,4DAA4D;QAC5D,kEAAkE;QAClE,oEAAoE;QACpE,oEAAoE;QACpE,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO;YAAE,CAAC,CAAC,WAAW,GAAG,IAAI,CAAA;QAC9C,IAAI,CAAC,CAAC,cAAc,KAAK,GAAG;YAAE,OAAO,CAAC,CAAC,cAAc,CAAA;QACrD,OAAO,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAA;IAChC,CAAC;YAAS,CAAC;QAAC,CAAC,CAAC,gBAAgB,GAAG,KAAK,CAAA;IAAC,CAAC;AAC1C,CAAC","sourcesContent":["// continuity.mjs — rltp-visibility §6a im Simulator: continuity-probe@1 +\n// continuity-mapping@1. „Kontinuität wird NACH der Zeremonie aufgelöst,\n// nie in ihr\" (Encounter 4.4): jedes Enactment UND jede Vorstellung prägt\n// ein frisches Tupel; ob es ein Wiedersehen war, klärt die Probe über den\n// frischen Kanal — automatisch, ohne Dialog, ohne Namen.\n//\n// Die Probe ist das dritte Mitglied EINER Familie (Stern, Mapping, Probe:\n// geblendete Werte unter Beziehungs-Schlüsseln): die EIGENEN bisherigen\n// pair-Anker reisen als HMAC unter k_p (DH des NEUEN Kanals), gepolstert\n// auf Vielfache von 256, sortiert, sequenziert. Nur wer eine der\n// Beziehungen wirklich hält, kann matchen; ein leerer Bestand sendet\n// trotzdem (sonst leakte die Abwesenheit die Kardinalität „null\").\n//\n// Die Maschine (6a.4): EIN Wähler (Record-Seite = lexikographisch\n// kleinerer neuer pair-Anker), EINE endgültige Wahl (eingefroren,\n// Abweichung = Äquivokation), EIN Auslöser (Record-Seite kettet atomar\n// mit ihrer Wahl; die Gegenseite NUR auf deren verifiziertes Mapping —\n// ihr eigenes ist ein Match-Report). Kette: neues Tupel wird Kopf, das\n// alte deaktiviert; Evidenz akkumuliert AUF DER BEZIEHUNG (✓ bleibt ✓),\n// für Dritte unsichtbar. Wer die Probe nicht beantworten kann, IST\n// protokollisch eine neue Beziehung (Identity 9.3).\nimport { jcs } from '../core.js'\nimport * as C from './deps.js'\nimport type { Person } from './deps.js'\nimport { hmac } from './trust.js'\n\nconst say = (p: Person, m: string) => p.log.push(m)\nconst CHUNK = 256\n\n// ── Schlüssel (Spec-Infostrings, richtungsgebunden) ─────────────────────\n// k_p = HKDF(ECDH(newPairX_sender, newPairX_recipient),\n//            'rltp/visibility/blind/probe/' + senderNewPair + '/' + recipientNewPair)\nconst kProbe = async (xPriv: CryptoKey, theirKa: string, senderAnchor: string, recipientAnchor: string) =>\n  C.hkdf(await C.ecdh(xPriv, C.xRawOfMk(theirKa)!), 'rltp/visibility/blind/probe/' + senderAnchor + '/' + recipientAnchor)\nconst kMac = async (xPriv: CryptoKey, theirKa: string, info: string) =>\n  C.hkdf(await C.ecdh(xPriv, C.xRawOfMk(theirKa)!), info)\n\n// ── Schnappschuss-Helfer (Prior-Candidate-Set, Sicht des Halters) ───────\n// wird von introduce.mjs BEI TUPEL-ERZEUGUNG aufgerufen: aktive Heads,\n// das frische Tupel selbst ausgeschlossen; deaktivierte Glieder nie.\nexport const snapshotPriors = (p: Person) => ({\n  own: [...p.contacts.values()].filter((c) => !c.deactivated && c.channel?.own).map((c) => c.channel.own.anchor),\n  counterpart: [...p.contacts.entries()].filter(([, c]) => !c.deactivated).map(([k]) => k),\n})\n\n// ── continuity-probe@1: bauen ───────────────────────────────────────────\nexport async function buildProbe (p: Person, newKey: string, ent: any = {}) {\n  const t = p.contacts.get(newKey)\n  if (!t?.channel?.own) return null\n  t.probeSeqOut = (t.probeSeqOut ?? 0) + 1\n  const kp = await kProbe(t.channel.own.x.priv, t.channel.counterpartKa, t.channel.own.anchor, newKey)\n  const entries = []\n  for (const a of t.priorCands?.own ?? []) entries.push(await hmac(kp, a))\n  // Polstern auf das nächste Vielfache von 256 (leerer Bestand → 1 Voll-Polster-Chunk)\n  const total = Math.max(CHUNK, Math.ceil(entries.length / CHUNK) * CHUNK)\n  while (entries.length < total) entries.push(C.b64uOf(ent.pad ?? C.rand(32)))\n  entries.sort()\n  const outbound = []\n  for (let i = 0; i * CHUNK < entries.length; i++) {\n    const body = { type: 'continuity-probe@1', probe: String(t.probeSeqOut), seq: String(i + 1), last: (i + 1) * CHUNK >= entries.length, blinded: entries.slice(i * CHUNK, (i + 1) * CHUNK) }\n    outbound.push({ to: t, kind: 'continuity-probe@1 (geblendet, gepolstert, versiegelt)', env: await C.seal({ ...body, mac: await hmac(kp, jcs(body)) }, t.channel.counterpartKa, ent) })\n  }\n  say(p, `Kontinuitäts-Probe an ${t.name}: ${t.priorCands?.own.length ?? 0} eigene Beziehungs-Anker, geblendet + gepolstert (${entries.length})`)\n  return outbound\n}\n\n// ── continuity-mapping@1: bauen ─────────────────────────────────────────\n// prior = EIGENER alter pair-Anker · next = eigener neuer · to = neuer der\n// Gegenseite; mac1 unter dem ALTEN Beziehungs-Schlüssel, mac2 unter dem\n// NEUEN — nur derselbe Schlüssel-Inhaber kann beide (für die Adressatin\n// fälschbar: Klasse V, abstreitbar).\nasync function buildMapping (p: Person, newKey: string, oldKey: string, when: number, ent: any = {}) {\n  const t = p.contacts.get(newKey), old = p.contacts.get(oldKey)\n  const body = { type: 'continuity-mapping@1', prior: old.channel.own.anchor, next: t.channel.own.anchor, to: newKey, revision: '1', issuedAt: C.iso(when) }\n  const msg = jcs(body)\n  const doc = { ...body,\n    mac1: await hmac(await kMac(old.channel.own.x.priv, old.channel.counterpartKa, 'rltp/visibility/mac/cont1'), msg),\n    mac2: await hmac(await kMac(t.channel.own.x.priv, t.channel.counterpartKa, 'rltp/visibility/mac/cont2'), msg) }\n  return { to: t, kind: 'continuity-mapping@1 (mac1 alt · mac2 neu, versiegelt)', env: await C.seal(doc, t.channel.counterpartKa, ent) }\n}\n\n// ── die Kette: neues Tupel wird Kopf, das alte deaktiviert ──────────────\n// Tupel-Ebene bleibt (Stern-Salts, Probe-Sequenzen); KETTEN-Ebene wandert:\n// Kontakt-Gedächtnis, Evidenz (✓ akkumuliert), Offenlegungen, Gruppen.\nfunction chainTuple (p: Person, newKey: string, oldKey: string) {\n  const head = p.contacts.get(newKey), old = p.contacts.get(oldKey)\n  if (!head || !old || old.deactivated) return false // idempotent\n  old.deactivated = true\n  old.chainedInto = newKey\n  head.chain = [...(old.chain ?? []), oldKey]\n  if (old.state === '✓' || head.state === '✓') { head.state = '✓'; head.provenance = 'ceremony' }\n  else if (old.state === '⇄' || head.state === '⇄') head.state = '⇄'\n  head.since = [old.since, head.since].filter(Boolean).sort()[0]\n  head.name = old.name // lokales Kontakt-Gedächtnis\n  head.selfAnchor ??= old.selfAnchor; head.mapping ??= old.mapping\n  head.trustGiven ??= old.trustGiven; head.trustReceived ??= old.trustReceived\n  head.trustPaused ??= old.trustPaused; head.sentMapping ??= old.sentMapping\n  head.starReceived ??= old.starReceived; head.starInfo ??= old.starInfo\n  head.sharedGroups = [...new Set([...(old.sharedGroups ?? []), ...(head.sharedGroups ?? [])])]\n  say(p, `Kontinuität: ${head.name} wiedererkannt — neues Tupel an die Beziehung gekettet (${head.state}, ${head.chain.length + 1} Enactments)`)\n  return true\n}\n\n// ── Empfangs-Dispatch ───────────────────────────────────────────────────\nconst iAmRecord = (t: any, newKey: string) => t.channel.own.anchor < newKey // lexikographisch kleinerer NEUER Anker\nconst tupleOf = (p: Person, rkid: string) => {\n  const ctx = p.contexts.get(rkid)\n  if (!ctx) return null\n  const e = [...p.contacts.entries()].find(([, c]) => c.channel?.own?.anchor === ctx.anchor)\n  return e ? { key: e[0], t: e[1], ctx } : null\n}\n\nexport async function receiveContinuity (p: Person, env: any, when: number, ent: any = {}) {\n  const opened = await C.openEnvelope(p, env)                 // Stufen 1–4, Cache-Lesung\n  if (opened.duplicate) return { handled: true, duplicate: true }\n  if (opened.error) return { handled: false }\n  const r = await receiveContinuityInner(p, env, opened.doc, when, ent)\n  if (r?.handled && !(r as any).error) C.effectDone(p, opened.digest)\n  return r\n}\nasync function receiveContinuityInner (p: Person, env: any, doc: any, when: number, ent: any = {}) {\n  const hit = tupleOf(p, env.rkid)\n  if (!hit) return { handled: false }\n  if (doc?.type === 'continuity-probe@1') return handleProbe(p, hit, doc, when, ent)\n  if (doc?.type === 'continuity-mapping@1') return handleMapping(p, hit, doc, when, ent)\n  return { handled: false, doc }\n}\n\nasync function handleProbe (p: Person, { key, t }: any, doc: any, when: number, ent: any) {\n  // form BEFORE fields (M-3): mac, sequence and chunk list as used below\n  if (!C.shaped(doc, { mac: 'string', probe: 'string', seq: 'string', blinded: 'array' }) || typeof doc.last !== 'boolean'\n    || !C.intStr(doc.probe) || !C.intStr(doc.seq)   // NaN in probeSeqIn wäre Replay-Zustandskorruption (Review 9, P-B1)\n    || doc.blinded.length !== 256                   // die Chunkform ist FEST: genau 256 Einträge (Review 10, P-B1-Rest)\n    || !doc.blinded.every((b: any) => typeof b === 'string')) return { handled: true, error: 'malformed probe' }\n  // Senderseitiger k_p, aus Empfängersicht nachgerechnet (Richtung!)\n  const kp = await kProbe(t.channel.own.x.priv, t.channel.counterpartKa, key, t.channel.own.anchor)\n  const { mac, ...body } = doc\n  if ((await hmac(kp, jcs(body))) !== mac) return { handled: true, error: 'probe mac' }\n  if (BigInt(doc.probe) <= BigInt(t.probeSeqIn ?? '0')) return { handled: true, error: 'probe replay (nicht streng größer)' }\n  // Chunk-Sammlung pro (Tupel, probe); höhere probe verwirft die offene\n  if (t.probeAsm?.probe !== doc.probe) t.probeAsm = { probe: doc.probe, blinded: [], next: 1 }\n  if (Number(doc.seq) !== t.probeAsm.next) return { handled: true, error: 'malformed probe (chunk order)' }\n  t.probeAsm.next += 1\n  t.probeAsm.blinded.push(...doc.blinded)\n  if (!doc.last) return { handled: true, partial: true }\n  // finaler Chunk: union lesen, dann vollzieht sich der EFFEKT (consume\n  // + Wahl + Kette) VOR dem fehlbaren Mapping-Bau — bewusst, denn die\n  // Frische-Regel verbietet Chunk-Replays als Retry-Weg; ein Bau-Fehler\n  // wird als getypte Pflicht persistiert und über flushContinuity()\n  // eingelöst (Reviews 5–8)\n  const union = t.probeAsm.blinded\n  const consume = () => { t.probeAsm = null; t.probeSeqIn = doc.probe }  // als STRING — BigInt-Vergleich, 18 Stellen exakt\n  // Schnitt gegen die GEGENSEITEN-Anker des eigenen Prior-Candidate-Sets\n  const matches = []\n  for (const cp of t.priorCands?.counterpart ?? []) {\n    if (union.includes(await hmac(kp, cp))) matches.push(cp)\n  }\n  if (!matches.length) { consume(); say(p, `Probe von ${t.name}: kein Match — ehrlich eine neue Beziehung`); return { handled: true, matches: 0 } }\n  const outbound = []\n  let chained = false\n  let outboundError\n  if (iAmRecord(t, key)) {\n    // Record-Seite: einmal wählen, endgültig; Kette atomar mit der Wahl\n    if (!t.contChosen) {\n      const choice = matches[0] // Wahl frei — hier: erster Match (reichste Historie wäre App-Sache)\n      consume()\n      t.contChosen = choice\n      chained = chainTuple(p, key, choice)\n      try { outbound.push(await buildMapping(p, key, choice, when, ent)) }\n      catch (err: any) { t.contMappingDue = { prior: choice, kind: 'choice' }; outboundError = String(err?.message ?? err) }\n    } else consume()\n  } else {\n    // Nicht-Record: Match-Report (löst NIE eine Kette aus)\n    if (!t.contReported) {\n      consume()\n      t.contReported = matches[0]\n      try { outbound.push(await buildMapping(p, key, matches[0], when, ent)) }\n      catch (err: any) { t.contMappingDue = { prior: matches[0], kind: 'report' }; outboundError = String(err?.message ?? err) }\n    } else consume()\n  }\n  return { handled: true, matches: matches.length, chained, name: chained ? t.name : undefined, outbound, outboundError }\n}\n\nasync function handleMapping (p: Person, { key, t }: any, doc: any, when: number, ent: any) {\n  if (!C.shaped(doc, { mac1: 'string', mac2: 'string', prior: 'string', next: 'string', to: 'string' })) return { handled: true, error: 'malformed mapping' }\n  const { mac1, mac2, ...body } = doc\n  const fail = (why: string) => { say(p, `Kontinuitäts-Mapping verworfen: ${why}`); return { handled: true, error: why } }\n  if (body.to !== t.channel.own.anchor) return fail('to ≠ eigener neuer Anker')\n  if (body.next !== key) return fail('next ≠ neuer Anker der Gegenseite')\n  // prior MUSS im Schnappschuss liegen (nie das frische Tupel, nie tiefere Kettenglieder)\n  if (!(t.priorCands?.counterpart ?? []).includes(body.prior)) return fail('prior nicht im Prior-Candidate-Set')\n  const old = p.contacts.get(body.prior)\n  if (!old?.channel?.own) return fail('alte Beziehung ohne eigenen Kontext')\n  const msg = jcs(body)\n  if ((await hmac(await kMac(old.channel.own.x.priv, old.channel.counterpartKa, 'rltp/visibility/mac/cont1'), msg)) !== mac1) return fail('mac1 (alter Beziehungs-Schlüssel)')\n  if ((await hmac(await kMac(t.channel.own.x.priv, t.channel.counterpartKa, 'rltp/visibility/mac/cont2'), msg)) !== mac2) return fail('mac2 (neuer Beziehungs-Schlüssel)')\n  const senderIsRecord = key < t.channel.own.anchor\n  const outbound = []\n  if (senderIsRecord) {\n    // Record-Freeze: abweichendes prior derselben (next,to) = Äquivokation\n    if (t.contRecordPrior && t.contRecordPrior !== body.prior) return fail('Äquivokation — Record-Wahl ist eingefroren')\n    // fehlbare Arbeit VOR der Mutation (B-2): erst das Alignment-Mapping\n    // bauen, dann Freeze + Kette in einem synchronen Zug\n    t.contRecordPrior = body.prior\n    chainTuple(p, key, body.prior)\n    if (!t.contAligned) {\n      try { const mapping = await buildMapping(p, key, body.prior, when, ent); t.contAligned = true; if (t.contMappingDue?.prior === body.prior) delete t.contMappingDue; outbound.push(mapping) }\n      catch (err: any) { t.contMappingDue = { prior: body.prior, kind: 'align' }; return { handled: true, chained: p.contacts.get(body.prior)?.deactivated === true, name: t.name, outbound, outboundError: String(err?.message ?? err) } }\n    }\n  } else {\n    // Match-Report der Nicht-Record-Seite: darf die Wahl INFORMIEREN, kettet nie\n    if (iAmRecord(t, key) && !t.contChosen) {\n      const mapping = await buildMapping(p, key, body.prior, when, ent)\n      t.contChosen = body.prior\n      chainTuple(p, key, body.prior)\n      outbound.push(mapping)\n    }\n  }\n  return { handled: true, chained: p.contacts.get(body.prior)?.deactivated === true, name: t.name, outbound }\n}\n\n/**\n * The host's producing call for a mapping the receiver still owes\n * (review 6, B-3): a transient seal failure during probe/mapping\n * handling persists the obligation in contMappingDue; this call — not a\n * redelivery, which the freshness rule forbids — builds and returns it.\n */\nexport async function flushContinuity (p: Person, newKey: string, when: number, ent: any = {}) {\n  const t = p.contacts.get(newKey)\n  if (!t?.contMappingDue) return { outbound: [] }\n  // Single-Flight (Review 7, B-3): zwei parallele Flushes liefern nie\n  // zwei Mappings für EINE Pflicht\n  if (t.contFlushPending) return { outbound: [], pending: true }\n  t.contFlushPending = true\n  try {\n    const due = t.contMappingDue\n    const mapping = await buildMapping(p, newKey, due.prior, when, ent)\n    // der Flush stellt GENAU den Zustand her, den der gelungene\n    // Direktpfad hinterlassen hätte — kind-bewusst. Und er löscht NUR\n    // die Pflicht, die er selbst gebaut hat: ist während des await eine\n    // NEUERE an ihre Stelle getreten, bleibt sie stehen (Review 8, B-3)\n    if (due.kind === 'align') t.contAligned = true\n    if (t.contMappingDue === due) delete t.contMappingDue\n    return { outbound: [mapping] }\n  } finally { t.contFlushPending = false }\n}\n"]}