@stevenvo780/st-lang 4.8.0 → 4.9.0

package/dist/reasoning/ban-logic/terms.js

@@ -0,0 +1,262 @@
+"use strict";
+// ============================================================
+// BAN Logic — Constructores y equality de términos/fórmulas
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.formulaAnd = exports.controls = exports.sharedSecret = exports.publicKey = exports.sharedKey = exports.fresh = exports.jurisdiction = exports.saidMessage = exports.said = exports.sees = exports.believes = exports.compound = exports.hashed = exports.encrypted = exports.message = exports.atom = exports.nonce = exports.key = exports.principal = void 0;
+exports.termEquals = termEquals;
+exports.formulaEquals = formulaEquals;
+exports.hasFormula = hasFormula;
+exports.termToString = termToString;
+exports.formulaToString = formulaToString;
+/* ── Constructores de términos ── */
+const principal = (name) => ({ kind: 'principal', name });
+exports.principal = principal;
+const key = (name, shared) => shared ? { kind: 'key', name, shared } : { kind: 'key', name };
+exports.key = key;
+const nonce = (name) => ({ kind: 'nonce', name });
+exports.nonce = nonce;
+const atom = (name) => ({ kind: 'atom', name });
+exports.atom = atom;
+const message = (...content) => ({ kind: 'message', content });
+exports.message = message;
+const encrypted = (msg, k) => ({
+    kind: 'encrypted',
+    message: msg,
+    key: k,
+});
+exports.encrypted = encrypted;
+const hashed = (msg) => ({ kind: 'hashed', message: msg });
+exports.hashed = hashed;
+const compound = (...parts) => ({ kind: 'compound', parts });
+exports.compound = compound;
+/* ── Constructores de fórmulas ── */
+const believes = (p, f) => ({
+    kind: 'believes',
+    principal: p,
+    about: f,
+});
+exports.believes = believes;
+const sees = (p, w) => ({
+    kind: 'sees',
+    principal: p,
+    what: w,
+});
+exports.sees = sees;
+const said = (p, f) => ({
+    kind: 'said',
+    principal: p,
+    what: f,
+});
+exports.said = said;
+const saidMessage = (p, w) => ({
+    kind: 'said-message',
+    principal: p,
+    what: w,
+});
+exports.saidMessage = saidMessage;
+const jurisdiction = (p, f) => ({
+    kind: 'jurisdiction',
+    principal: p,
+    over: f,
+});
+exports.jurisdiction = jurisdiction;
+const fresh = (w) => ({ kind: 'fresh', what: w });
+exports.fresh = fresh;
+const sharedKey = (a, b, k) => ({
+    kind: 'sharedKey',
+    a,
+    b,
+    key: k,
+});
+exports.sharedKey = sharedKey;
+const publicKey = (p, k) => ({
+    kind: 'publicKey',
+    principal: p,
+    key: k,
+});
+exports.publicKey = publicKey;
+const sharedSecret = (a, b, s) => ({
+    kind: 'sharedSecret',
+    a,
+    b,
+    secret: s,
+});
+exports.sharedSecret = sharedSecret;
+const controls = (p, f) => ({
+    kind: 'controls',
+    principal: p,
+    statement: f,
+});
+exports.controls = controls;
+const formulaAnd = (left, right) => ({
+    kind: 'formula-and',
+    left,
+    right,
+});
+exports.formulaAnd = formulaAnd;
+/* ── Igualdad estructural ── */
+function termEquals(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'principal':
+        case 'nonce':
+        case 'atom':
+            // narrow b to a kind with .name
+            return b.name === a.name;
+        case 'key': {
+            const bk = b;
+            if (bk.name !== a.name)
+                return false;
+            const as = a.shared;
+            const bs = bk.shared;
+            if (!as && !bs)
+                return true;
+            if (!as || !bs)
+                return false;
+            // Shared pair es bi-direccional: {A,B} == {B,A}.
+            return (as[0] === bs[0] && as[1] === bs[1]) || (as[0] === bs[1] && as[1] === bs[0]);
+        }
+        case 'message': {
+            const bm = b;
+            if (a.content.length !== bm.content.length)
+                return false;
+            for (let i = 0; i < a.content.length; i++) {
+                const ai = a.content[i];
+                const bi = bm.content[i];
+                if (!ai || !bi)
+                    return false;
+                if (!termEquals(ai, bi))
+                    return false;
+            }
+            return true;
+        }
+        case 'compound': {
+            const bc = b;
+            if (a.parts.length !== bc.parts.length)
+                return false;
+            for (let i = 0; i < a.parts.length; i++) {
+                const ai = a.parts[i];
+                const bi = bc.parts[i];
+                if (!ai || !bi)
+                    return false;
+                if (!termEquals(ai, bi))
+                    return false;
+            }
+            return true;
+        }
+        case 'encrypted': {
+            const be = b;
+            return termEquals(a.message, be.message) && termEquals(a.key, be.key);
+        }
+        case 'hashed': {
+            const bh = b;
+            return termEquals(a.message, bh.message);
+        }
+    }
+}
+function formulaEquals(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'believes': {
+            const bb = b;
+            return termEquals(a.principal, bb.principal) && formulaEquals(a.about, bb.about);
+        }
+        case 'sees': {
+            const bs = b;
+            return termEquals(a.principal, bs.principal) && termEquals(a.what, bs.what);
+        }
+        case 'said': {
+            const bs = b;
+            return termEquals(a.principal, bs.principal) && formulaEquals(a.what, bs.what);
+        }
+        case 'said-message': {
+            const bs = b;
+            return termEquals(a.principal, bs.principal) && termEquals(a.what, bs.what);
+        }
+        case 'jurisdiction': {
+            const bj = b;
+            return termEquals(a.principal, bj.principal) && formulaEquals(a.over, bj.over);
+        }
+        case 'fresh': {
+            const bf = b;
+            return termEquals(a.what, bf.what);
+        }
+        case 'sharedKey': {
+            const bs = b;
+            // El predicado "A ↔K B" es simétrico en (A,B).
+            const ab = termEquals(a.a, bs.a) && termEquals(a.b, bs.b);
+            const ba = termEquals(a.a, bs.b) && termEquals(a.b, bs.a);
+            return (ab || ba) && termEquals(a.key, bs.key);
+        }
+        case 'publicKey': {
+            const bp = b;
+            return termEquals(a.principal, bp.principal) && termEquals(a.key, bp.key);
+        }
+        case 'sharedSecret': {
+            const bs = b;
+            const ab = termEquals(a.a, bs.a) && termEquals(a.b, bs.b);
+            const ba = termEquals(a.a, bs.b) && termEquals(a.b, bs.a);
+            return (ab || ba) && termEquals(a.secret, bs.secret);
+        }
+        case 'controls': {
+            const bc = b;
+            return termEquals(a.principal, bc.principal) && formulaEquals(a.statement, bc.statement);
+        }
+        case 'formula-and': {
+            const ba = b;
+            return formulaEquals(a.left, ba.left) && formulaEquals(a.right, ba.right);
+        }
+    }
+}
+function hasFormula(state, target) {
+    return state.some((f) => formulaEquals(f, target));
+}
+/* ── Pretty printing ── */
+function termToString(t) {
+    switch (t.kind) {
+        case 'principal':
+        case 'nonce':
+        case 'atom':
+            return t.name;
+        case 'key':
+            return t.shared ? `K_${t.shared[0]}${t.shared[1]}` : t.name;
+        case 'message':
+            return `<${t.content.map(termToString).join(', ')}>`;
+        case 'compound':
+            return `(${t.parts.map(termToString).join(' · ')})`;
+        case 'encrypted':
+            return `{${termToString(t.message)}}_${termToString(t.key)}`;
+        case 'hashed':
+            return `H(${termToString(t.message)})`;
+    }
+}
+function formulaToString(f) {
+    switch (f.kind) {
+        case 'believes':
+            return `${termToString(f.principal)} |≡ ${formulaToString(f.about)}`;
+        case 'sees':
+            return `${termToString(f.principal)} ◁ ${termToString(f.what)}`;
+        case 'said':
+            return `${termToString(f.principal)} |~ ${formulaToString(f.what)}`;
+        case 'said-message':
+            return `${termToString(f.principal)} |~ ${termToString(f.what)}`;
+        case 'jurisdiction':
+            return `${termToString(f.principal)} |⇒ ${formulaToString(f.over)}`;
+        case 'fresh':
+            return `#(${termToString(f.what)})`;
+        case 'sharedKey':
+            return `${termToString(f.a)} ↔${termToString(f.key)} ${termToString(f.b)}`;
+        case 'publicKey':
+            return `|→${termToString(f.key)} ${termToString(f.principal)}`;
+        case 'sharedSecret':
+            return `${termToString(f.a)} ⇌${termToString(f.secret)} ${termToString(f.b)}`;
+        case 'controls':
+            return `${termToString(f.principal)} |⇒ ${formulaToString(f.statement)}`;
+        case 'formula-and':
+            return `(${formulaToString(f.left)}) ∧ (${formulaToString(f.right)})`;
+    }
+}
+//# sourceMappingURL=terms.js.map

