@crediolabs/policy-synth 0.4.0 → 0.5.0

package/dist-cjs/install/read-account-rules.js

@@ -0,0 +1,252 @@
+"use strict";
+//! Reading an OpenZeppelin smart account's context rules back off chain.
+//!
+//! `authority-overlap.ts` needs to know what a signer can already do before a
+//! new policy is installed. That means every rule on the account: its context
+//! type, its signers, its attached policies, and - for rules our interpreter
+//! polices - the predicate itself.
+//!
+//! Without this, the overlap scan can only report on rules the CALLER supplied,
+//! which means it answers "what did you tell me about" rather than "what is on
+//! the account". Those are different questions, and only the second one is
+//! worth anything to someone deciding whether to sign.
+//!
+//! The predicate is NOT reachable through a contract call. The interpreter
+//! publishes only `grammar_version`, `install`, `enforce`, `uninstall` and
+//! `rotate_master_signer_set`, so the stored document is read as a ledger entry
+//! instead. That keeps this a purely client-side capability: adding a getter
+//! would change a deployed contract's ABI and force a redeploy plus re-audit to
+//! obtain data the ledger already exposes.
+//!
+//! The decoders are pure so they can be tested without a network; the caller
+//! supplies raw `ScVal`s.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MAX_RULE_ID_SCAN = exports.K_DOC = void 0;
+exports.docKeyScVal = docKeyScVal;
+exports.docLedgerKey = docLedgerKey;
+exports.decodeContextType = decodeContextType;
+exports.decodeSigner = decodeSigner;
+exports.decodeContextRule = decodeContextRule;
+exports.decodeStoredPredicateBytes = decodeStoredPredicateBytes;
+exports.collectObservedRules = collectObservedRules;
+exports.accountRuleReaderFromServer = accountRuleReaderFromServer;
+const stellar_sdk_1 = require("@stellar/stellar-sdk");
+const decode_ts_1 = require("../predicate/decode.js");
+/** `storage.rs` - the third element of the persistent doc key tuple. */
+exports.K_DOC = 1;
+/** Persistent-storage key for a rule's stored document:
+ *  `(account, rule_id, K_DOC)`. */
+function docKeyScVal(smartAccount, ruleId) {
+    return stellar_sdk_1.xdr.ScVal.scvVec([
+        new stellar_sdk_1.Address(smartAccount).toScVal(),
+        stellar_sdk_1.xdr.ScVal.scvU32(ruleId),
+        stellar_sdk_1.xdr.ScVal.scvU32(exports.K_DOC),
+    ]);
+}
+/** Ledger key for the interpreter's persistent entry holding that document. */
+function docLedgerKey(interpreter, smartAccount, ruleId) {
+    return stellar_sdk_1.xdr.LedgerKey.contractData(new stellar_sdk_1.xdr.LedgerKeyContractData({
+        contract: new stellar_sdk_1.Address(interpreter).toScAddress(),
+        key: docKeyScVal(smartAccount, ruleId),
+        durability: stellar_sdk_1.xdr.ContractDataDurability.persistent(),
+    }));
+}
+// ---- ScVal helpers -----
+/** Field of a `#[contracttype]` struct, which the host encodes as a map keyed
+ *  by field-name symbol. Returns undefined when the field is absent so a
+ *  caller can distinguish "not there" from "there and empty". */
+function mapField(v, name) {
+    if (v.switch() !== stellar_sdk_1.xdr.ScValType.scvMap())
+        return undefined;
+    for (const entry of v.map() ?? []) {
+        const key = entry.key();
+        if (key.switch() === stellar_sdk_1.xdr.ScValType.scvSymbol() && key.sym().toString() === name) {
+            return entry.val();
+        }
+    }
+    return undefined;
+}
+function u32Of(v) {
+    return v?.switch() === stellar_sdk_1.xdr.ScValType.scvU32() ? v.u32() : undefined;
+}
+function addressOf(v) {
+    if (!v || v.switch() !== stellar_sdk_1.xdr.ScValType.scvAddress())
+        return undefined;
+    return stellar_sdk_1.Address.fromScAddress(v.address()).toString();
+}
+/** An enum variant of a `#[contracttype]` enum: `ScVal::Vec([Symbol, ...args])`. */
+function enumVariant(v) {
+    if (!v || v.switch() !== stellar_sdk_1.xdr.ScValType.scvVec())
+        return undefined;
+    const items = v.vec() ?? [];
+    const head = items[0];
+    if (!head || head.switch() !== stellar_sdk_1.xdr.ScValType.scvSymbol())
+        return undefined;
+    return { tag: head.sym().toString(), args: items.slice(1) };
+}
+// ---- decoders -----
+/** OZ `ContextRuleType`. An unrecognised tag is reported as `default`, which
+ *  is the widest reading and therefore the safe one: it makes the rule look
+ *  like it could serve any call, so overlap is over-reported, never missed. */
+function decodeContextType(v) {
+    const variant = enumVariant(v);
+    if (!variant)
+        return { kind: 'default' };
+    if (variant.tag === 'CallContract') {
+        const addr = addressOf(variant.args[0]);
+        return addr ? { kind: 'call_contract', contract: addr } : { kind: 'default' };
+    }
+    if (variant.tag === 'CreateContract') {
+        const arg = variant.args[0];
+        const hash = arg?.switch() === stellar_sdk_1.xdr.ScValType.scvBytes() ? arg.bytes().toString('hex') : '';
+        return { kind: 'create_contract', wasmHash: hash };
+    }
+    return { kind: 'default' };
+}
+/** OZ `Signer::Delegated(Address) | Signer::External(Address, Bytes)`. */
+function decodeSigner(v) {
+    const variant = enumVariant(v);
+    if (!variant)
+        return undefined;
+    if (variant.tag === 'Delegated') {
+        const addr = addressOf(variant.args[0]);
+        return addr ? { kind: 'delegated', address: addr } : undefined;
+    }
+    if (variant.tag === 'External') {
+        const verifier = addressOf(variant.args[0]);
+        const keyArg = variant.args[1];
+        const keyBytes = keyArg?.switch() === stellar_sdk_1.xdr.ScValType.scvBytes() ? keyArg.bytes().toString('hex') : '';
+        return verifier ? { kind: 'external', verifier, keyBytes } : undefined;
+    }
+    return undefined;
+}
+/** A full OZ `ContextRule` as returned by `get_context_rule(id)`.
+ *  `predicate` is filled in separately from the ledger entry. */
+function decodeContextRule(v) {
+    const id = u32Of(mapField(v, 'id'));
+    if (id === undefined)
+        return undefined;
+    const signersVal = mapField(v, 'signers');
+    const signers = [];
+    if (signersVal?.switch() === stellar_sdk_1.xdr.ScValType.scvVec()) {
+        for (const s of signersVal.vec() ?? []) {
+            const decoded = decodeSigner(s);
+            if (decoded)
+                signers.push(decoded);
+        }
+    }
+    const policiesVal = mapField(v, 'policies');
+    const policyAddresses = [];
+    if (policiesVal?.switch() === stellar_sdk_1.xdr.ScValType.scvVec()) {
+        for (const p of policiesVal.vec() ?? []) {
+            const addr = addressOf(p);
+            if (addr)
+                policyAddresses.push(addr);
+        }
+    }
+    return {
+        id,
+        contextType: decodeContextType(mapField(v, 'context_type')),
+        signers,
+        policyAddresses,
+    };
+}
+/** The interpreter's `StoredDoc { predicate_bytes }`. */
+function decodeStoredPredicateBytes(v) {
+    const field = mapField(v, 'predicate_bytes');
+    if (!field || field.switch() !== stellar_sdk_1.xdr.ScValType.scvBytes())
+        return undefined;
+    return field.bytes();
+}
+/** How far the id scan will probe before giving up. OZ imposes no per-account
+ *  rule cap, so there is no exact bound to derive; this one is far above any
+ *  realistic account and keeps a malformed `Count` from spinning forever. */
+exports.MAX_RULE_ID_SCAN = 512;
+/**
+ * Every context rule on the account, with predicates filled in for the rules
+ * our interpreter polices.
+ *
+ * Rule ids are NOT contiguous. OZ assigns them from a monotonic `NextId` and
+ * decrements `Count` on removal without ever reusing an id, so after any
+ * removal `Count < NextId` and the live ids have gaps. Iterating `0..Count-1`
+ * would silently skip live rules at higher ids, and a skipped rule is a missed
+ * overlap - the one error that reports safety which does not exist. Instead the
+ * scan walks ids upward until it has accounted for `Count` live rules.
+ *
+ * A rule whose predicate cannot be read is deliberately left without one. That
+ * demotes it to the `foreign` class, so the scan reports it as opaque instead
+ * of assuming it is narrow.
+ */
+async function collectObservedRules(args) {
+    const count = await args.reader.getContextRuleCount(args.smartAccount);
+    const limit = args.maxRuleIdScan ?? exports.MAX_RULE_ID_SCAN;
+    const rules = [];
+    const unreadablePredicateRuleIds = [];
+    let id = 0;
+    while (rules.length < count && id < limit) {
+        const raw = await args.reader.getContextRule(args.smartAccount, id);
+        id++;
+        if (!raw)
+            continue;
+        const rule = decodeContextRule(raw);
+        if (!rule)
+            continue;
+        if (rule.policyAddresses.includes(args.interpreterAddress)) {
+            const doc = await args.reader.getStoredDoc(args.interpreterAddress, args.smartAccount, rule.id);
+            const bytes = doc ? decodeStoredPredicateBytes(doc) : undefined;
+            if (bytes) {
+                try {
+                    rule.predicate = (0, decode_ts_1.decodePredicate)(bytes);
+                }
+                catch {
+                    unreadablePredicateRuleIds.push(rule.id);
+                }
+            }
+            else {
+                unreadablePredicateRuleIds.push(rule.id);
+            }
+        }
+        rules.push(rule);
+    }
+    return { rules, unreadablePredicateRuleIds, incomplete: rules.length < count };
+}
+/**
+ * An `AccountRuleReader` over a live RPC server.
+ *
+ * The two OZ getters are read-only simulations: the source account is
+ * constructed locally because a simulation never checks its sequence number,
+ * and asking the network for a random key would 404.
+ *
+ * The stored document is fetched as a ledger entry rather than a contract
+ * call, because the interpreter publishes no getter for it.
+ */
+function accountRuleReaderFromServer(server, networkPassphrase) {
+    async function simulateCall(contract, method, ...args) {
+        const account = new stellar_sdk_1.Account(stellar_sdk_1.Keypair.random().publicKey(), '0');
+        const tx = new stellar_sdk_1.TransactionBuilder(account, { fee: stellar_sdk_1.BASE_FEE, networkPassphrase })
+            .addOperation(new stellar_sdk_1.Contract(contract).call(method, ...args))
+            .setTimeout(30)
+            .build();
+        const sim = await server.simulateTransaction(tx);
+        if (stellar_sdk_1.rpc.Api.isSimulationError(sim))
+            return undefined;
+        return sim.result?.retval;
+    }
+    return {
+        async getContextRuleCount(smartAccount) {
+            const val = await simulateCall(smartAccount, 'get_context_rules_count');
+            return u32Of(val) ?? 0;
+        },
+        async getContextRule(smartAccount, ruleId) {
+            return simulateCall(smartAccount, 'get_context_rule', stellar_sdk_1.xdr.ScVal.scvU32(ruleId));
+        },
+        async getStoredDoc(interpreter, smartAccount, ruleId) {
+            const key = docLedgerKey(interpreter, smartAccount, ruleId);
+            const res = await server.getLedgerEntries(key);
+            const entry = res.entries?.[0]?.val;
+            if (!entry || entry.switch() !== stellar_sdk_1.xdr.LedgerEntryType.contractData())
+                return undefined;
+            return entry.contractData().val();
+        },
+    };
+}

