@kanonak-protocol/expression 0.1.0

package/dist/index.d.ts

@@ -0,0 +1,57 @@
+/**
+ * `@kanonak-protocol/expression` — the Kanonak expression RUNTIME.
+ *
+ * A small, deterministic tree-walker that folds a `kanonak.org/transformations`
+ * (`tx`) + `kanonak.org/math` expression tree to a single number. Generated SDKs
+ * reference it so a typed expression can be *run*, not just *represented*.
+ *
+ * Three layers, exactly as the six-language proof established:
+ *
+ *   1. DISPATCH — derived from the ontology. An operator's arity falls out of its
+ *      `tx` superclass: UnaryNumericOp -> unary `value`; BinaryArithmetic /
+ *      BinaryComparison -> binary; BooleanLogic -> n-ary `operands`; plus the two
+ *      structural shapes the hierarchy can't imply (`Not`'s `operand`, `Clip`'s
+ *      ternary). The OPERATOR_ARITY table below is that derivation, frozen.
+ *
+ *   2. PRIMITIVES — the one authored, determinism-bearing artifact. PRIMITIVES
+ *      maps each operator URI to its fold. Determinism traps live here and are
+ *      matched in every language port (Round half-away-from-zero, floored Modulo,
+ *      Sign(0)=0, comparisons as 1/0).
+ *
+ *   3. THE FOLD — `evaluate`, a fixed shape: operators recurse + apply a
+ *      primitive; literals return their numeric value; EVERYTHING ELSE (a typed
+ *      VarRef, a domain `Step`/`Time`/`Smooth`, any future leaf) is handed to the
+ *      caller's `resolve(node, ctx, evaluate)`. The runtime is a pure operator
+ *      engine; binding and domain-leaf semantics are the caller's business. It
+ *      never privileges `tx.VarRef` — that is just one leaf a domain may resolve.
+ *
+ * Value domain: uniform numeric. Booleans and comparison results are `1`/`0`, so
+ * every language stays on one numeric path. `EXPRESSION_RUNTIME_VERSION` freezes
+ * the determinism contract; a change to any primitive, value rule, or dispatch
+ * requires a NEW version, never an edit in place.
+ */
+/** The frozen expression-runtime version (determinism contract). Not hashed. */
+export declare const EXPRESSION_RUNTIME_VERSION = "1";
+/** A node in the expression tree. `type` is the operator/literal/leaf canonical
+ * URI (versionless: `publisher/package/name`); operand keys are the frozen `tx`
+ * operand property local names. Unknown fields are ignored by the kernel and are
+ * available to `resolve` for domain leaves. */
+export interface ExprNode {
+    type: string;
+    [operandOrValue: string]: unknown;
+}
+/** Resolve any node the kernel does not recognise as an operator or literal — a
+ * binding (`tx.VarRef`, a domain's typed `refersTo` VarRef) or a domain leaf
+ * (`Step`, `Time`, `Smooth`…) — to a number. `ctx` is opaque caller state (the
+ * binding env, a sim clock, integration state). `evaluate` is handed back so a
+ * domain leaf containing sub-expressions can recurse into the kernel. */
+export type Resolve<C> = (node: ExprNode, ctx: C, evaluate: (n: ExprNode, ctx: C) => number) => number;
+export declare class ExpressionError extends Error {
+}
+/**
+ * Evaluate an expression tree to a number. Operators fold via the frozen
+ * dispatch + primitive tables; literals yield their numeric value; any other
+ * node is delegated to `resolve`.
+ */
+export declare function evaluate<C = unknown>(node: ExprNode, ctx: C, resolve: Resolve<C>): number;
+//# 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":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,gFAAgF;AAChF,eAAO,MAAM,0BAA0B,MAAM,CAAC;AAK9C;;;+CAG+C;AAC/C,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC;CACnC;AAED;;;;yEAIyE;AACzE,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,KAAK,MAAM,CAAC;AAEvG,qBAAa,eAAgB,SAAQ,KAAK;CAAG;AAgH7C;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,GAAG,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CA8CzF"}