package/dist/reasoning/ban-logic/terms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"terms.js","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/terms.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;;;AA+F/D,gCAiDC;AAED,sCAqDC;AAED,gCAEC;AAID,oCAiBC;AAED,0CAyBC;AAvPD,qCAAqC;AAE9B,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AAArE,QAAA,SAAS,aAA4D;AAE3E,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,MAAyB,EAAW,EAAE,CACtE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AADpD,QAAA,GAAG,OACiD;AAE1D,MAAM,KAAK,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;AAA7D,QAAA,KAAK,SAAwD;AAEnE,MAAM,IAAI,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAA3D,QAAA,IAAI,QAAuD;AAEjE,MAAM,OAAO,GAAG,CAAC,GAAG,OAAkB,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;AAA7E,QAAA,OAAO,WAAsE;AAEnF,MAAM,SAAS,GAAG,CAAC,GAAY,EAAE,CAAU,EAAW,EAAE,CAAC,CAAC;IAC/D,IAAI,EAAE,WAAW;IACjB,OAAO,EAAE,GAAG;IACZ,GAAG,EAAE,CAAC;CACP,CAAC,CAAC;AAJU,QAAA,SAAS,aAInB;AAEI,MAAM,MAAM,GAAG,CAAC,GAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;AAAvE,QAAA,MAAM,UAAiE;AAE7E,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAgB,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAA3E,QAAA,QAAQ,YAAmE;AAExF,qCAAqC;AAE9B,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,UAAU;IAChB,SAAS,EAAE,CAAC;IACZ,KAAK,EAAE,CAAC;CACT,CAAC,CAAC;AAJU,QAAA,QAAQ,YAIlB;AAEI,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAC3D,IAAI,EAAE,MAAM;IACZ,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,IAAI,QAId;AAEI,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IAC9D,IAAI,EAAE,MAAM;IACZ,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,IAAI,QAId;AAEI,MAAM,WAAW,GAAG,CAAC,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,cAAc;IACpB,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,WAAW,eAIrB;AAEI,MAAM,YAAY,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IACtE,IAAI,EAAE,cAAc;IACpB,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,YAAY,gBAItB;AAEI,MAAM,KAAK,GAAG,CAAC,CAAU,EAAc,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AAAjE,QAAA,KAAK,SAA4D;AAEvE,MAAM,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAC5E,IAAI,EAAE,WAAW;IACjB,CAAC;IACD,CAAC;IACD,GAAG,EAAE,CAAC;CACP,CAAC,CAAC;AALU,QAAA,SAAS,aAKnB;AAEI,MAAM,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAChE,IAAI,EAAE,WAAW;IACjB,SAAS,EAAE,CAAC;IACZ,GAAG,EAAE,CAAC;CACP,CAAC,CAAC;AAJU,QAAA,SAAS,aAInB;AAEI,MAAM,YAAY,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAC/E,IAAI,EAAE,cAAc;IACpB,CAAC;IACD,CAAC;IACD,MAAM,EAAE,CAAC;CACV,CAAC,CAAC;AALU,QAAA,YAAY,gBAKtB;AAEI,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,UAAU;IAChB,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,CAAC;CACb,CAAC,CAAC;AAJU,QAAA,QAAQ,YAIlB;AAEI,MAAM,UAAU,GAAG,CAAC,IAAgB,EAAE,KAAiB,EAAc,EAAE,CAAC,CAAC;IAC9E,IAAI,EAAE,aAAa;IACnB,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,UAAU,cAIpB;AAEH,gCAAgC;AAEhC,SAAgB,UAAU,CAAC,CAAU,EAAE,CAAU;IAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,WAAW,CAAC;QACjB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM;YACT,gCAAgC;YAChC,OAAQ,CAAsB,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;QACjD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAsC,CAAC;YAClD,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;YACpB,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC;YACrB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YAC5B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,iDAAiD;YACjD,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,GAAG,CAA0C,CAAC;YACtD,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,EAAE,CAAC,OAAO,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;oBAAE,OAAO,KAAK,CAAC;gBAC7B,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAA2C,CAAC;YACvD,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;oBAAE,OAAO,KAAK,CAAC;gBAC7B,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAA4C,CAAC;YACxD,OAAO,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,CAAyC,CAAC;YACrD,OAAO,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,aAAa,CAAC,CAAa,EAAE,CAAa;IACxD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAA8C,CAAC;YAC1D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACnF,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAA0C,CAAC;YACtD,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAA0C,CAAC;YACtD,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACjF,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACjF,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,CAA2C,CAAC;YACvD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAA+C,CAAC;YAC3D,+CAA+C;YAC/C,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAA+C,CAAC;YAC3D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;QACvD,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAA8C,CAAC;YAC1D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;QAC3F,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,CAAiD,CAAC;YAC7D,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,UAAU,CAAC,KAAgC,EAAE,MAAkB;IAC7E,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,2BAA2B;AAE3B,SAAgB,YAAY,CAAC,CAAU;IACrC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,WAAW,CAAC;QACjB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9D,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACvD,KAAK,UAAU;YACb,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QACtD,KAAK,WAAW;YACd,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/D,KAAK,QAAQ;YACX,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC;IAC3C,CAAC;AACH,CAAC;AAED,SAAgB,eAAe,CAAC,CAAa;IAC3C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACvE,KAAK,MAAM;YACT,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAClE,KAAK,MAAM;YACT,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACtE,KAAK,cAAc;YACjB,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACnE,KAAK,cAAc;YACjB,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACtE,KAAK,OAAO;YACV,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACtC,KAAK,WAAW;YACd,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7E,KAAK,WAAW;YACd,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QACjE,KAAK,cAAc;YACjB,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAChF,KAAK,UAAU;YACb,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3E,KAAK,aAAa;YAChB,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IAC1E,CAAC;AACH,CAAC"}

