@wowok/agent-mcp 2.7.1 → 2.7.3

package/dist/knowledge/machine-translation.js

@@ -1,513 +1 @@
-export const SEMANTIC_TO_MACHINE_RULES = [
-    {
-        id: "P-M-SEQ",
-        pattern_name: "Sequential Execution",
-        category: "execution",
-        semantic_intent: "Single actor advances workflow one step at a time. Each Pair has threshold=1 with a single Forward weight=1.",
-        match_keywords: ["sequential", "linear", "one step at a time"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: "dynamic",
-            structure: "Each Pair: { threshold: 1, forwards: [{ name, weight: 1, namedOperator | permissionIndex }] }",
-        },
-        constraints: [
-            "Each Forward must have at least one of namedOperator or permissionIndex",
-            "weight > 0 (typically 1)",
-            "prev_node references must form a valid DAG (no cycles)",
-        ],
-        example: {
-            pair: {
-                prev_node: "NodeA",
-                next_node: "NodeB",
-                threshold: 1,
-                forwards: [{ name: "Advance", weight: 1, named_operator: "" }],
-            },
-        },
-    },
-    {
-        id: "P-M-AND",
-        pattern_name: "Parallel AND (Dual-Signature Consensus)",
-        category: "execution",
-        semantic_intent: "Multiple parties must ALL contribute to advance. Pair threshold=N with N Forwards (weight=1 each). All must execute.",
-        match_keywords: ["and", "all", "dual-sig", "both confirm", "both must"],
-        schema_elements: {
-            threshold: 2,
-            forward_count: 2,
-            permission_model: "mixed",
-            pair_count: 1,
-            structure: "Pair: { threshold: N, forwards: [{ weight: 1, namedOperator: '' }, { weight: 1, permissionIndex: 2 }] }",
-        },
-        constraints: [
-            "threshold must equal the number of required Forwards",
-            "Each Forward must have a distinct permission model (no two identical)",
-            "If either party fails to sign, workflow stalls — consider adding timeout Guard",
-            "Each Forward counted once per session (repeated execution adds no weight)",
-        ],
-        example: {
-            pair: {
-                prev_node: "Initiated",
-                next_node: "Approved",
-                threshold: 2,
-                forwards: [
-                    { name: "CustomerApprove", weight: 1, named_operator: "" },
-                    { name: "MerchantApprove", weight: 1, permission_index: 2 },
-                ],
-            },
-        },
-    },
-    {
-        id: "P-M-OR",
-        pattern_name: "Parallel OR (Any-One Execution)",
-        category: "execution",
-        semantic_intent: "Any one of multiple paths can advance the workflow. Multiple Pairs, each threshold=1.",
-        match_keywords: ["or", "any", "either"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: "dynamic",
-            structure: "Multiple Pairs from same prev_node, each with threshold=1",
-        },
-        constraints: [
-            "Distinct next_node for each Pair (or distinct Forward)",
-            "If targets are different nodes, this becomes COMPETING topology",
-            "If targets are same node, alternative paths converge (FORKMERGE)",
-        ],
-        example: {
-            pairs: [
-                {
-                    prev_node: "Choice",
-                    next_node: "PathA",
-                    threshold: 1,
-                    forwards: [{ name: "ChooseA", weight: 1, named_operator: "" }],
-                },
-                {
-                    prev_node: "Choice",
-                    next_node: "PathB",
-                    threshold: 1,
-                    forwards: [{ name: "ChooseB", weight: 1, named_operator: "" }],
-                },
-            ],
-        },
-    },
-    {
-        id: "P-M-VOTE",
-        pattern_name: "Weighted Voting",
-        category: "execution",
-        semantic_intent: "Multiple parties vote with unequal weights. threshold=100, varied weights (e.g. 60+40). " +
-            "Guard extracts weight dynamically from Arbitration object.",
-        match_keywords: ["vote", "weight", "stakeholder"],
-        schema_elements: {
-            threshold: 100,
-            forward_count: "dynamic",
-            permission_model: "mixed",
-            pair_count: 1,
-            structure: "Pair: { threshold: 100, forwards: [{ weight: 60, permissionIndex: 2, guard: arb_voting_guard }, { weight: 8, namedOperator: 'member', guard: arb_voting_guard }] }",
-        },
-        constraints: [
-            "Guard MUST check arb.voted has [Signer] to prevent double-voting (R-X1-14 CRITICAL)",
-            "Weight is query-derived from Arbitration object (not hardcoded in Forward)",
-            "Competing Pair often added: Approved vs Rejected (timeout) — first-wins",
-            "Forward weight field is just session counter; actual weight from Guard",
-        ],
-        example: {
-            pair: {
-                prev_node: "Voting",
-                next_node: "Approved",
-                threshold: 100,
-                forwards: [
-                    { name: "ChiefVote", weight: 60, permission_index: 2, guard: "arb_voting_guard" },
-                    { name: "MemberVote", weight: 8, named_operator: "member", guard: "arb_voting_guard" },
-                ],
-            },
-        },
-    },
-    {
-        id: "P-M-HYBRID",
-        pattern_name: "Hybrid Mode (Key Party Required + Others Optional)",
-        category: "execution",
-        semantic_intent: "One key party must contribute, others are optional. threshold=5 with mixed weights (3+1+1).",
-        match_keywords: ["hybrid", "mixed", "key party"],
-        schema_elements: {
-            threshold: 5,
-            forward_count: 3,
-            permission_model: "mixed",
-            pair_count: 1,
-            structure: "Pair: { threshold: 5, forwards: [{ weight: 3, permissionIndex: 2 (key) }, { weight: 1, namedOperator: 'role1' }, { weight: 1, namedOperator: 'role2' }] }",
-        },
-        constraints: [
-            "Key party's weight must alone be insufficient (otherwise optional parties are meaningless)",
-            "Total weight of all Forwards must be >= threshold",
-            "Each Forward must have distinct permission model",
-        ],
-        example: {
-            pair: {
-                prev_node: "Review",
-                next_node: "Approved",
-                threshold: 5,
-                forwards: [
-                    { name: "ManagerApprove", weight: 3, permission_index: 2 },
-                    { name: "EngineerApprove", weight: 1, named_operator: "engineer" },
-                    { name: "QAApprove", weight: 1, named_operator: "qa" },
-                ],
-            },
-        },
-    },
-    {
-        id: "P-M-LINEAR",
-        pattern_name: "Linear Flow (No Branches)",
-        category: "topology",
-        semantic_intent: "Workflow progresses in a straight line with no branches.",
-        match_keywords: ["linear", "straight", "no branches"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: "dynamic",
-            structure: "Chain of Pairs: A->B->C->D->...->Terminal",
-        },
-        constraints: [
-            "Exactly one entry Pair (prev_node='')",
-            "Exactly one terminal node (no outgoing Pairs)",
-            "Each non-terminal node has exactly one outgoing Pair",
-        ],
-        example: {
-            topology: "Entry -> A -> B -> C -> Terminal",
-        },
-    },
-    {
-        id: "P-M-FORKMERGE",
-        pattern_name: "Fork-Merge (Parallel Branches Converging)",
-        category: "topology",
-        semantic_intent: "Main flow forks into multiple parallel branches, then merges back to main flow.",
-        match_keywords: ["fork", "merge", "parallel"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: "dynamic",
-            permission_model: "mixed",
-            pair_count: "dynamic",
-            structure: "ForkNode -> {BranchA, BranchB} -> MergeNode",
-        },
-        constraints: [
-            "Multiple Pairs from ForkNode (one per branch)",
-            "All branches must eventually reach MergeNode",
-            "MergeNode has multiple incoming Pairs (merge point)",
-            "Threshold at MergeNode determines if all branches must complete or just some",
-        ],
-        example: {
-            topology: "ForkNode -> BranchA -> MergeNode; ForkNode -> BranchB -> MergeNode",
-        },
-    },
-    {
-        id: "P-M-COMPETING",
-        pattern_name: "Competing Pairs (Mutually Exclusive Branches)",
-        category: "topology",
-        semantic_intent: "Multiple Pairs from same node compete; first Pair to meet threshold wins, others abandoned.",
-        match_keywords: ["competing", "exclusive", "race"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: "dynamic",
-            structure: "Same prev_node -> multiple next_nodes (each Pair independent)",
-        },
-        constraints: [
-            "Mutually exclusive — only one Pair can complete per session",
-            "First Pair to reach threshold wins",
-            "Other incomplete Pairs are abandoned",
-            "Verify no dead branches (a Pair that always loses to another)",
-        ],
-        example: {
-            topology: "Shipped -> Received; Shipped -> Lost; Shipped -> Return (first wins)",
-        },
-    },
-    {
-        id: "P-M-PERM-SINGLE",
-        pattern_name: "Single Permission",
-        category: "permission",
-        semantic_intent: "Forward uses only one permission type: namedOperator OR permissionIndex.",
-        match_keywords: ["single permission"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: 1,
-            structure: "Forward: { name, weight: 1, namedOperator: '<role>' | permissionIndex: <index> } (only one set)",
-        },
-        constraints: [
-            "Either namedOperator or permissionIndex is set (not both)",
-            "Empty namedOperator='' grants OrderHolder (order owner + agents)",
-        ],
-        example: {
-            forward: { name: "Ship", weight: 1, permission_index: 2 },
-        },
-    },
-    {
-        id: "P-M-PERM-MIXED",
-        pattern_name: "Mixed Permission (Either-Or)",
-        category: "permission",
-        semantic_intent: "Forward allows EITHER permission to execute (internal staff OR external roles).",
-        match_keywords: ["mixed permission", "either"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "mixed",
-            pair_count: 1,
-            structure: "Forward: { name, weight: 1, namedOperator: '<role>', permissionIndex: <index> } (both set)",
-        },
-        constraints: [
-            "Both namedOperator and permissionIndex are set",
-            "Executor needs EITHER permission — passing either check is sufficient",
-            "Use case: allow internal staff OR external role to execute the same Forward",
-        ],
-        example: {
-            forward: { name: "Confirm", weight: 1, named_operator: "auditor", permission_index: 2 },
-        },
-    },
-    {
-        id: "P-M-CROSS-MACHINE",
-        pattern_name: "Cross-Machine Dependency",
-        category: "integration",
-        semantic_intent: "Machine B's Forward Guard queries Machine A's Progress to verify upstream completion.",
-        match_keywords: ["cross-machine", "supply chain", "upstream"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: 1,
-            structure: "Forward: { guard: 'upstream_progress_guard', retained_submission: 'upstream_progress_id' }",
-        },
-        constraints: [
-            "Machine A MUST be published before Machine B (dependency order)",
-            "Guard uses convert_witness=100 to convert submitted Order/Progress ID into queryable Progress",
-            "Cross-Machine dependency is one-way (no cycles)",
-            "Dependency verification: indirect via progress::new -> assert_published (see 06 §14.6)",
-            "retained_submission stores upstream Progress ID for audit",
-        ],
-        example: {
-            forward: {
-                name: "VerifyUpstream",
-                weight: 1,
-                permission_index: 2,
-                guard: "upstream_progress_guard",
-                retained_submission: "upstream_progress_id",
-            },
-        },
-    },
-    {
-        id: "P-M-ALLOCATION-INTEGRATED",
-        pattern_name: "Allocation-Integrated Terminal",
-        category: "integration",
-        semantic_intent: "Terminal node triggers Allocator to distribute funds. Allocation independent of Machine flow.",
-        match_keywords: ["allocation", "fund distribution", "terminal"],
-        schema_elements: {
-            threshold: 1,
-            forward_count: 1,
-            permission_model: "single",
-            pair_count: 1,
-            structure: "Terminal node -> Allocator entry (configured on Service order_allocators)",
-        },
-        constraints: [
-            "Terminal node must be referenced in Service order_allocators",
-            "Allocator Guard verifies progress.current == terminal_node_name",
-            "sharing.who determines fund recipient (Entity / OrderHolder / etc.)",
-            "Multiple Allocators can fire on different terminal nodes",
-        ],
-        example: {
-            terminal_node: "Complete",
-            allocator: { trigger_node: "Complete", sharing_who: "Entity", recipient: "merchant_treasury" },
-        },
-    },
-];
-export const NODE_FIELD_EXPLANATIONS = [
-    { field: "name", type: "string", required: true, semantic: "Node name (unique identifier)", constraint: "<=64 BCS bytes, globally unique" },
-    { field: "description", type: "string", required: false, semantic: "Human-readable description", constraint: "<=MAX_DESCRIPTION_LENGTH" },
-    { field: "b_pause", type: "boolean", required: false, semantic: "Whether node is paused (blocks execution)", constraint: "Default false" },
-    { field: "b_submission", type: "boolean", required: false, semantic: "Whether submission is allowed at this node", constraint: "Used for retained_submission storage" },
-];
-export const PAIR_FIELD_EXPLANATIONS = [
-    { field: "prev_node", type: "string", required: true, semantic: "Source node (empty '' = entry point)", constraint: "Must reference existing node or ''" },
-    { field: "next_node", type: "string", required: true, semantic: "Target node", constraint: "Must reference existing node" },
-    { field: "threshold", type: "number", required: true, semantic: "Required total forward weight to advance", constraint: ">=0, typically 1-100" },
-    { field: "forwards", type: "array<Forward>", required: true, semantic: "List of Forwards in this Pair", constraint: "1-20 Forwards per Pair" },
-];
-export const FORWARD_FIELD_EXPLANATIONS = [
-    { field: "name", type: "string", required: true, semantic: "Forward name (unique within Pair)", constraint: "<=64 BCS bytes, unique within Pair" },
-    { field: "weight", type: "number", required: true, semantic: "Weight contribution to threshold", constraint: ">0, typically 1-100" },
-    { field: "namedOperator", type: "string (optional)", required: false, semantic: "Named operator role ('' = OrderHolder)", constraint: "Optional, but Forward needs at least one permission" },
-    { field: "permissionIndex", type: "number (optional)", required: false, semantic: "Permission index (custom or builtin)", constraint: "< Permission.indices.length" },
-    { field: "guard", type: "address (optional)", required: false, semantic: "Guard object address for validation", constraint: "Must be CREATE-only Guard, already created" },
-    { field: "retained_submission", type: "string (optional)", required: false, semantic: "Key for storing submitted values in history", constraint: "Uniquely located by (current_node, next_node, forward_name)" },
-];
-export function identifyExecutionMode(pair) {
-    const { threshold, forwards } = pair;
-    const fwdCount = forwards.length;
-    if (threshold === 1 && fwdCount === 1) {
-        return "P-M-SEQ (Sequential)";
-    }
-    if (threshold === fwdCount && fwdCount >= 2) {
-        const hasMixed = forwards.some((f) => f.permission_index !== undefined) &&
-            forwards.some((f) => f.named_operator !== undefined);
-        return hasMixed ? "P-M-AND (Parallel AND / Dual-Signature)" : "P-M-AND (Parallel AND)";
-    }
-    if (threshold === 100 && forwards.some((f) => f.weight < 50 && f.weight > 0)) {
-        return "P-M-VOTE (Weighted Voting)";
-    }
-    if (threshold < fwdCount && threshold > 1) {
-        return "P-M-HYBRID (Hybrid Mode)";
-    }
-    if (threshold === 1 && fwdCount >= 1) {
-        return "P-M-OR (Parallel OR) or P-M-SEQ (if single Forward)";
-    }
-    return "Unknown (manual review needed)";
-}
-export function identifyTopology(pairs) {
-    const fromNode = new Map();
-    const toNode = new Map();
-    for (const p of pairs) {
-        if (!fromNode.has(p.prev_node))
-            fromNode.set(p.prev_node, []);
-        fromNode.get(p.prev_node).push(p.next_node);
-        if (!toNode.has(p.next_node))
-            toNode.set(p.next_node, []);
-        toNode.get(p.next_node).push(p.prev_node);
-    }
-    for (const [prev, nexts] of fromNode) {
-        if (nexts.length > 1 && prev !== "") {
-            return "P-M-COMPETING (Competing Pairs)";
-        }
-    }
-    for (const [next, prevs] of toNode) {
-        if (prevs.length > 1) {
-            return "P-M-FORKMERGE (Fork-Merge)";
-        }
-    }
-    return "P-M-LINEAR (Linear Flow)";
-}
-export function matchSemanticPattern(intent) {
-    const lower = intent.toLowerCase();
-    return SEMANTIC_TO_MACHINE_RULES.find((rule) => rule.match_keywords.some((kw) => lower.includes(kw.toLowerCase())));
-}
-export function explainForwardPermission(forward) {
-    const hasNamed = forward.named_operator !== undefined && forward.named_operator !== null;
-    const hasPerm = forward.permission_index !== undefined && forward.permission_index !== null;
-    if (hasNamed && hasPerm) {
-        const role = forward.named_operator === "" ? "OrderHolder" : `role "${forward.named_operator}"`;
-        return `Mixed permission: ${role} OR Permission index ${forward.permission_index} (either sufficient)`;
-    }
-    if (hasNamed) {
-        if (forward.named_operator === "") {
-            return "OrderHolder (order owner + agents)";
-        }
-        return `NamedOperator role "${forward.named_operator}"`;
-    }
-    if (hasPerm) {
-        return `Permission index ${forward.permission_index}`;
-    }
-    return "❌ INVALID: no permission set (Forward must have at least one of namedOperator or permissionIndex)";
-}
-export const MACHINE_CONSTRAINT_RULES = [
-    { id: "MC-C-01", name: `Node count <= ${MAX_NODE_COUNT}`, description: "MAX_NODE_COUNT", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-02", name: `Pair count per node <= ${MAX_NODE_PAIR_COUNT}`, description: "MAX_NODE_PAIR_COUNT", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-03", name: `Forward count per Pair <= ${MAX_FORWARD_COUNT}`, description: "MAX_FORWARD_COUNT", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-04", name: "Node name unique", description: "name globally unique", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-05", name: "Forward name unique within Pair", description: "name unique within Pair", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-06", name: "Node name <= 64 BCS bytes", description: "MAX_NAME_LENGTH", category: "creation", verification_location: "common.ts", on_chain_enforced: true },
-    { id: "MC-C-07", name: "Forward has at least one permission", description: "namedOperator or permissionIndex", category: "creation", verification_location: "wowok-machine SKILL", on_chain_enforced: false },
-    { id: "MC-C-08", name: "permissionIndex valid", description: "< Permission.indices.length", category: "creation", verification_location: "permission.move", on_chain_enforced: true },
-    { id: "MC-C-09", name: "Guard already created", description: "guard field references existing Guard", category: "creation", verification_location: "guard.move", on_chain_enforced: true },
-    { id: "MC-C-10", name: "Guard immutable", description: "Guard.b_immutable == true", category: "creation", verification_location: "guard.move", on_chain_enforced: true },
-    { id: "MC-C-11", name: "retained_submission index valid", description: "Corresponds to Guard table b_submission=true", category: "creation", verification_location: "guard.move", on_chain_enforced: true },
-    { id: "MC-C-12", name: "prev_node references valid", description: "Points to existing node or ''", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-13", name: "threshold >= 0", description: "Non-negative", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-14", name: "weight > 0", description: "Positive", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-15", name: "description length", description: "<= MAX_DESCRIPTION_LENGTH", category: "creation", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-C-16", name: "bReplace scope", description: "Acts on existing node's pairs list, not whole Machine", category: "node_operation", verification_location: "machine.move:405-443", on_chain_enforced: true },
-    { id: "MC-C-17", name: "bReplace=false merge semantics", description: "Incremental merge by prev_node into existing pairs", category: "node_operation", verification_location: "machine.move:418-443", on_chain_enforced: true },
-    { id: "MC-C-18", name: "Non-existing node append", description: "push_back new node (no clear triggered)", category: "node_operation", verification_location: "machine.move:418-443", on_chain_enforced: true },
-    { id: "MC-C-19", name: "Full node replacement via file entry", description: "NodeJsonOrMarkdownFileSchema (not bReplace=true)", category: "node_operation", verification_location: "machine.ts:93-112", on_chain_enforced: false },
-    { id: "MC-S-01", name: "At least one entry point", description: "Pair with prev_node=''", category: "structure", verification_location: "machine-topology.ts", on_chain_enforced: false },
-    { id: "MC-S-02", name: "At least one terminal", description: "Node with no outgoing Pairs", category: "structure", verification_location: "machine-topology.ts", on_chain_enforced: false },
-    { id: "MC-S-03", name: "No orphaned nodes", description: "All non-entry nodes have incoming Pair", category: "structure", verification_location: "machine-topology.ts", on_chain_enforced: false },
-    { id: "MC-S-04", name: "No dead branches", description: "All thresholds achievable", category: "structure", verification_location: "machine-topology.ts", on_chain_enforced: false },
-    { id: "MC-S-05", name: "DAG acyclic", description: "No cycle references", category: "structure", verification_location: "machine-topology.ts", on_chain_enforced: false },
-    { id: "MC-P-01", name: "All Guards tested", description: "gen_passport passed", category: "publish", verification_location: "machine-confirm.ts", on_chain_enforced: false },
-    { id: "MC-P-02", name: "Backup exported", description: "machineNode2file executed", category: "publish", verification_location: "machine-confirm.ts", on_chain_enforced: false },
-    { id: "MC-P-03", name: "Testnet verified", description: "(recommended) testnet passed", category: "publish", verification_location: "machine-confirm.ts", on_chain_enforced: false },
-    { id: "MC-P-04", name: "User 100% confirmed", description: "ConfirmGate passed", category: "publish", verification_location: "machine-confirm.ts", on_chain_enforced: false },
-    { id: "MC-P-05", name: "Service created (if bound)", description: "Service exists", category: "publish", verification_location: "machine-context.ts", on_chain_enforced: false },
-    { id: "MC-R-01", name: "Node ops fail after publish", description: "E_ALREADY_PUBLISHED", category: "runtime", verification_location: "machine.move", on_chain_enforced: true },
-    { id: "MC-R-02", name: "Session accumulation correct", description: "weight accumulation logic", category: "runtime", verification_location: "progress.move", on_chain_enforced: true },
-    { id: "MC-R-03", name: "Competing Pair first-wins", description: "First Pair to reach threshold wins", category: "runtime", verification_location: "progress.move", on_chain_enforced: true },
-];
-export function getConstraintsByCategory(category) {
-    return MACHINE_CONSTRAINT_RULES.filter((r) => r.category === category);
-}
-export function getConstraintById(id) {
-    return MACHINE_CONSTRAINT_RULES.find((r) => r.id === id);
-}
-export function getOnChainConstraints() {
-    return MACHINE_CONSTRAINT_RULES.filter((r) => r.on_chain_enforced);
-}
-export function getOffChainConstraints() {
-    return MACHINE_CONSTRAINT_RULES.filter((r) => !r.on_chain_enforced);
-}
-export const MACHINE_TRANSLATION_VERSION = "1.0.0";
-export const MACHINE_PATTERNS_COUNT = SEMANTIC_TO_MACHINE_RULES.length;
-export const MACHINE_CONSTRAINTS_COUNT = MACHINE_CONSTRAINT_RULES.length;
-import { MAX_NODE_COUNT, MAX_NODE_PAIR_COUNT, MAX_FORWARD_COUNT, } from "./onchain-constants.js";
-export function identifyNodeRole(node) {
-    const allPairs = node.all_pairs ?? [];
-    const outgoing = (node.pairs ?? allPairs).filter((p) => p.prev_node === node.name);
-    const incoming = allPairs.filter((p) => p.next_node === node.name);
-    const isEntry = allPairs.some((p) => p.prev_node === "" && p.next_node === node.name);
-    const isTerminal = outgoing.length === 0;
-    if (isEntry)
-        return "entry";
-    if (isTerminal)
-        return "terminal";
-    const nextNodes = new Set(outgoing.map((p) => p.next_node));
-    if (nextNodes.size > 1)
-        return "branch";
-    const prevNodes = new Set(incoming.map((p) => p.prev_node).filter((n) => n !== ""));
-    if (prevNodes.size > 1)
-        return "merge";
-    return "normal";
-}
-function explainGuardBinding(guardAddress) {
-    return {
-        address: guardAddress,
-        immutable_required: true,
-        note: `Guard ${guardAddress} validates this Forward's execution; ` +
-            `must be immutable (b_immutable=true) and pre-created on-chain.`,
-    };
-}
-export function explainNode(node) {
-    const outgoingPairs = node.pairs ?? [];
-    return {
-        name: node.name,
-        role: identifyNodeRole(node),
-        pairs: outgoingPairs.map((p) => explainPair(p)),
-        description: node.description,
-    };
-}
-export function explainPair(pair) {
-    return {
-        prev_node: pair.prev_node,
-        next_node: pair.next_node,
-        threshold: pair.threshold,
-        execution_pattern: identifyExecutionMode(pair),
-        forwards: pair.forwards.map((f) => explainForward(f)),
-    };
-}
-export function explainForward(forward) {
-    return {
-        name: forward.name,
-        permission: explainForwardPermission(forward),
-        weight: forward.weight,
-        guard: forward.guard ? explainGuardBinding(forward.guard) : null,
-        retained_submission: forward.retained_submission ?? null,
-    };
-}
+export const SEMANTIC_TO_MACHINE_RULES=[{'id':'P-M-SEQ','pattern_name':'Sequential\x20Execution','category':'execution','semantic_intent':'Single\x20actor\x20advances\x20workflow\x20one\x20step\x20at\x20a\x20time.\x20Each\x20Pair\x20has\x20threshold=1\x20with\x20a\x20single\x20Forward\x20weight=1.','match_keywords':['sequential','linear','one\x20step\x20at\x20a\x20time'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':'dynamic','structure':'Each\x20Pair:\x20{\x20threshold:\x201,\x20forwards:\x20[{\x20name,\x20weight:\x201,\x20namedOperator\x20|\x20permissionIndex\x20}]\x20}'},'constraints':['Each\x20Forward\x20must\x20have\x20at\x20least\x20one\x20of\x20namedOperator\x20or\x20permissionIndex','weight\x20>\x200\x20(typically\x201)','prev_node\x20references\x20must\x20form\x20a\x20valid\x20DAG\x20(no\x20cycles)'],'example':{'pair':{'prev_node':'NodeA','next_node':'NodeB','threshold':0x1,'forwards':[{'name':'Advance','weight':0x1,'named_operator':''}]}}},{'id':'P-M-AND','pattern_name':'Parallel\x20AND\x20(Dual-Signature\x20Consensus)','category':'execution','semantic_intent':'Multiple\x20parties\x20must\x20ALL\x20contribute\x20to\x20advance.\x20Pair\x20threshold=N\x20with\x20N\x20Forwards\x20(weight=1\x20each).\x20All\x20must\x20execute.','match_keywords':['and','all','dual-sig','both\x20confirm','both\x20must'],'schema_elements':{'threshold':0x2,'forward_count':0x2,'permission_model':'mixed','pair_count':0x1,'structure':'Pair:\x20{\x20threshold:\x20N,\x20forwards:\x20[{\x20weight:\x201,\x20namedOperator:\x20\x27\x27\x20},\x20{\x20weight:\x201,\x20permissionIndex:\x202\x20}]\x20}'},'constraints':['threshold\x20must\x20equal\x20the\x20number\x20of\x20required\x20Forwards','Each\x20Forward\x20must\x20have\x20a\x20distinct\x20permission\x20model\x20(no\x20two\x20identical)','If\x20either\x20party\x20fails\x20to\x20sign,\x20workflow\x20stalls\x20—\x20consider\x20adding\x20timeout\x20Guard','Each\x20Forward\x20counted\x20once\x20per\x20session\x20(repeated\x20execution\x20adds\x20no\x20weight)'],'example':{'pair':{'prev_node':'Initiated','next_node':'Approved','threshold':0x2,'forwards':[{'name':'CustomerApprove','weight':0x1,'named_operator':''},{'name':'MerchantApprove','weight':0x1,'permission_index':0x2}]}}},{'id':'P-M-OR','pattern_name':'Parallel\x20OR\x20(Any-One\x20Execution)','category':'execution','semantic_intent':'Any\x20one\x20of\x20multiple\x20paths\x20can\x20advance\x20the\x20workflow.\x20Multiple\x20Pairs,\x20each\x20threshold=1.','match_keywords':['or','any','either'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':'dynamic','structure':'Multiple\x20Pairs\x20from\x20same\x20prev_node,\x20each\x20with\x20threshold=1'},'constraints':['Distinct\x20next_node\x20for\x20each\x20Pair\x20(or\x20distinct\x20Forward)','If\x20targets\x20are\x20different\x20nodes,\x20this\x20becomes\x20COMPETING\x20topology','If\x20targets\x20are\x20same\x20node,\x20alternative\x20paths\x20converge\x20(FORKMERGE)'],'example':{'pairs':[{'prev_node':'Choice','next_node':'PathA','threshold':0x1,'forwards':[{'name':'ChooseA','weight':0x1,'named_operator':''}]},{'prev_node':'Choice','next_node':'PathB','threshold':0x1,'forwards':[{'name':'ChooseB','weight':0x1,'named_operator':''}]}]}},{'id':'P-M-VOTE','pattern_name':'Weighted\x20Voting','category':'execution','semantic_intent':'Multiple\x20parties\x20vote\x20with\x20unequal\x20weights.\x20threshold=100,\x20varied\x20weights\x20(e.g.\x2060+40).\x20'+'Guard\x20extracts\x20weight\x20dynamically\x20from\x20Arbitration\x20object.','match_keywords':['vote','weight','stakeholder'],'schema_elements':{'threshold':0x64,'forward_count':'dynamic','permission_model':'mixed','pair_count':0x1,'structure':'Pair:\x20{\x20threshold:\x20100,\x20forwards:\x20[{\x20weight:\x2060,\x20permissionIndex:\x202,\x20guard:\x20arb_voting_guard\x20},\x20{\x20weight:\x208,\x20namedOperator:\x20\x27member\x27,\x20guard:\x20arb_voting_guard\x20}]\x20}'},'constraints':['Guard\x20MUST\x20check\x20arb.voted\x20has\x20[Signer]\x20to\x20prevent\x20double-voting\x20(R-X1-14\x20CRITICAL)','Weight\x20is\x20query-derived\x20from\x20Arbitration\x20object\x20(not\x20hardcoded\x20in\x20Forward)','Competing\x20Pair\x20often\x20added:\x20Approved\x20vs\x20Rejected\x20(timeout)\x20—\x20first-wins','Forward\x20weight\x20field\x20is\x20just\x20session\x20counter;\x20actual\x20weight\x20from\x20Guard'],'example':{'pair':{'prev_node':'Voting','next_node':'Approved','threshold':0x64,'forwards':[{'name':'ChiefVote','weight':0x3c,'permission_index':0x2,'guard':'arb_voting_guard'},{'name':'MemberVote','weight':0x8,'named_operator':'member','guard':'arb_voting_guard'}]}}},{'id':'P-M-HYBRID','pattern_name':'Hybrid\x20Mode\x20(Key\x20Party\x20Required\x20+\x20Others\x20Optional)','category':'execution','semantic_intent':'One\x20key\x20party\x20must\x20contribute,\x20others\x20are\x20optional.\x20threshold=5\x20with\x20mixed\x20weights\x20(3+1+1).','match_keywords':['hybrid','mixed','key\x20party'],'schema_elements':{'threshold':0x5,'forward_count':0x3,'permission_model':'mixed','pair_count':0x1,'structure':'Pair:\x20{\x20threshold:\x205,\x20forwards:\x20[{\x20weight:\x203,\x20permissionIndex:\x202\x20(key)\x20},\x20{\x20weight:\x201,\x20namedOperator:\x20\x27role1\x27\x20},\x20{\x20weight:\x201,\x20namedOperator:\x20\x27role2\x27\x20}]\x20}'},'constraints':['Key\x20party\x27s\x20weight\x20must\x20alone\x20be\x20insufficient\x20(otherwise\x20optional\x20parties\x20are\x20meaningless)','Total\x20weight\x20of\x20all\x20Forwards\x20must\x20be\x20>=\x20threshold','Each\x20Forward\x20must\x20have\x20distinct\x20permission\x20model'],'example':{'pair':{'prev_node':'Review','next_node':'Approved','threshold':0x5,'forwards':[{'name':'ManagerApprove','weight':0x3,'permission_index':0x2},{'name':'EngineerApprove','weight':0x1,'named_operator':'engineer'},{'name':'QAApprove','weight':0x1,'named_operator':'qa'}]}}},{'id':'P-M-LINEAR','pattern_name':'Linear\x20Flow\x20(No\x20Branches)','category':'topology','semantic_intent':'Workflow\x20progresses\x20in\x20a\x20straight\x20line\x20with\x20no\x20branches.','match_keywords':['linear','straight','no\x20branches'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':'dynamic','structure':'Chain\x20of\x20Pairs:\x20A->B->C->D->...->Terminal'},'constraints':['Exactly\x20one\x20entry\x20Pair\x20(prev_node=\x27\x27)','Exactly\x20one\x20terminal\x20node\x20(no\x20outgoing\x20Pairs)','Each\x20non-terminal\x20node\x20has\x20exactly\x20one\x20outgoing\x20Pair'],'example':{'topology':'Entry\x20->\x20A\x20->\x20B\x20->\x20C\x20->\x20Terminal'}},{'id':'P-M-FORKMERGE','pattern_name':'Fork-Merge\x20(Parallel\x20Branches\x20Converging)','category':'topology','semantic_intent':'Main\x20flow\x20forks\x20into\x20multiple\x20parallel\x20branches,\x20then\x20merges\x20back\x20to\x20main\x20flow.','match_keywords':['fork','merge','parallel'],'schema_elements':{'threshold':0x1,'forward_count':'dynamic','permission_model':'mixed','pair_count':'dynamic','structure':'ForkNode\x20->\x20{BranchA,\x20BranchB}\x20->\x20MergeNode'},'constraints':['Multiple\x20Pairs\x20from\x20ForkNode\x20(one\x20per\x20branch)','All\x20branches\x20must\x20eventually\x20reach\x20MergeNode','MergeNode\x20has\x20multiple\x20incoming\x20Pairs\x20(merge\x20point)','Threshold\x20at\x20MergeNode\x20determines\x20if\x20all\x20branches\x20must\x20complete\x20or\x20just\x20some'],'example':{'topology':'ForkNode\x20->\x20BranchA\x20->\x20MergeNode;\x20ForkNode\x20->\x20BranchB\x20->\x20MergeNode'}},{'id':'P-M-COMPETING','pattern_name':'Competing\x20Pairs\x20(Mutually\x20Exclusive\x20Branches)','category':'topology','semantic_intent':'Multiple\x20Pairs\x20from\x20same\x20node\x20compete;\x20first\x20Pair\x20to\x20meet\x20threshold\x20wins,\x20others\x20abandoned.','match_keywords':['competing','exclusive','race'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':'dynamic','structure':'Same\x20prev_node\x20->\x20multiple\x20next_nodes\x20(each\x20Pair\x20independent)'},'constraints':['Mutually\x20exclusive\x20—\x20only\x20one\x20Pair\x20can\x20complete\x20per\x20session','First\x20Pair\x20to\x20reach\x20threshold\x20wins','Other\x20incomplete\x20Pairs\x20are\x20abandoned','Verify\x20no\x20dead\x20branches\x20(a\x20Pair\x20that\x20always\x20loses\x20to\x20another)'],'example':{'topology':'Shipped\x20->\x20Received;\x20Shipped\x20->\x20Lost;\x20Shipped\x20->\x20Return\x20(first\x20wins)'}},{'id':'P-M-PERM-SINGLE','pattern_name':'Single\x20Permission','category':'permission','semantic_intent':'Forward\x20uses\x20only\x20one\x20permission\x20type:\x20namedOperator\x20OR\x20permissionIndex.','match_keywords':['single\x20permission'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':0x1,'structure':'Forward:\x20{\x20name,\x20weight:\x201,\x20namedOperator:\x20\x27<role>\x27\x20|\x20permissionIndex:\x20<index>\x20}\x20(only\x20one\x20set)'},'constraints':['Either\x20namedOperator\x20or\x20permissionIndex\x20is\x20set\x20(not\x20both)','Empty\x20namedOperator=\x27\x27\x20grants\x20OrderHolder\x20(order\x20owner\x20+\x20agents)'],'example':{'forward':{'name':'Ship','weight':0x1,'permission_index':0x2}}},{'id':'P-M-PERM-MIXED','pattern_name':'Mixed\x20Permission\x20(Either-Or)','category':'permission','semantic_intent':'Forward\x20allows\x20EITHER\x20permission\x20to\x20execute\x20(internal\x20staff\x20OR\x20external\x20roles).','match_keywords':['mixed\x20permission','either'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'mixed','pair_count':0x1,'structure':'Forward:\x20{\x20name,\x20weight:\x201,\x20namedOperator:\x20\x27<role>\x27,\x20permissionIndex:\x20<index>\x20}\x20(both\x20set)'},'constraints':['Both\x20namedOperator\x20and\x20permissionIndex\x20are\x20set','Executor\x20needs\x20EITHER\x20permission\x20—\x20passing\x20either\x20check\x20is\x20sufficient','Use\x20case:\x20allow\x20internal\x20staff\x20OR\x20external\x20role\x20to\x20execute\x20the\x20same\x20Forward'],'example':{'forward':{'name':'Confirm','weight':0x1,'named_operator':'auditor','permission_index':0x2}}},{'id':'P-M-CROSS-MACHINE','pattern_name':'Cross-Machine\x20Dependency','category':'integration','semantic_intent':'Machine\x20B\x27s\x20Forward\x20Guard\x20queries\x20Machine\x20A\x27s\x20Progress\x20to\x20verify\x20upstream\x20completion.','match_keywords':['cross-machine','supply\x20chain','upstream'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':0x1,'structure':'Forward:\x20{\x20guard:\x20\x27upstream_progress_guard\x27,\x20retained_submission:\x20\x27upstream_progress_id\x27\x20}'},'constraints':['Machine\x20A\x20MUST\x20be\x20published\x20before\x20Machine\x20B\x20(dependency\x20order)','Guard\x20uses\x20convert_witness=100\x20to\x20convert\x20submitted\x20Order/Progress\x20ID\x20into\x20queryable\x20Progress','Cross-Machine\x20dependency\x20is\x20one-way\x20(no\x20cycles)','Dependency\x20verification:\x20indirect\x20via\x20progress::new\x20->\x20assert_published\x20(see\x2006\x20§14.6)','retained_submission\x20stores\x20upstream\x20Progress\x20ID\x20for\x20audit'],'example':{'forward':{'name':'VerifyUpstream','weight':0x1,'permission_index':0x2,'guard':'upstream_progress_guard','retained_submission':'upstream_progress_id'}}},{'id':'P-M-ALLOCATION-INTEGRATED','pattern_name':'Allocation-Integrated\x20Terminal','category':'integration','semantic_intent':'Terminal\x20node\x20triggers\x20Allocator\x20to\x20distribute\x20funds.\x20Allocation\x20independent\x20of\x20Machine\x20flow.','match_keywords':['allocation','fund\x20distribution','terminal'],'schema_elements':{'threshold':0x1,'forward_count':0x1,'permission_model':'single','pair_count':0x1,'structure':'Terminal\x20node\x20->\x20Allocator\x20entry\x20(configured\x20on\x20Service\x20order_allocators)'},'constraints':['Terminal\x20node\x20must\x20be\x20referenced\x20in\x20Service\x20order_allocators','Allocator\x20Guard\x20verifies\x20progress.current\x20==\x20terminal_node_name','sharing.who\x20determines\x20fund\x20recipient\x20(Entity\x20/\x20OrderHolder\x20/\x20etc.)','Multiple\x20Allocators\x20can\x20fire\x20on\x20different\x20terminal\x20nodes'],'example':{'terminal_node':'Complete','allocator':{'trigger_node':'Complete','sharing_who':'Entity','recipient':'merchant_treasury'}}}];export const NODE_FIELD_EXPLANATIONS=[{'field':'name','type':'string','required':!![],'semantic':'Node\x20name\x20(unique\x20identifier)','constraint':'<=64\x20BCS\x20bytes,\x20globally\x20unique'},{'field':'description','type':'string','required':![],'semantic':'Human-readable\x20description','constraint':'<=MAX_DESCRIPTION_LENGTH'},{'field':'b_pause','type':'boolean','required':![],'semantic':'Whether\x20node\x20is\x20paused\x20(blocks\x20execution)','constraint':'Default\x20false'},{'field':'b_submission','type':'boolean','required':![],'semantic':'Whether\x20submission\x20is\x20allowed\x20at\x20this\x20node','constraint':'Used\x20for\x20retained_submission\x20storage'}];export const PAIR_FIELD_EXPLANATIONS=[{'field':'prev_node','type':'string','required':!![],'semantic':'Source\x20node\x20(empty\x20\x27\x27\x20=\x20entry\x20point)','constraint':'Must\x20reference\x20existing\x20node\x20or\x20\x27\x27'},{'field':'next_node','type':'string','required':!![],'semantic':'Target\x20node','constraint':'Must\x20reference\x20existing\x20node'},{'field':'threshold','type':'number','required':!![],'semantic':'Required\x20total\x20forward\x20weight\x20to\x20advance','constraint':'>=0,\x20typically\x201-100'},{'field':'forwards','type':'array<Forward>','required':!![],'semantic':'List\x20of\x20Forwards\x20in\x20this\x20Pair','constraint':'1-20\x20Forwards\x20per\x20Pair'}];export const FORWARD_FIELD_EXPLANATIONS=[{'field':'name','type':'string','required':!![],'semantic':'Forward\x20name\x20(unique\x20within\x20Pair)','constraint':'<=64\x20BCS\x20bytes,\x20unique\x20within\x20Pair'},{'field':'weight','type':'number','required':!![],'semantic':'Weight\x20contribution\x20to\x20threshold','constraint':'>0,\x20typically\x201-100'},{'field':'namedOperator','type':'string\x20(optional)','required':![],'semantic':'Named\x20operator\x20role\x20(\x27\x27\x20=\x20OrderHolder)','constraint':'Optional,\x20but\x20Forward\x20needs\x20at\x20least\x20one\x20permission'},{'field':'permissionIndex','type':'number\x20(optional)','required':![],'semantic':'Permission\x20index\x20(custom\x20or\x20builtin)','constraint':'<\x20Permission.indices.length'},{'field':'guard','type':'address\x20(optional)','required':![],'semantic':'Guard\x20object\x20address\x20for\x20validation','constraint':'Must\x20be\x20CREATE-only\x20Guard,\x20already\x20created'},{'field':'retained_submission','type':'string\x20(optional)','required':![],'semantic':'Key\x20for\x20storing\x20submitted\x20values\x20in\x20history','constraint':'Uniquely\x20located\x20by\x20(current_node,\x20next_node,\x20forward_name)'}];export function identifyExecutionMode(a){const {threshold:b,forwards:c}=a,d=c['length'];if(b===0x1&&d===0x1)return'P-M-SEQ\x20(Sequential)';if(b===d&&d>=0x2){const e=c['some'](g=>g['permission_index']!==undefined)&&c['some'](g=>g['named_operator']!==undefined);return e?'P-M-AND\x20(Parallel\x20AND\x20/\x20Dual-Signature)':'P-M-AND\x20(Parallel\x20AND)';}if(b===0x64&&c['some'](g=>g['weight']<0x32&&g['weight']>0x0))return'P-M-VOTE\x20(Weighted\x20Voting)';if(b<d&&b>0x1)return'P-M-HYBRID\x20(Hybrid\x20Mode)';if(b===0x1&&d>=0x1)return'P-M-OR\x20(Parallel\x20OR)\x20or\x20P-M-SEQ\x20(if\x20single\x20Forward)';return'Unknown\x20(manual\x20review\x20needed)';}export function identifyTopology(a){const b=new Map(),c=new Map();for(const d of a){if(!b['has'](d['prev_node']))b['set'](d['prev_node'],[]);b['get'](d['prev_node'])['push'](d['next_node']);if(!c['has'](d['next_node']))c['set'](d['next_node'],[]);c['get'](d['next_node'])['push'](d['prev_node']);}for(const [e,f]of b){if(f['length']>0x1&&e!=='')return'P-M-COMPETING\x20(Competing\x20Pairs)';}for(const [g,h]of c){if(h['length']>0x1)return'P-M-FORKMERGE\x20(Fork-Merge)';}return'P-M-LINEAR\x20(Linear\x20Flow)';}export function matchSemanticPattern(a){const b=a['toLowerCase']();return SEMANTIC_TO_MACHINE_RULES['find'](c=>c['match_keywords']['some'](d=>b['includes'](d['toLowerCase']())));}export function explainForwardPermission(a){const b=a['named_operator']!==undefined&&a['named_operator']!==null,c=a['permission_index']!==undefined&&a['permission_index']!==null;if(b&&c){const d=a['named_operator']===''?'OrderHolder':'role\x20\x22'+a['named_operator']+'\x22';return'Mixed\x20permission:\x20'+d+'\x20OR\x20Permission\x20index\x20'+a['permission_index']+'\x20(either\x20sufficient)';}if(b){if(a['named_operator']==='')return'OrderHolder\x20(order\x20owner\x20+\x20agents)';return'NamedOperator\x20role\x20\x22'+a['named_operator']+'\x22';}if(c)return'Permission\x20index\x20'+a['permission_index'];return'❌\x20INVALID:\x20no\x20permission\x20set\x20(Forward\x20must\x20have\x20at\x20least\x20one\x20of\x20namedOperator\x20or\x20permissionIndex)';}export const MACHINE_CONSTRAINT_RULES=[{'id':'MC-C-01','name':'Node\x20count\x20<=\x20'+MAX_NODE_COUNT,'description':'MAX_NODE_COUNT','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-02','name':'Pair\x20count\x20per\x20node\x20<=\x20'+MAX_NODE_PAIR_COUNT,'description':'MAX_NODE_PAIR_COUNT','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-03','name':'Forward\x20count\x20per\x20Pair\x20<=\x20'+MAX_FORWARD_COUNT,'description':'MAX_FORWARD_COUNT','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-04','name':'Node\x20name\x20unique','description':'name\x20globally\x20unique','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-05','name':'Forward\x20name\x20unique\x20within\x20Pair','description':'name\x20unique\x20within\x20Pair','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-06','name':'Node\x20name\x20<=\x2064\x20BCS\x20bytes','description':'MAX_NAME_LENGTH','category':'creation','verification_location':'common.ts','on_chain_enforced':!![]},{'id':'MC-C-07','name':'Forward\x20has\x20at\x20least\x20one\x20permission','description':'namedOperator\x20or\x20permissionIndex','category':'creation','verification_location':'wowok-machine\x20SKILL','on_chain_enforced':![]},{'id':'MC-C-08','name':'permissionIndex\x20valid','description':'<\x20Permission.indices.length','category':'creation','verification_location':'permission.move','on_chain_enforced':!![]},{'id':'MC-C-09','name':'Guard\x20already\x20created','description':'guard\x20field\x20references\x20existing\x20Guard','category':'creation','verification_location':'guard.move','on_chain_enforced':!![]},{'id':'MC-C-10','name':'Guard\x20immutable','description':'Guard.b_immutable\x20==\x20true','category':'creation','verification_location':'guard.move','on_chain_enforced':!![]},{'id':'MC-C-11','name':'retained_submission\x20index\x20valid','description':'Corresponds\x20to\x20Guard\x20table\x20b_submission=true','category':'creation','verification_location':'guard.move','on_chain_enforced':!![]},{'id':'MC-C-12','name':'prev_node\x20references\x20valid','description':'Points\x20to\x20existing\x20node\x20or\x20\x27\x27','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-13','name':'threshold\x20>=\x200','description':'Non-negative','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-14','name':'weight\x20>\x200','description':'Positive','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-15','name':'description\x20length','description':'<=\x20MAX_DESCRIPTION_LENGTH','category':'creation','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-C-16','name':'bReplace\x20scope','description':'Acts\x20on\x20existing\x20node\x27s\x20pairs\x20list,\x20not\x20whole\x20Machine','category':'node_operation','verification_location':'machine.move:405-443','on_chain_enforced':!![]},{'id':'MC-C-17','name':'bReplace=false\x20merge\x20semantics','description':'Incremental\x20merge\x20by\x20prev_node\x20into\x20existing\x20pairs','category':'node_operation','verification_location':'machine.move:418-443','on_chain_enforced':!![]},{'id':'MC-C-18','name':'Non-existing\x20node\x20append','description':'push_back\x20new\x20node\x20(no\x20clear\x20triggered)','category':'node_operation','verification_location':'machine.move:418-443','on_chain_enforced':!![]},{'id':'MC-C-19','name':'Full\x20node\x20replacement\x20via\x20file\x20entry','description':'NodeJsonOrMarkdownFileSchema\x20(not\x20bReplace=true)','category':'node_operation','verification_location':'machine.ts:93-112','on_chain_enforced':![]},{'id':'MC-S-01','name':'At\x20least\x20one\x20entry\x20point','description':'Pair\x20with\x20prev_node=\x27\x27','category':'structure','verification_location':'machine-topology.ts','on_chain_enforced':![]},{'id':'MC-S-02','name':'At\x20least\x20one\x20terminal','description':'Node\x20with\x20no\x20outgoing\x20Pairs','category':'structure','verification_location':'machine-topology.ts','on_chain_enforced':![]},{'id':'MC-S-03','name':'No\x20orphaned\x20nodes','description':'All\x20non-entry\x20nodes\x20have\x20incoming\x20Pair','category':'structure','verification_location':'machine-topology.ts','on_chain_enforced':![]},{'id':'MC-S-04','name':'No\x20dead\x20branches','description':'All\x20thresholds\x20achievable','category':'structure','verification_location':'machine-topology.ts','on_chain_enforced':![]},{'id':'MC-S-05','name':'DAG\x20acyclic','description':'No\x20cycle\x20references','category':'structure','verification_location':'machine-topology.ts','on_chain_enforced':![]},{'id':'MC-P-01','name':'All\x20Guards\x20tested','description':'gen_passport\x20passed','category':'publish','verification_location':'machine-confirm.ts','on_chain_enforced':![]},{'id':'MC-P-02','name':'Backup\x20exported','description':'machineNode2file\x20executed','category':'publish','verification_location':'machine-confirm.ts','on_chain_enforced':![]},{'id':'MC-P-03','name':'Testnet\x20verified','description':'(recommended)\x20testnet\x20passed','category':'publish','verification_location':'machine-confirm.ts','on_chain_enforced':![]},{'id':'MC-P-04','name':'User\x20100%\x20confirmed','description':'ConfirmGate\x20passed','category':'publish','verification_location':'machine-confirm.ts','on_chain_enforced':![]},{'id':'MC-P-05','name':'Service\x20created\x20(if\x20bound)','description':'Service\x20exists','category':'publish','verification_location':'machine-context.ts','on_chain_enforced':![]},{'id':'MC-R-01','name':'Node\x20ops\x20fail\x20after\x20publish','description':'E_ALREADY_PUBLISHED','category':'runtime','verification_location':'machine.move','on_chain_enforced':!![]},{'id':'MC-R-02','name':'Session\x20accumulation\x20correct','description':'weight\x20accumulation\x20logic','category':'runtime','verification_location':'progress.move','on_chain_enforced':!![]},{'id':'MC-R-03','name':'Competing\x20Pair\x20first-wins','description':'First\x20Pair\x20to\x20reach\x20threshold\x20wins','category':'runtime','verification_location':'progress.move','on_chain_enforced':!![]}];export function getConstraintsByCategory(a){return MACHINE_CONSTRAINT_RULES['filter'](b=>b['category']===a);}export function getConstraintById(a){return MACHINE_CONSTRAINT_RULES['find'](b=>b['id']===a);}export function getOnChainConstraints(){return MACHINE_CONSTRAINT_RULES['filter'](a=>a['on_chain_enforced']);}export function getOffChainConstraints(){return MACHINE_CONSTRAINT_RULES['filter'](a=>!a['on_chain_enforced']);}export const MACHINE_TRANSLATION_VERSION='1.0.0';export const MACHINE_PATTERNS_COUNT=SEMANTIC_TO_MACHINE_RULES['length'];export const MACHINE_CONSTRAINTS_COUNT=MACHINE_CONSTRAINT_RULES['length'];import{MAX_NODE_COUNT,MAX_NODE_PAIR_COUNT,MAX_FORWARD_COUNT}from'./onchain-constants.js';export function identifyNodeRole(a){const b=a['all_pairs']??[],c=(a['pairs']??b)['filter'](i=>i['prev_node']===a['name']),d=b['filter'](i=>i['next_node']===a['name']),e=b['some'](i=>i['prev_node']===''&&i['next_node']===a['name']),f=c['length']===0x0;if(e)return'entry';if(f)return'terminal';const g=new Set(c['map'](i=>i['next_node']));if(g['size']>0x1)return'branch';const h=new Set(d['map'](i=>i['prev_node'])['filter'](i=>i!==''));if(h['size']>0x1)return'merge';return'normal';}function explainGuardBinding(a){return{'address':a,'immutable_required':!![],'note':'Guard\x20'+a+'\x20validates\x20this\x20Forward\x27s\x20execution;\x20'+'must\x20be\x20immutable\x20(b_immutable=true)\x20and\x20pre-created\x20on-chain.'};}export function explainNode(a){const b=a['pairs']??[];return{'name':a['name'],'role':identifyNodeRole(a),'pairs':b['map'](c=>explainPair(c)),'description':a['description']};}export function explainPair(a){return{'prev_node':a['prev_node'],'next_node':a['next_node'],'threshold':a['threshold'],'execution_pattern':identifyExecutionMode(a),'forwards':a['forwards']['map'](b=>explainForward(b))};}export function explainForward(a){return{'name':a['name'],'permission':explainForwardPermission(a),'weight':a['weight'],'guard':a['guard']?explainGuardBinding(a['guard']):null,'retained_submission':a['retained_submission']??null};}

package/dist/knowledge/market-metrics.d.ts

@@ -0,0 +1,12 @@
+import type { ENTRYPOINT } from "@wowok/wowok";
+export interface MarketMetrics {
+    total_services: number;
+    active_services: number;
+    total_demands: number;
+    open_demands: number;
+    total_arbs: number;
+    open_arbs: number;
+    supply_demand_ratio: number | null;
+    computed_at: number;
+}
+export declare function computeMarketMetrics(network: ENTRYPOINT, no_cache?: boolean): Promise<MarketMetrics>;

package/dist/knowledge/market-metrics.js

@@ -0,0 +1 @@
+import{query_services,query_demands,query_arbs,ArbStatus}from'@wowok/wowok';export async function computeMarketMetrics(a,b){const [c,d,e]=await Promise['all']([query_services({'network':a,'no_cache':b}),query_demands({'network':a,'no_cache':b}),query_arbs({'network':a,'no_cache':b})]),f=c['services']['filter'](k=>{const l=k['json']??{};return l['bPublished']===!![]&&l['bPaused']!==!![];}),g=d['demands']['filter'](j=>(j['presenters_count']??0x0)===0x0),h=e['arbs']['filter'](j=>{const k=Number(j['status']);return k!==ArbStatus['Finished']&&k!==ArbStatus['Withdrawn'];}),i=f['length'];return{'total_services':c['services']['length'],'active_services':i,'total_demands':d['demands']['length'],'open_demands':g['length'],'total_arbs':e['arbs']['length'],'open_arbs':h['length'],'supply_demand_ratio':i>0x0?g['length']/ i:null,'computed_at':Date['now']()};}