package/dist-cjs/predicate/decode.js

@@ -60,6 +60,15 @@ function expectSymbol(v, what) {
         throw malformed(`${what} is not a symbol`);
     return v.sym().toString();
 }
+/** Strict i128, returned as a decimal string. Strict on purpose: the Rust
+ *  decoder refuses a u32 in an i128 slot rather than widening it, so
+ *  accepting one here would let a predicate decode off chain and be refused
+ *  on chain. */
+function expectI128(v, what) {
+    if (!v || v.switch() !== stellar_sdk_1.xdr.ScValType.scvI128())
+        throw malformed(`${what} is not an i128`);
+    return (0, stellar_sdk_1.scValToBigInt)(v).toString();
+}
 /** Arity check with the same intent as the Rust `check_arity`: a selector with
  *  the wrong element count is malformed, not silently truncated. */
 function arity(items, n, selector) {
@@ -89,6 +98,14 @@ function decodeSelectorLeaf(items, sym) {
                 element: expectU32(items[2], 'call_arg_field element'),
                 field: expectSymbol(items[3], 'call_arg_field field'),
             };
+        case 'call_arg_scaled':
+            arity(items, 4, sym);
+            return {
+                kind: 'call_arg_scaled',
+                index: expectU32(items[1], 'call_arg_scaled index'),
+                num: expectI128(items[2], 'call_arg_scaled num'),
+                den: expectI128(items[3], 'call_arg_scaled den'),
+            };
         default:
             // Deliberately NOT a literal_vec fallback - see the header note.
             throw malformed(`unknown selector symbol '${sym}'`);
@@ -125,7 +142,8 @@ function decodeNode(v) {
     if (op === null)
         throw malformed('node does not start with an operator symbol');
     switch (op) {
-        case 'and': {
+        case 'and':
+        case 'or': {
             arity(items, 2, op);
             const children = expectVec(items[1], `${op} children`).map(decodeNode);
             if (children.length === 0)
@@ -133,7 +151,10 @@ function decodeNode(v) {
             return { op, children };
         }
         case 'eq':
+        case 'lt':
         case 'lte':
+        case 'gt':
+        case 'gte':
             arity(items, 3, op);
             return {
                 op,

package/dist-cjs/predicate/encode.js

@@ -83,7 +83,8 @@ function computeStats(node) {
 }
 function walk(node, inCounts, counters) {
     switch (node.op) {
-        case 'and': {
+        case 'and':
+        case 'or': {
             if (node.children.length === 0) {
                 throw capError('MALFORMED_PREDICATE', `\`${node.op}\` with no children: the contract refuses it at decode (MALFORMED_PREDICATE), so it can never be installed`);
             }
@@ -98,7 +99,10 @@ function walk(node, inCounts, counters) {
             return { depth: maxChildDepth + 1, leaves: totalLeaves };
         }
         case 'eq':
-        case 'lte': {
+        case 'lt':
+        case 'lte':
+        case 'gt':
+        case 'gte': {
             collectSelector(node.left, counters);
             collectSelector(node.right, counters);
             return { depth: 1, leaves: leafCount(node.left) + leafCount(node.right) };
@@ -146,14 +150,20 @@ function collectSelector(leaf, counters) {
 }
 function encodeNode(node) {
     switch (node.op) {
-        case 'and': {
+        case 'and':
+        case 'or': {
             const encoded = node.children.map(encodeNode);
-            // sort children by their canonical XDR bytes ascending.
+            // sort children by their canonical XDR bytes ascending. Both operators
+            // are commutative for the permit decision, so sorting costs no meaning
+            // and buys a stable hash for logically-identical predicates.
             const sorted = sortByCanonicalBytes(encoded);
             return stellar_sdk_1.xdr.ScVal.scvVec([symbol(node.op), stellar_sdk_1.xdr.ScVal.scvVec(sorted)]);
         }
         case 'eq':
-        case 'lte': {
+        case 'lt':
+        case 'lte':
+        case 'gt':
+        case 'gte': {
             return stellar_sdk_1.xdr.ScVal.scvVec([symbol(node.op), encodeLeaf(node.left), encodeLeaf(node.right)]);
         }
         case 'in': {
@@ -184,6 +194,15 @@ function encodeLeaf(leaf) {
                 stellar_sdk_1.xdr.ScVal.scvU32(leaf.element),
                 stellar_sdk_1.xdr.ScVal.scvSymbol(leaf.field),
             ]);
+        case 'call_arg_scaled':
+            // num/den are i128 on the wire. The Rust decoder type-checks both
+            // slots, so a u32 here would be refused rather than widened.
+            return stellar_sdk_1.xdr.ScVal.scvVec([
+                symbol('call_arg_scaled'),
+                stellar_sdk_1.xdr.ScVal.scvU32(leaf.index),
+                scvI128FromDecimal(leaf.num),
+                scvI128FromDecimal(leaf.den),
+            ]);
         case 'literal_address':
             return scvAddressFromStrkey(leaf.value);
         case 'literal_i128':
@@ -269,6 +288,30 @@ function validateLeafValues(node) {
                     throw malformed(`call_arg_field.element out of u32 range at ${path}`);
                 }
                 return;
+            case 'call_arg_scaled': {
+                if (!Number.isInteger(leaf.index) || leaf.index < 0 || leaf.index > U32_MAX) {
+                    throw malformed(`call_arg_scaled.index out of u32 range at ${path}`);
+                }
+                // Mirror of the contract's install gate (214). Without it the TS
+                // self-verify would green-light a ratio the chain refuses, which is
+                // exactly the divergence this validator exists to prevent.
+                let num;
+                let den;
+                try {
+                    num = BigInt(leaf.num);
+                    den = BigInt(leaf.den);
+                }
+                catch {
+                    throw malformed(`call_arg_scaled num/den must be i128 decimal strings at ${path}`);
+                }
+                if (den === 0n) {
+                    throw malformed(`call_arg_scaled.den is zero at ${path}: the contract refuses it at install (INVALID_SCALED_RATIO)`);
+                }
+                if (num <= 0n || den < 0n) {
+                    throw malformed(`call_arg_scaled ratio ${leaf.num}/${leaf.den} at ${path} is not positive: a negative ratio inverts the comparison, so the floor would permit what it was written to refuse. The contract refuses it at install (INVALID_SCALED_RATIO)`);
+                }
+                return;
+            }
             case 'call_contract':
             case 'call_fn':
             case 'literal_address':
@@ -279,12 +322,16 @@ function validateLeafValues(node) {
     function walkNode(n, path) {
         switch (n.op) {
             case 'and':
+            case 'or':
                 n.children.forEach((c, i) => {
                     walkNode(c, `${path}.children[${i}]`);
                 });
                 return;
             case 'eq':
+            case 'lt':
             case 'lte':
+            case 'gt':
+            case 'gte':
                 walkLeaf(n.left, `${path}.left`);
                 walkLeaf(n.right, `${path}.right`);
                 return;

package/dist-cjs/predicate/from-json.js

@@ -20,9 +20,13 @@ function jsonToAst(value) {
     const v = value;
     switch (v.op) {
         case 'and':
-            return { op: 'and', children: arrayOf(v.children, jsonToAst) };
+        case 'or':
+            return { op: v.op, children: arrayOf(v.children, jsonToAst) };
         case 'eq':
+        case 'lt':
         case 'lte':
+        case 'gt':
+        case 'gte':
             return { op: v.op, left: jsonToLeaf(v.left), right: jsonToLeaf(v.right) };
         case 'in':
             return { op: 'in', needle: jsonToLeaf(v.needle), haystack: arrayOf(v.haystack, jsonToLeaf) };
@@ -47,6 +51,15 @@ function jsonToLeaf(value) {
             return { kind: 'call_arg', index: numberField(v, 'index') };
         case 'call_arg_len':
             return { kind: 'call_arg_len', index: numberField(v, 'index') };
+        case 'call_arg_scaled':
+            // num/den stay decimal STRINGS: an i128 ratio does not survive a JS
+            // number, and silently rounding one would change the floor.
+            return {
+                kind: 'call_arg_scaled',
+                index: numberField(v, 'index'),
+                num: stringField(v, 'num'),
+                den: stringField(v, 'den'),
+            };
         case 'literal_address':
             return { kind: 'literal_address', value: stringField(v, 'value') };
         case 'literal_i128':

package/dist-cjs/review-card/builder.js

@@ -84,15 +84,31 @@ function walkPredicate(node, visit) {
             for (const child of node.children)
                 walkPredicate(child, visit);
             return;
+        // NOT descended into. Every line the card emits reads as a requirement,
+        // and `and` is what makes that true. Listing an `or`'s branches as
+        // separate lines would state the opposite of what the policy means, so
+        // the whole disjunction is rendered as ONE line instead.
+        case 'or':
+            visit(node);
+            return;
         case 'in':
             visit(node);
             return;
         case 'eq':
+        case 'lt':
         case 'lte':
+        case 'gt':
+        case 'gte':
             visit(node);
             return;
     }
 }
+/** Argument index of a `call_arg` leaf, for the scaled-comparison line. Any
+ *  other leaf renders as its kind so the line stays readable rather than
+ *  claiming an index that does not exist. */
+function leftArgLabel(leaf) {
+    return leaf.kind === 'call_arg' ? String(leaf.index) : `<${leaf.kind}>`;
+}
 /** Render ONE constraint sentence for ONE interpreter predicate node. The
  *  shape of the output is pinned by Task 7b so the test suite can assert
  *  byte-for-byte equality. Returns `null` when the node is a structural
@@ -101,14 +117,38 @@ function renderConstraint(node) {
     switch (node.op) {
         case 'and':
             return null;
+        case 'or': {
+            // One line for the whole disjunction. If any branch is a shape the
+            // card cannot render, the entire line is withheld rather than shown
+            // with a branch missing - a disjunction with a branch dropped reads
+            // as STRICTER than it is, which is the dangerous direction.
+            const parts = node.children.map(renderConstraint);
+            if (parts.some((p) => p === null))
+                return null;
+            return `Either: ${parts.join(' OR ')}`;
+        }
         case 'eq':
+        case 'lt':
         case 'lte':
+        case 'gt':
+        case 'gte':
             return renderComparison(node);
         case 'in':
             return renderMembership(node);
     }
 }
 function renderComparison(node) {
+    // The slippage floor: OP(call_arg[out], call_arg_scaled(in, num, den)).
+    // Rendered explicitly because the human approving the signature has to see
+    // that the bound is a RATIO of another argument, not a fixed amount.
+    if (node.right.kind === 'call_arg_scaled') {
+        const s = node.right;
+        return `arg[${leftArgLabel(node.left)}] ${(0, render_leaf_ts_1.comparisonOpText)(node.op)} arg[${s.index}] * ${s.num}/${s.den}`;
+    }
+    if (node.left.kind === 'call_arg_scaled') {
+        const s = node.left;
+        return `arg[${s.index}] * ${s.num}/${s.den} ${(0, render_leaf_ts_1.comparisonOpText)(node.op)} arg[${leftArgLabel(node.right)}]`;
+    }
     const left = node.left;
     const right = node.right;
     // eq(call_contract, literal_address) -> Contract must be <addr>

package/dist-cjs/review-card/cross-check.js

@@ -42,8 +42,30 @@ function collect(node, out) {
             for (const child of node.children)
                 collect(child, out);
             return;
+        // ONE line for the whole disjunction, mirroring the builder. Emitting a
+        // line per branch would claim every branch is required, which is the
+        // opposite of what `or` means. If any branch renders to nothing the whole
+        // line is withheld, again mirroring the builder - a disjunction missing a
+        // branch reads STRICTER than it is.
+        case 'or': {
+            const parts = [];
+            for (const child of node.children) {
+                const childOut = [];
+                collect(child, childOut);
+                if (childOut.length !== 1)
+                    return;
+                parts.push(childOut[0]);
+            }
+            if (parts.length === 0)
+                return;
+            out.push(`Either: ${parts.join(' OR ')}`);
+            return;
+        }
         case 'eq':
+        case 'lt':
         case 'lte':
+        case 'gt':
+        case 'gte':
             pushComparison(node.left, node.right, node.op, out);
             return;
         case 'in':
@@ -52,6 +74,18 @@ function collect(node, out) {
     }
 }
 function pushComparison(left, right, op, out) {
+    // Slippage floor, mirroring the builder. The human has to see that the
+    // bound is a RATIO of another argument, not a fixed amount.
+    if (right.kind === 'call_arg_scaled') {
+        const label = left.kind === 'call_arg' ? String(left.index) : `<${left.kind}>`;
+        out.push(`arg[${label}] ${(0, render_leaf_ts_1.comparisonOpText)(op)} arg[${right.index}] * ${right.num}/${right.den}`);
+        return;
+    }
+    if (left.kind === 'call_arg_scaled') {
+        const label = right.kind === 'call_arg' ? String(right.index) : `<${right.kind}>`;
+        out.push(`arg[${left.index}] * ${left.num}/${left.den} ${(0, render_leaf_ts_1.comparisonOpText)(op)} arg[${label}]`);
+        return;
+    }
     if (left.kind === 'call_contract' && op === 'eq' && right.kind === 'literal_address') {
         out.push(`Contract must be ${right.value}`);
         return;

package/dist-cjs/review-card/render-leaf.d.ts

@@ -1,4 +1,4 @@
 import type { PredicateLeaf } from '../types.ts';
 export declare function renderVecElement(leaf: PredicateLeaf): string;
 export declare function renderHaystackElement(leaf: PredicateLeaf): string;
-export declare function comparisonOpText(op: 'eq' | 'lte'): string;
+export declare function comparisonOpText(op: 'eq' | 'lt' | 'lte' | 'gt' | 'gte'): string;

package/dist-cjs/review-card/render-leaf.js

@@ -25,6 +25,7 @@ function renderVecElement(leaf) {
         case 'call_arg':
         case 'call_arg_len':
         case 'call_arg_field':
+        case 'call_arg_scaled':
             return `<${leaf.kind}>`;
     }
 }
@@ -44,8 +45,14 @@ function renderHaystackElement(leaf) {
 }
 function comparisonOpText(op) {
     switch (op) {
+        case 'lt':
+            return '<';
         case 'lte':
             return '<=';
+        case 'gt':
+            return '>';
+        case 'gte':
+            return '>=';
         case 'eq':
             return '==';
     }