package/dist/index.js

@@ -0,0 +1,189 @@
+/**
+ * `@kanonak-protocol/expression` — the Kanonak expression RUNTIME.
+ *
+ * A small, deterministic tree-walker that folds a `kanonak.org/transformations`
+ * (`tx`) + `kanonak.org/math` expression tree to a single number. Generated SDKs
+ * reference it so a typed expression can be *run*, not just *represented*.
+ *
+ * Three layers, exactly as the six-language proof established:
+ *
+ *   1. DISPATCH — derived from the ontology. An operator's arity falls out of its
+ *      `tx` superclass: UnaryNumericOp -> unary `value`; BinaryArithmetic /
+ *      BinaryComparison -> binary; BooleanLogic -> n-ary `operands`; plus the two
+ *      structural shapes the hierarchy can't imply (`Not`'s `operand`, `Clip`'s
+ *      ternary). The OPERATOR_ARITY table below is that derivation, frozen.
+ *
+ *   2. PRIMITIVES — the one authored, determinism-bearing artifact. PRIMITIVES
+ *      maps each operator URI to its fold. Determinism traps live here and are
+ *      matched in every language port (Round half-away-from-zero, floored Modulo,
+ *      Sign(0)=0, comparisons as 1/0).
+ *
+ *   3. THE FOLD — `evaluate`, a fixed shape: operators recurse + apply a
+ *      primitive; literals return their numeric value; EVERYTHING ELSE (a typed
+ *      VarRef, a domain `Step`/`Time`/`Smooth`, any future leaf) is handed to the
+ *      caller's `resolve(node, ctx, evaluate)`. The runtime is a pure operator
+ *      engine; binding and domain-leaf semantics are the caller's business. It
+ *      never privileges `tx.VarRef` — that is just one leaf a domain may resolve.
+ *
+ * Value domain: uniform numeric. Booleans and comparison results are `1`/`0`, so
+ * every language stays on one numeric path. `EXPRESSION_RUNTIME_VERSION` freezes
+ * the determinism contract; a change to any primitive, value rule, or dispatch
+ * requires a NEW version, never an edit in place.
+ */
+/** The frozen expression-runtime version (determinism contract). Not hashed. */
+export const EXPRESSION_RUNTIME_VERSION = '1';
+const TX = 'kanonak.org/transformations';
+const MATH = 'kanonak.org/math';
+export class ExpressionError extends Error {
+}
+const UN = (operand) => ({ kind: 'unary', operand });
+const BIN = (left, right) => ({ kind: 'binary', left, right });
+// UnaryNumericOp + Not -> `value` / `operand`; BinaryArithmetic -> arithLeft/Right;
+// BinaryComparison -> compareLeft/Right; BooleanLogic -> operands list; Clip ternary.
+const ARITH = BIN('arithLeft', 'arithRight');
+const COMPARE = BIN('compareLeft', 'compareRight');
+const VALUE = UN('value');
+const OPERATOR_ARITY = {
+    [`${TX}/Add`]: ARITH,
+    [`${TX}/Subtract`]: ARITH,
+    [`${TX}/Multiply`]: ARITH,
+    [`${TX}/Divide`]: ARITH,
+    [`${MATH}/Power`]: ARITH,
+    [`${MATH}/Modulo`]: ARITH,
+    [`${MATH}/Minimum`]: ARITH,
+    [`${MATH}/Maximum`]: ARITH,
+    [`${TX}/Abs`]: VALUE,
+    [`${TX}/Negate`]: VALUE,
+    [`${MATH}/Exp`]: VALUE,
+    [`${MATH}/Ln`]: VALUE,
+    [`${MATH}/Log10`]: VALUE,
+    [`${MATH}/Sqrt`]: VALUE,
+    [`${MATH}/Floor`]: VALUE,
+    [`${MATH}/Ceil`]: VALUE,
+    [`${MATH}/Round`]: VALUE,
+    [`${MATH}/Sign`]: VALUE,
+    [`${TX}/Equals`]: COMPARE,
+    [`${TX}/GreaterThan`]: COMPARE,
+    [`${TX}/LessThan`]: COMPARE,
+    [`${TX}/GreaterThanOrEqual`]: COMPARE,
+    [`${TX}/LessThanOrEqual`]: COMPARE,
+    [`${TX}/And`]: { kind: 'nary', operands: 'operands' },
+    [`${TX}/Or`]: { kind: 'nary', operands: 'operands' },
+    // `Not` is a direct Expression subclass with boolean (not numeric-unary)
+    // semantics — handled explicitly in `evaluate`, not via the numeric tables.
+    [`${MATH}/Clip`]: { kind: 'ternary', a: 'clipValue', b: 'clipLower', c: 'clipUpper' },
+};
+/** Floored modulo (the host `%` truncates toward zero): Modulo(-7,3) = 2. */
+function flooredMod(a, b) {
+    if (b === 0)
+        throw new ExpressionError('Modulo by zero');
+    return a - b * Math.floor(a / b);
+}
+/** Round half away from zero: Round(-2.5) = -3, Round(2.5) = 3. */
+function roundHalfAway(a) {
+    return a < 0 ? -Math.round(-a) : Math.round(a);
+}
+const truthy = (n) => n !== 0;
+const bool = (b) => (b ? 1 : 0);
+function requireDomain(ok, msg) {
+    if (!ok)
+        throw new ExpressionError(msg);
+}
+/** Unary/binary/ternary primitives, keyed by operator URI. The authored,
+ * determinism-bearing table — matched per language. */
+const UNARY = {
+    [`${TX}/Abs`]: (x) => Math.abs(x),
+    [`${TX}/Negate`]: (x) => -x,
+    [`${MATH}/Exp`]: (x) => Math.exp(x),
+    [`${MATH}/Ln`]: (x) => (requireDomain(x > 0, 'Ln of a non-positive number'), Math.log(x)),
+    [`${MATH}/Log10`]: (x) => (requireDomain(x > 0, 'Log10 of a non-positive number'), Math.log10(x)),
+    [`${MATH}/Sqrt`]: (x) => (requireDomain(x >= 0, 'Sqrt of a negative number'), Math.sqrt(x)),
+    [`${MATH}/Floor`]: (x) => Math.floor(x),
+    [`${MATH}/Ceil`]: (x) => Math.ceil(x),
+    [`${MATH}/Round`]: roundHalfAway,
+    [`${MATH}/Sign`]: (x) => Math.sign(x),
+};
+const BINARY = {
+    [`${TX}/Add`]: (a, b) => a + b,
+    [`${TX}/Subtract`]: (a, b) => a - b,
+    [`${TX}/Multiply`]: (a, b) => a * b,
+    [`${TX}/Divide`]: (a, b) => (requireDomain(b !== 0, 'Divide by zero'), a / b),
+    [`${MATH}/Power`]: (a, b) => Math.pow(a, b),
+    [`${MATH}/Modulo`]: flooredMod,
+    [`${MATH}/Minimum`]: (a, b) => Math.min(a, b),
+    [`${MATH}/Maximum`]: (a, b) => Math.max(a, b),
+    [`${TX}/Equals`]: (a, b) => bool(a === b),
+    [`${TX}/GreaterThan`]: (a, b) => bool(a > b),
+    [`${TX}/LessThan`]: (a, b) => bool(a < b),
+    [`${TX}/GreaterThanOrEqual`]: (a, b) => bool(a >= b),
+    [`${TX}/LessThanOrEqual`]: (a, b) => bool(a <= b),
+};
+/** Numeric value of a literal node, or `undefined` if it is not a literal. */
+function literalValue(node) {
+    switch (node.type) {
+        case `${TX}/IntegerLiteral`: return Number(node.integerLiteral);
+        case `${TX}/DecimalLiteral`: return Number(node.decimalLiteral);
+        case `${TX}/BooleanLiteral`: return bool(node.booleanLiteral === true || node.booleanLiteral === 'true');
+        default: return undefined;
+    }
+}
+/**
+ * Evaluate an expression tree to a number. Operators fold via the frozen
+ * dispatch + primitive tables; literals yield their numeric value; any other
+ * node is delegated to `resolve`.
+ */
+export function evaluate(node, ctx, resolve) {
+    const recurse = (n, c) => evaluate(n, c, resolve);
+    const arity = OPERATOR_ARITY[node.type];
+    if (arity) {
+        switch (arity.kind) {
+            case 'unary': {
+                const x = recurse(operand(node, arity.operand), ctx);
+                return UNARY[node.type](x);
+            }
+            case 'binary': {
+                const a = recurse(operand(node, arity.left), ctx);
+                const b = recurse(operand(node, arity.right), ctx);
+                return BINARY[node.type](a, b);
+            }
+            case 'nary': {
+                const items = node[arity.operands];
+                if (!Array.isArray(items))
+                    throw new ExpressionError(`${node.type} expects an '${arity.operands}' list`);
+                const isAnd = node.type === `${TX}/And`;
+                // Short-circuit; empty And is vacuously true, empty Or vacuously false.
+                for (const item of items) {
+                    const v = truthy(recurse(item, ctx));
+                    if (isAnd && !v)
+                        return 0;
+                    if (!isAnd && v)
+                        return 1;
+                }
+                return bool(isAnd);
+            }
+            case 'ternary': {
+                // Only Clip today: clamp clipValue into [clipLower, clipUpper].
+                const v = recurse(operand(node, arity.a), ctx);
+                const lo = recurse(operand(node, arity.b), ctx);
+                const hi = recurse(operand(node, arity.c), ctx);
+                return Math.min(Math.max(v, lo), hi);
+            }
+        }
+    }
+    if (node.type === `${TX}/Not`) {
+        return bool(!truthy(recurse(operand(node, 'operand'), ctx)));
+    }
+    const lit = literalValue(node);
+    if (lit !== undefined)
+        return lit;
+    // Not an operator or literal — a binding or domain leaf. The caller owns it.
+    return resolve(node, ctx, recurse);
+}
+function operand(node, key) {
+    const v = node[key];
+    if (v === null || v === undefined || typeof v !== 'object') {
+        throw new ExpressionError(`${node.type} is missing operand '${key}'`);
+    }
+    return v;
+}
+//# 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;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,gFAAgF;AAChF,MAAM,CAAC,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAE9C,MAAM,EAAE,GAAG,6BAA6B,CAAC;AACzC,MAAM,IAAI,GAAG,kBAAkB,CAAC;AAkBhC,MAAM,OAAO,eAAgB,SAAQ,KAAK;CAAG;AAS7C,MAAM,EAAE,GAAG,CAAC,OAAe,EAAS,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;AACpE,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,KAAa,EAAS,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;AAEtF,oFAAoF;AACpF,sFAAsF;AACtF,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;AAC7C,MAAM,OAAO,GAAG,GAAG,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;AACnD,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAE1B,MAAM,cAAc,GAA0B;IAC5C,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK;IACpB,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,KAAK;IACzB,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,KAAK;IACzB,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK;IACvB,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,KAAK;IACxB,CAAC,GAAG,IAAI,SAAS,CAAC,EAAE,KAAK;IACzB,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,KAAK;IAC1B,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,KAAK;IAE1B,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK;IACpB,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK;IACvB,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,KAAK;IACtB,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,KAAK;IACrB,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,KAAK;IACxB,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,KAAK;IACvB,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,KAAK;IACxB,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,KAAK;IACvB,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,KAAK;IACxB,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,KAAK;IAEvB,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,OAAO;IACzB,CAAC,GAAG,EAAE,cAAc,CAAC,EAAE,OAAO;IAC9B,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,OAAO;IAC3B,CAAC,GAAG,EAAE,qBAAqB,CAAC,EAAE,OAAO;IACrC,CAAC,GAAG,EAAE,kBAAkB,CAAC,EAAE,OAAO;IAElC,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE;IACrD,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE;IACpD,yEAAyE;IACzE,4EAA4E;IAE5E,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE;CACtF,CAAC;AAEF,6EAA6E;AAC7E,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,eAAe,CAAC,gBAAgB,CAAC,CAAC;IACzD,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,mEAAmE;AACnE,SAAS,aAAa,CAAC,CAAS;IAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAC/C,MAAM,IAAI,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEjD,SAAS,aAAa,CAAC,EAAW,EAAE,GAAW;IAC7C,IAAI,CAAC,EAAE;QAAE,MAAM,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED;uDACuD;AACvD,MAAM,KAAK,GAA0C;IACnD,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,6BAA6B,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzF,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,gCAAgC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjG,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,EAAE,2BAA2B,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvC,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,aAAa;IAChC,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;CACtC,CAAC;AAEF,MAAM,MAAM,GAAqD;IAC/D,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IAC9B,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IACnC,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IACnC,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,EAAE,gBAAgB,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC7E,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC,GAAG,IAAI,SAAS,CAAC,EAAE,UAAU;IAC9B,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,GAAG,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC,GAAG,EAAE,qBAAqB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,GAAG,EAAE,kBAAkB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;CAClD,CAAC;AAEF,8EAA8E;AAC9E,SAAS,YAAY,CAAC,IAAc;IAClC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,GAAG,EAAE,iBAAiB,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAChE,KAAK,GAAG,EAAE,iBAAiB,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAChE,KAAK,GAAG,EAAE,iBAAiB,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,IAAI,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,CAAC,CAAC;QACzG,OAAO,CAAC,CAAC,OAAO,SAAS,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAc,IAAc,EAAE,GAAM,EAAE,OAAmB;IAC/E,MAAM,OAAO,GAAG,CAAC,CAAW,EAAE,CAAI,EAAU,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAEvE,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,KAAK,EAAE,CAAC;QACV,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC;gBACrD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;gBAClD,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;gBACnD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC;YACD,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBAAE,MAAM,IAAI,eAAe,CAAC,GAAG,IAAI,CAAC,IAAI,gBAAgB,KAAK,CAAC,QAAQ,QAAQ,CAAC,CAAC;gBACzG,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,GAAG,EAAE,MAAM,CAAC;gBACxC,wEAAwE;gBACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAgB,EAAE,GAAG,CAAC,CAAC,CAAC;oBACjD,IAAI,KAAK,IAAI,CAAC,CAAC;wBAAE,OAAO,CAAC,CAAC;oBAC1B,IAAI,CAAC,KAAK,IAAI,CAAC;wBAAE,OAAO,CAAC,CAAC;gBAC5B,CAAC;gBACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,gEAAgE;gBAChE,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC/C,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAChD,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAChD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,EAAE,MAAM,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IAElC,6EAA6E;IAC7E,OAAO,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,OAAO,CAAC,IAAc,EAAE,GAAW;IAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC3D,MAAM,IAAI,eAAe,CAAC,GAAG,IAAI,CAAC,IAAI,wBAAwB,GAAG,GAAG,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,CAAa,CAAC;AACvB,CAAC"}

package/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "@kanonak-protocol/expression",
+  "version": "0.1.0",
+  "description": "The Kanonak expression runtime (expressionRuntimeVersion \"1\") — a deterministic tree-walker that folds a kanonak.org/transformations + kanonak.org/math expression to a number, verified against the shared parity vectors. The behavior every generated SDK evaluates through.",
+  "license": "Apache-2.0",
+  "homepage": "https://kanonak.org",
+  "author": "Kanonak Maintainers (https://github.com/kanonak-protocol/runtime)",
+  "bugs": {
+    "url": "https://github.com/kanonak-protocol/runtime/issues"
+  },
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "keywords": [
+    "kanonak",
+    "expression",
+    "evaluate",
+    "transformations",
+    "deterministic",
+    "sdk"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/kanonak-protocol/runtime"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "typecheck": "tsc --noEmit",
+    "conformance": "tsx src/conformance.ts"
+  },
+  "devDependencies": {
+    "@types/node": "^22.10.0",
+    "tsx": "^4.19.0",
+    "typescript": "^5.7.2"
+  }
+}