package/dist/reasoning/ban-logic/types.d.ts

@@ -0,0 +1,107 @@
+/**
+ * Un término BAN es un objeto del dominio: principal (agente), clave,
+ * nonce, mensaje compuesto, mensaje cifrado, hash o término genérico.
+ */
+export type BANTerm = {
+    kind: 'principal';
+    name: string;
+} | {
+    kind: 'key';
+    name: string;
+    shared?: [string, string];
+} | {
+    kind: 'nonce';
+    name: string;
+} | {
+    kind: 'message';
+    content: BANTerm[];
+} | {
+    kind: 'encrypted';
+    message: BANTerm;
+    key: BANTerm;
+} | {
+    kind: 'hashed';
+    message: BANTerm;
+} | {
+    kind: 'compound';
+    parts: BANTerm[];
+} | {
+    kind: 'atom';
+    name: string;
+};
+/**
+ * Una fórmula BAN es una proposición sobre creencias, posesión o
+ * propiedades de términos. Es lo que las reglas manipulan.
+ *
+ * Nota: tratamos `said` y `said-message` por separado porque BAN distingue
+ * entre "P dijo una fórmula completa" (raro) y "P dijo un término"
+ * (caso usual; lo que aparece en mensajes ciphered).
+ */
+export type BANFormula = {
+    kind: 'believes';
+    principal: BANTerm;
+    about: BANFormula;
+} | {
+    kind: 'sees';
+    principal: BANTerm;
+    what: BANTerm;
+} | {
+    kind: 'said';
+    principal: BANTerm;
+    what: BANFormula;
+} | {
+    kind: 'said-message';
+    principal: BANTerm;
+    what: BANTerm;
+} | {
+    kind: 'jurisdiction';
+    principal: BANTerm;
+    over: BANFormula;
+} | {
+    kind: 'fresh';
+    what: BANTerm;
+} | {
+    kind: 'sharedKey';
+    a: BANTerm;
+    b: BANTerm;
+    key: BANTerm;
+} | {
+    kind: 'publicKey';
+    principal: BANTerm;
+    key: BANTerm;
+} | {
+    kind: 'sharedSecret';
+    a: BANTerm;
+    b: BANTerm;
+    secret: BANTerm;
+} | {
+    kind: 'controls';
+    principal: BANTerm;
+    statement: BANFormula;
+} | {
+    kind: 'formula-and';
+    left: BANFormula;
+    right: BANFormula;
+};
+export interface BANRule {
+    name: string;
+    description: string;
+}
+export interface ProtocolStep {
+    from: string;
+    to: string;
+    message: BANTerm;
+}
+export interface Protocol {
+    name: string;
+    participants: string[];
+    initialAssumptions: BANFormula[];
+    steps: ProtocolStep[];
+    goals: BANFormula[];
+}
+export interface ProtocolAnalysis {
+    satisfied: BANFormula[];
+    unsatisfied: BANFormula[];
+    trace: BANFormula[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/reasoning/ban-logic/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/types.ts"],"names":[],"mappings":"AA2BA;;;GAGG;AACH,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,OAAO,EAAE,OAAO,EAAE,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,OAAO,EAAE,CAAA;CAAE,GACtC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAInC;;;;;;;GAOG;AACH,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,UAAU,CAAA;CAAE,GACtD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,UAAU,CAAA;CAAE,GAC9D;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACvD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,GACjE;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,SAAS,EAAE,UAAU,CAAA;CAAE,GAC/D;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAIjE,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;CACrB;AAID,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,kBAAkB,EAAE,UAAU,EAAE,CAAC;IACjC,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,KAAK,EAAE,UAAU,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,UAAU,EAAE,CAAC;IACxB,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,KAAK,EAAE,UAAU,EAAE,CAAC;CACrB"}

package/dist/reasoning/ban-logic/types.js

@@ -0,0 +1,27 @@
+"use strict";
+// ============================================================
+// BAN Logic — Tipos públicos
+// ============================================================
+//
+// Burrows-Abadi-Needham logic (1989): cálculo modal de creencias para
+// análisis de protocolos criptográficos de autenticación.
+//
+// Símbolos (notación estándar BAN):
+//
+//   P |≡ X      "P believes X"               P cree X
+//   P ◁  X      "P sees X"                   P ve X (recibió un mensaje con X)
+//   P |~ X      "P once said X"              P dijo X alguna vez
+//   P |⇒ X      "P has jurisdiction over X"  P es autoridad sobre X
+//   #(X)        "fresh X"                    X es fresco (nonce reciente)
+//   P ↔K Q      "K is shared between P, Q"   K es clave compartida
+//   |→K P       "K is public key for P"      K es la clave pública de P
+//   P ⇌X Q      "X is shared secret"         X es un secreto compartido
+//   {X}_K       "X encrypted with K"         X cifrado con K
+//   <X>_Y       "X combined with secret Y"   X concatenado con secreto Y
+//   H(X)        "hash of X"                  hash de X
+//
+// Reglas de inferencia clásicas (10): message-meaning (3 variantes:
+// shared-key, public-key, shared-secret), nonce-verification,
+// jurisdiction, freshness propagation, belief conjunction, seeing rules.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/reasoning/ban-logic/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,sEAAsE;AACtE,0DAA0D;AAC1D,EAAE;AACF,oCAAoC;AACpC,EAAE;AACF,sDAAsD;AACtD,+EAA+E;AAC/E,iEAAiE;AACjE,oEAAoE;AACpE,0EAA0E;AAC1E,mEAAmE;AACnE,wEAAwE;AACxE,wEAAwE;AACxE,6DAA6D;AAC7D,yEAAyE;AACzE,uDAAuD;AACvD,EAAE;AACF,oEAAoE;AACpE,8DAA8D;AAC9D,yEAAyE"}

package/dist/reasoning/differential-privacy/index.d.ts

@@ -0,0 +1,121 @@
+export interface DPMechanism<T> {
+    epsilon: number;
+    delta: number;
+    sensitivity: number;
+    apply(input: T): T | number;
+}
+export interface DPRng {
+    uniform(): number;
+    laplace(b: number): number;
+    gaussian(mu: number, sigma: number): number;
+}
+export declare function makeDPRng(seed?: number): DPRng;
+/**
+ * Mecanismo de Laplace: agrega ruido Laplace(0, Δ/ε) a `value`.
+ * Da ε-DP puro (δ = 0) cuando Δ es la sensibilidad L1 de la query.
+ */
+export declare function laplaceNoise(value: number, sensitivity: number, epsilon: number, rng?: DPRng): number;
+/**
+ * Mecanismo Gaussian: agrega N(0, σ²) con σ = Δ·√(2 ln(1.25/δ))/ε,
+ * la calibración estándar de Dwork-Roth (Algorithmic Foundations,
+ * Theorem A.1). Garantiza (ε,δ)-DP para ε ∈ (0, 1] cuando Δ es la
+ * sensibilidad L2. Para ε > 1 la cota sigue siendo válida pero deja
+ * de ser tight; los frameworks modernos prefieren la "analytic
+ * Gaussian" (Balle-Wang 2018) — la dejamos para una iteración futura.
+ */
+export declare function gaussianNoise(value: number, sensitivity: number, epsilon: number, delta: number, rng?: DPRng): number;
+/**
+ * Mecanismo exponencial: elige un item con probabilidad proporcional
+ * a exp(ε · score(item) / (2 · sensitivity)). Implementa la
+ * formulación canónica (McSherry-Talwar 2007). Da ε-DP cuando
+ * `sensitivity` es la sensibilidad de la función de score.
+ */
+export declare function exponentialMechanism<T>(items: T[], score: (item: T) => number, sensitivity: number, epsilon: number, rng?: DPRng): T;
+/**
+ * Randomized response binario: reporta `bit` con probabilidad `p`,
+ * y `¬bit` con probabilidad 1 − p. Garantiza ε-DP local con
+ * ε = |ln(p / (1 − p))|. La elección clásica p = 3/4 da ε = ln 3.
+ */
+export declare function randomizedResponse(bit: boolean, p: number, rng?: DPRng): boolean;
+/**
+ * ε equivalente a un mecanismo de randomized response con
+ * probabilidad de verdad `p`. Útil para test del trade-off.
+ */
+export declare function randomizedResponseEpsilon(p: number): number;
+/**
+ * Conteo DP: cuenta cuántos valores cumplen `predicate` y aplica
+ * ruido Laplace con sensibilidad 1 (cambiar un registro mueve el
+ * conteo en a lo más 1). El resultado se redondea al entero más
+ * cercano y se clamp-a a ≥ 0 (un conteo nunca es negativo).
+ */
+export declare function dpCount<T>(values: T[], predicate: (v: T) => boolean, epsilon: number, rng?: DPRng): number;
+/**
+ * Media DP de valores acotados al rango [low, high]: clipea cada
+ * valor al rango, calcula la media empírica y aplica Laplace con
+ * sensibilidad (high − low) / n. Asumimos n público.
+ */
+export declare function dpMean(values: number[], range: [number, number], epsilon: number, rng?: DPRng): number;
+/**
+ * Histograma DP sobre `categories`: cuenta ocurrencias por categoría
+ * y agrega ruido Laplace independiente a cada bin con sensibilidad 1.
+ * Asumimos que cada registro pertenece a a lo más una categoría
+ * (cambiar un registro mueve a lo más un bin en ±1). Si las
+ * categorías son disjuntas y cubrentes, este es un caso clásico de
+ * composición paralela: el ε total = ε.
+ */
+export declare function dpHistogram<T>(values: T[], categories: T[], epsilon: number, rng?: DPRng): Map<T, number>;
+export interface PrivacyBudget {
+    epsilon: number;
+    delta: number;
+}
+/**
+ * Composición básica (Dwork-McSherry-Nissim-Smith 2006, Theorem 3.16
+ * en Algorithmic Foundations): la composición secuencial de k
+ * mecanismos (ε_i, δ_i)-DP da (Σ ε_i, Σ δ_i)-DP. Cota uniforme y
+ * conservadora.
+ */
+export declare function basicComposition(mechanisms: PrivacyBudget[]): PrivacyBudget;
+/**
+ * Composición avanzada (Dwork-Rothblum-Vadhan 2010, Theorem III.3):
+ * para k mecanismos cada uno (ε, δ)-DP, el compuesto es
+ *
+ *   (√(2 k ln(1/δ')) · ε  +  k · ε · (e^ε − 1),  k δ + δ')-DP
+ *
+ * para cualquier δ' > 0. Cuando los ε_i son heterogéneos usamos el
+ * máximo como cota uniforme (válida pero no óptima; el tight bound
+ * heterogéneo requiere RDP/zCDP, fuera del alcance de este módulo).
+ *
+ * `deltaTotal` es el δ' adicional que el caller acepta pagar.
+ * Devuelve el (ε,δ) total cubriendo el slack δ'.
+ */
+export declare function advancedComposition(mechanisms: PrivacyBudget[], deltaTotal: number): PrivacyBudget;
+/**
+ * Composición paralela: cuando k mecanismos actúan sobre particiones
+ * disjuntas del dataset, el ε total es el máximo (no la suma), y el
+ * δ total es el máximo (no la suma). Caso clásico: histograma con
+ * categorías mutuamente excluyentes.
+ */
+export declare function parallelComposition(mechanisms: PrivacyBudget[]): PrivacyBudget;
+/**
+ * Sensibilidad global L1: el máximo de |f(D) − f(D')| sobre la
+ * lista de pares neighbours suministrada. Implementación empírica
+ * pensada para tests/diagnóstico — la sensibilidad real exige
+ * razonar sobre todas las parejas válidas, no sólo las muestreadas.
+ */
+export declare function globalSensitivityL1(fn: (data: number[]) => number, neighbors: Array<[number[], number[]]>): number;
+/**
+ * Sensibilidad suave (Nissim-Raskhodnikova-Smith 2007):
+ *
+ *   S*_β(f, D) = max_k e^{−β·k} · LS^{(k)}(f, D)
+ *
+ * donde LS^{(k)} es la sensibilidad local a distancia k. Aproximamos
+ * variando vecinos hasta `data.length` (cota superior de k). Para
+ * datasets grandes, restringir el k máximo via la longitud del
+ * propio dataset.
+ *
+ * Esta es una versión basada en mutaciones simples (cambiar un valor
+ * por el mín o máx empírico) — suficiente para median/mean acotados
+ * en tests, no un cálculo general.
+ */
+export declare function smoothSensitivity(fn: (data: number[]) => number, data: number[], beta: number): number;
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/differential-privacy/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/differential-privacy/index.ts"],"names":[],"mappings":"AAiCA,MAAM,WAAW,WAAW,CAAC,CAAC;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;CAC7B;AASD,MAAM,WAAW,KAAK;IACpB,OAAO,IAAI,MAAM,CAAC;IAClB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;CAC7C;AAmBD,wBAAgB,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,KAAK,CAwB9C;AAgCD;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,MAAM,EACf,GAAG,GAAE,KAAmB,GACvB,MAAM,CAMR;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,GAAG,GAAE,KAAmB,GACvB,MAAM,CAUR;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EACpC,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,EAC1B,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,MAAM,EACf,GAAG,GAAE,KAAmB,GACvB,CAAC,CAuCH;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,GAAE,KAAmB,GAAG,OAAO,CAK7F;AAED;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAK3D;AAMD;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,MAAM,EAAE,CAAC,EAAE,EACX,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,EAC5B,OAAO,EAAE,MAAM,EACf,GAAG,GAAE,KAAmB,GACvB,MAAM,CAQR;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CACpB,MAAM,EAAE,MAAM,EAAE,EAChB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EACvB,OAAO,EAAE,MAAM,EACf,GAAG,GAAE,KAAmB,GACvB,MAAM,CAkBR;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,MAAM,EAAE,CAAC,EAAE,EACX,UAAU,EAAE,CAAC,EAAE,EACf,OAAO,EAAE,MAAM,EACf,GAAG,GAAE,KAAmB,GACvB,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAchB;AAMD,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,aAAa,EAAE,GAAG,aAAa,CAU3E;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CACjC,UAAU,EAAE,aAAa,EAAE,EAC3B,UAAU,EAAE,MAAM,GACjB,aAAa,CAqBf;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,aAAa,EAAE,GAAG,aAAa,CAU9E;AAMD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,MAAM,EAC9B,SAAS,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,GACrC,MAAM,CAOR;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,iBAAiB,CAC/B,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,MAAM,EAC9B,IAAI,EAAE,MAAM,EAAE,EACd,IAAI,EAAE,MAAM,GACX,MAAM,CAgCR"}