@wowok/agent-mcp 2.7.6 → 2.7.8

package/dist/knowledge/machine-risk.js

@@ -1 +1 @@
-import{USER_DEFINED_PERM_INDEX_START,MAX_NODE_COUNT}from'./onchain-constants.js';export const MACHINE_RISK_RULES=[{'id':'R-M1-01','name':'No\x20entry\x20point','category':'structural','severity':'critical','description':'Machine\x20has\x20no\x20Pair\x20with\x20prev_node=\x27\x27\x20(no\x20entry\x20point).\x20Workflow\x20cannot\x20start.','detection':'Check\x20if\x20any\x20pair\x20has\x20prev_node\x20===\x20\x27\x27','recommendation':'Add\x20at\x20least\x20one\x20Pair\x20with\x20prev_node=\x27\x27\x20to\x20serve\x20as\x20entry\x20point.','auto_fixable':![],'related_constraint':'MC-S-01'},{'id':'R-M1-02','name':'No\x20terminal\x20node','category':'structural','severity':'critical','description':'Machine\x20has\x20no\x20terminal\x20node\x20(all\x20nodes\x20have\x20outgoing\x20Pairs).\x20Workflow\x20never\x20completes.','detection':'Check\x20if\x20any\x20node\x20has\x20no\x20outgoing\x20Pair','recommendation':'Designate\x20at\x20least\x20one\x20node\x20as\x20terminal\x20(no\x20outgoing\x20Pair)\x20and\x20bind\x20Allocator\x20to\x20it.','auto_fixable':![],'related_constraint':'MC-S-02'},{'id':'R-M1-03','name':'Dead-end\x20node\x20(non-terminal)','category':'structural','severity':'medium','description':'Non-terminal\x20node\x20has\x20no\x20outgoing\x20Pair.\x20Workflow\x20stalls\x20at\x20this\x20node.','detection':'Find\x20nodes\x20with\x20no\x20outgoing\x20Pair\x20that\x20are\x20not\x20intended\x20terminals','recommendation':'Add\x20outgoing\x20Pair\x20or\x20designate\x20as\x20terminal\x20with\x20Allocator.','auto_fixable':![]},{'id':'R-M1-04','name':'Orphaned\x20node','category':'structural','severity':'high','description':'Node\x20has\x20no\x20incoming\x20Pair\x20(except\x20entry).\x20Unreachable.','detection':'Find\x20non-entry\x20nodes\x20with\x20no\x20incoming\x20Pair','recommendation':'Add\x20Pair\x20from\x20existing\x20node\x20to\x20this\x20orphaned\x20node,\x20or\x20remove\x20it.','auto_fixable':![],'related_constraint':'MC-S-03'},{'id':'R-M1-05','name':'Dead\x20branch\x20(competing\x20Pair\x20always\x20loses)','category':'structural','severity':'high','description':'A\x20competing\x20Pair\x27s\x20threshold\x20can\x20never\x20be\x20met\x20because\x20users\x20always\x20prefer\x20another\x20path.','detection':'Analyze\x20threshold\x20achievability\x20across\x20competing\x20Pairs','recommendation':'Make\x20thresholds\x20balanced,\x20or\x20remove\x20the\x20dead\x20branch.','auto_fixable':![],'related_constraint':'MC-S-04'},{'id':'R-M1-06','name':'Cycle\x20in\x20DAG','category':'structural','severity':'critical','description':'Workflow\x20has\x20a\x20cycle.\x20Nodes\x20reference\x20each\x20other\x20circularly.','detection':'DFS\x20cycle\x20detection','recommendation':'Break\x20the\x20cycle\x20by\x20removing\x20one\x20Pair.','auto_fixable':![],'related_constraint':'MC-S-05'},{'id':'R-M1-07','name':'Exceeds\x20MAX_NODE_COUNT\x20(100)','category':'structural','severity':'critical','description':'Node\x20count\x20exceeds\x20on-chain\x20limit.\x20Publish\x20will\x20fail.','detection':'nodes.length\x20>\x20'+MAX_NODE_COUNT,'recommendation':'Reduce\x20node\x20count\x20or\x20split\x20into\x20multiple\x20Machines.','auto_fixable':![],'related_constraint':'MC-C-01'},{'id':'R-M1-08','name':'Exceeds\x20MAX_NODE_PAIR_COUNT\x20(40)','category':'structural','severity':'high','description':'A\x20single\x20node\x27s\x20Pairs\x20exceed\x20on-chain\x20limit.\x20Publish\x20will\x20fail.','detection':'Find\x20node\x20where\x20pairs.length\x20>\x2040','recommendation':'Split\x20node\x20or\x20simplify\x20branches\x20to\x20reduce\x20Pair\x20count\x20per\x20node.','auto_fixable':![],'related_constraint':'MC-C-02'},{'id':'R-M1-09','name':'Exceeds\x20MAX_FORWARD_COUNT\x20(20)','category':'structural','severity':'high','description':'A\x20single\x20Pair\x27s\x20Forwards\x20exceed\x20on-chain\x20limit.\x20Publish\x20will\x20fail.','detection':'Find\x20Pair\x20where\x20forwards.length\x20>\x2020','recommendation':'Split\x20Pair\x20or\x20merge\x20Forwards\x20to\x20reduce\x20Forward\x20count\x20per\x20Pair.','auto_fixable':![],'related_constraint':'MC-C-03'},{'id':'R-M1-10','name':'Duplicate\x20node\x20name','category':'structural','severity':'critical','description':'Two\x20nodes\x20have\x20the\x20same\x20name.\x20On-chain\x20will\x20reject.','detection':'Find\x20duplicate\x20names\x20in\x20nodes\x20array','recommendation':'Rename\x20one\x20of\x20the\x20duplicates.','auto_fixable':![],'related_constraint':'MC-C-04'},{'id':'R-M1-11','name':'Dispute\x20anti-pattern\x20—\x20machine\x20illegally\x20models\x20dispute\x20flow','category':'structural','severity':'critical','description':'Machine\x20contains\x20nodes\x20named\x20\x27disputed\x27,\x20\x27refunded\x27,\x20\x27arb\x27,\x20\x27arbitration\x27,\x20'+'\x27dispute\x27,\x20or\x20\x27refund\x27.\x20This\x20is\x20a\x20CRITICAL\x20design\x20anti-pattern\x20because\x20'+'dispute\x20is\x20INDEPENDENT\x20of\x20the\x20machine\x20workflow.\x20Dispute\x20flows\x20through:\x20'+'Order\x20→\x20Arbitration.dispute()\x20→\x20Arb\x20object\x20→\x20arbitration()\x20ruling\x20→\x20'+'arb_withdraw\x20by\x20order\x20holder.\x20Arbitrators\x20are\x20configured\x20in\x20'+'Arbitration.voting_guard,\x20NOT\x20in\x20Permission.\x20Merchants\x20who\x20model\x20'+'dispute\x20in\x20the\x20machine\x20(e.g.,\x20\x27disputed\x20→\x20refunded\x27\x20forward\x20guarded\x20'+'by\x20Permission\x20index\x201500)\x20create\x20dead-end\x20paths\x20because\x20no\x20one\x20has\x20'+'Permission\x201500\x20—\x20arbitrators\x20are\x20NOT\x20Permission\x20holders.','detection':'Match\x20node\x20names\x20against\x20regex\x20/(^|_)(disputed?|refund(?:ed)?|arbitration|arb)(_|$)/i\x20'+'(catches\x20both\x20exact\x20names\x20like\x20\x27refunded\x27\x20and\x20compound\x20fund-flow\x20terminals\x20like\x20'+'\x27deposit_refunded\x27/\x27deposit_deducted\x27;\x20business\x20states\x20like\x20\x27return_approved\x27/'+'\x27damage_confirmed\x27/\x27cancelled\x27/\x27returned\x27\x20do\x20NOT\x20match)','recommendation':'Remove\x20all\x20dispute/refund\x20nodes\x20from\x20the\x20machine.\x20Instead:\x20(1)\x20bind\x20an\x20'+'Arbitration\x20object\x20to\x20the\x20Service\x20via\x20Service.arbitrations,\x20(2)\x20configure\x20'+'arbitrators\x20via\x20Arbitration.voting_guard_add,\x20(3)\x20deposit\x20compensation_fund\x20'+'to\x20the\x20Service.\x20Disputes\x20are\x20then\x20filed\x20via\x20arbitration::dispute(order,\x20'+'arbitration)\x20—\x20completely\x20independent\x20of\x20the\x20machine\x20workflow.','auto_fixable':![]},{'id':'R-M2-01','name':'Guard\x20not\x20created','category':'guard_integration','severity':'critical','description':'Forward\x20references\x20a\x20Guard\x20that\x20is\x20not\x20yet\x20created\x20on-chain.\x20Forward\x20execution\x20will\x20fail\x20Guard\x20verification.','detection':'Check\x20forward.guard\x20against\x20published_guards\x20set','recommendation':'Create\x20the\x20Guard\x20object\x20before\x20publishing\x20this\x20Machine.','auto_fixable':![],'related_constraint':'MC-C-09'},{'id':'R-M2-02','name':'Guard\x20not\x20tested\x20via\x20gen_passport','category':'guard_integration','severity':'high','description':'Guard\x20has\x20not\x20been\x20tested\x20via\x20gen_passport.\x20Guard\x20may\x20have\x20bugs,\x20cannot\x20be\x20fixed\x20after\x20publish.','detection':'Check\x20testnet\x20test\x20records\x20for\x20this\x20Guard','recommendation':'Run\x20gen_passport\x20on\x20testnet\x20before\x20binding\x20to\x20Machine.','auto_fixable':![]},{'id':'R-M2-03','name':'Guard\x20+\x20Machine\x20immutability\x20deadlock','category':'guard_integration','severity':'critical','description':'After\x20Machine\x20publish,\x20a\x20Guard\x20bug\x20is\x20discovered.\x20Guard\x20is\x20immutable\x20(cannot\x20be\x20fixed),\x20Machine\x20is\x20immutable\x20(cannot\x20be\x20rebound).','detection':'Verify\x20all\x20Guards\x20tested\x20before\x20Machine\x20publish','recommendation':'Keep\x20Machine\x20unpublished\x20until\x20all\x20Guards\x20are\x20verified.','auto_fixable':![]},{'id':'R-M2-04','name':'retained_submission\x20index\x20mismatch','category':'guard_integration','severity':'high','description':'Forward\x27s\x20retained_submission\x20key\x20does\x20not\x20correspond\x20to\x20Guard\x20table\x20b_submission=true\x20entry.\x20Retained\x20data\x20fails\x20or\x20is\x20incorrect.','detection':'Cross-check\x20forward.retained_submission\x20against\x20Guard\x20table\x20entries','recommendation':'Align\x20retained_submission\x20key\x20with\x20Guard\x20table\x20b_submission=true\x20identifier.','auto_fixable':!![],'related_constraint':'MC-C-11'},{'id':'R-M2-05','name':'Guard\x20reentry\x20risk','category':'guard_integration','severity':'high','description':'Guard\x20lacks\x20anti-reentry\x20mechanism\x20(see\x20Guard\x20R-X1-14).\x20Risk\x20of\x20duplicate\x20execution\x20or\x20vote\x20manipulation.','detection':'For\x20each\x20Guard\x20scene,\x20verify\x20anti-reentry\x20Guard\x20is\x20configured\x20(see\x20Guard\x20semantic\x20layer\x20R-X1-14)','recommendation':'Add\x20anti-reentry\x20Guard\x20for\x20each\x20scenario\x20(see\x20Guard\x20semantic\x20layer\x20R-X1-14).','auto_fixable':![]},{'id':'R-M2-06','name':'Guard\x20scene\x20mismatch','category':'guard_integration','severity':'medium','description':'Forward\x27s\x20bound\x20Guard\x20scene\x20does\x20not\x20match\x20Forward\x27s\x20business\x20(e.g.,\x20Forward\x20uses\x20reward_guard\x20instead\x20of\x20machine_forward_guard).','detection':'Cross-check\x20Guard\x20scene\x20against\x20Forward\x20business\x20purpose','recommendation':'Use\x20the\x20correct\x20Guard\x20scene\x20(machine_forward_guard).','auto_fixable':![]},{'id':'R-M2-07','name':'Cross-Machine\x20Guard\x20dependency\x20cycle','category':'guard_integration','severity':'critical','description':'Machine\x20A\x20depends\x20on\x20Machine\x20B\x20(via\x20Guard),\x20B\x20depends\x20on\x20A.\x20Circular\x20dependency.','detection':'Identify\x20cross-Machine\x20Guard\x20references\x20and\x20detect\x20cycles','recommendation':'Ensure\x20cross-Machine\x20dependencies\x20are\x20unidirectional.','auto_fixable':![]},{'id':'R-M2-08','name':'Guard\x20references\x20unpublished\x20object','category':'guard_integration','severity':'high','description':'Guard\x20table\x20references\x20an\x20object\x20(e.g.,\x20Service)\x20that\x20is\x20not\x20yet\x20published.','detection':'Cross-check\x20Guard\x20table\x20object\x20references\x20against\x20published\x20objects\x20set','recommendation':'Use\x20P16\x20circular\x20reference\x20pattern\x20(name\x20instead\x20of\x20address),\x20or\x20publish\x20referenced\x20objects\x20first.','auto_fixable':![]},{'id':'R-M3-01','name':'Forward\x20without\x20permission','category':'permission','severity':'critical','description':'Forward\x20has\x20neither\x20namedOperator\x20nor\x20permissionIndex.\x20Cannot\x20be\x20executed.','detection':'Check\x20each\x20forward\x20has\x20at\x20least\x20one\x20of\x20namedOperator\x20or\x20permissionIndex','recommendation':'Set\x20namedOperator=\x27\x27\x20for\x20OrderHolder,\x20or\x20set\x20permissionIndex.','auto_fixable':![],'related_constraint':'MC-C-07'},{'id':'R-M3-02','name':'permissionIndex\x20out\x20of\x20bounds','category':'permission','severity':'critical','description':'Forward\x27s\x20permissionIndex\x20>=\x20Permission.indices.length.\x20Execution\x20will\x20fail.','detection':'Check\x20permission_index\x20<\x20Permission.indices.length','recommendation':'Use\x20a\x20valid\x20permission\x20index\x20or\x20extend\x20Permission.indices.','auto_fixable':![],'related_constraint':'MC-C-08'},{'id':'R-M3-03','name':'Permission\x20rotation\x20failure','category':'permission','severity':'high','description':'Permission\x20object\x20updated,\x20indices\x20order\x20changed.\x20Original\x20permissionIndex\x20now\x20points\x20to\x20wrong\x20permission.','detection':'Detect\x20Permission\x20object\x20update\x20that\x20reorders\x20indices','recommendation':'Use\x20custom\x20Permission;\x20document\x20index\x20meanings;\x20avoid\x20frequent\x20Permission\x20updates.','auto_fixable':![]},{'id':'R-M3-04','name':'OrderHolder\x20misuse','category':'permission','severity':'medium','description':'namedOperator=\x27\x27\x20used\x20in\x20non-customer-operation\x20scenarios.\x20Non-intended\x20personnel\x20gain\x20operation\x20permission.','detection':'Find\x20Forwards\x20with\x20namedOperator=\x27\x27\x20on\x20non-customer-operation\x20nodes','recommendation':'Clarify\x20\x27\x27=OrderHolder\x20(customer),\x20not\x20\x27anyone\x27.\x20Use\x20namedOperator\x20for\x20specific\x20roles.','auto_fixable':![]},{'id':'R-M3-05','name':'NamedOperator\x20not\x20assigned\x20at\x20Progress\x20creation','category':'permission','severity':'high','description':'Forward\x20expects\x20namedOperator\x20role\x20but\x20Progress\x20doesn\x27t\x20have\x20it\x20assigned.\x20'+'Note:\x20MCP\x20API\x20layer\x20supports\x20progress_new.progress_namedOperator\x20(SDK\x20translates\x20to\x20namedOperator_add),\x20'+'but\x20Move\x20layer\x20progress::new\x20does\x20NOT\x20accept\x20it\x20(see\x2006\x20§14.5).','detection':'Verify\x20progress_namedOperator\x20is\x20provided\x20in\x20Progress\x20creation','recommendation':'Pass\x20progress_namedOperator\x20in\x20progress_new,\x20or\x20call\x20namedOperator_add\x20separately.','auto_fixable':![]},{'id':'R-M3-06','name':'Permission\x20game\x20imbalance','category':'permission','severity':'medium','description':'One\x20party\x20has\x20excessive\x20permission,\x20can\x20unilaterally\x20advance\x20workflow.\x20Game\x20theory\x20imbalance.','detection':'Analyze\x20permission\x20distribution\x20across\x20parties','recommendation':'Use\x20dual-signature\x20(threshold=2)\x20or\x20multi-signature\x20mechanism\x20to\x20balance\x20power.','auto_fixable':![]},{'id':'R-M3-07','name':'Permission\x20combination\x20OR\x20semantic\x20misuse','category':'permission','severity':'medium','description':'Both\x20namedOperator\x20and\x20permissionIndex\x20set,\x20but\x20OR\x20semantic\x20not\x20understood.\x20More\x20people\x20than\x20expected\x20can\x20execute\x20Forward.','detection':'Find\x20Forwards\x20with\x20both\x20namedOperator\x20and\x20permissionIndex\x20set','recommendation':'Clarify\x20that\x20when\x20both\x20permissions\x20are\x20non-null,\x20it\x20is\x20OR\x20relation\x20(either\x20can\x20execute).','auto_fixable':![]},{'id':'R-M3-08','name':'permissionIndex\x20below\x20USER_DEFINED_PERM_INDEX_START\x20(1000)','category':'permission','severity':'critical','description':'Forward\x27s\x20permissionIndex\x20<\x201000.\x20On-chain\x20constant\x20USER_DEFINED_PERM_INDEX_START\x20=\x201000\x20'+'in\x20permission.move\x20reserves\x20indexes\x200-999\x20for\x20built-in\x20permissions.\x20Using\x20index\x20<\x201000\x20'+'causes\x20confusion\x20with\x20built-in\x20permissions\x20and\x20is\x20a\x20hard\x20on-chain\x20constraint\x20(see\x20doc\x2006\x20§4.4).','detection':'Check\x20each\x20forward\x20with\x20permission_index\x20<\x201000','recommendation':'Use\x20permission_index\x20>=\x201000\x20(e.g.,\x201000,\x201001,\x201002,\x20...).\x20Reserve\x200-999\x20for\x20built-in\x20permissions.','auto_fixable':![],'related_constraint':'MC-C-08'},{'id':'R-M4-01','name':'No\x20backup\x20before\x20publish','category':'immutability','severity':'high','description':'machineNode2file\x20export\x20not\x20created\x20before\x20publish.\x20Cannot\x20restore\x20if\x20publish\x20fails.','detection':'Check\x20backup_created\x20flag','recommendation':'Run\x20machineNode2file\x20before\x20publish\x20to\x20create\x20backup.','auto_fixable':!![],'related_constraint':'MC-P-02'},{'id':'R-M4-02','name':'No\x20testnet\x20verification\x20before\x20mainnet','category':'immutability','severity':'medium','description':'Directly\x20publishing\x20to\x20mainnet\x20without\x20testnet\x20verification.\x20Potential\x20bugs\x20may\x20cause\x20fund\x20loss.','detection':'Check\x20network\x20===\x20\x27mainnet\x27\x20&&\x20!testnet_test_passed','recommendation':'Test\x20on\x20testnet\x20first.\x20Verify\x20Progress\x20runs\x20end-to-end.','auto_fixable':![],'related_constraint':'MC-P-03'},{'id':'R-M4-03','name':'Guards\x20not\x20all\x20created\x20before\x20publish','category':'immutability','severity':'critical','description':'Some\x20Forward.guard\x20is\x20still\x20null,\x20but\x20design\x20requires\x20Guard.\x20Cannot\x20add\x20Guard\x20after\x20publish\x20(immutability\x20deadlock).','detection':'Check\x20if\x20all\x20required\x20Guards\x20are\x20created\x20and\x20bound','recommendation':'Create\x20and\x20bind\x20all\x20Guards\x20before\x20publishing\x20Machine.','auto_fixable':![]},{'id':'R-M4-04','name':'Publish\x20order\x20incorrect','category':'immutability','severity':'critical','description':'Attempting\x20to\x20publish\x20Machine\x20before\x20creating\x20Guards.\x20Guards\x20cannot\x20bind\x20to\x20already-published\x20Machine.','detection':'Verify\x20dependency\x20order:\x20Permission\x20→\x20Machine(unpublished)\x20→\x20Guard\x20→\x20bind\x20→\x20publish','recommendation':'Follow\x20dependency\x20order:\x20Permission\x20→\x20Machine(unpublished)\x20→\x20Guard\x20→\x20bind\x20→\x20publish.','auto_fixable':![]},{'id':'R-M4-05','name':'Allocation\x20not\x20configured','category':'immutability','severity':'medium','description':'Terminal\x20node\x20not\x20mapped\x20to\x20Allocator.\x20Funds\x20cannot\x20be\x20distributed\x20after\x20workflow\x20completes.','detection':'Check\x20if\x20terminal\x20nodes\x20have\x20Allocator\x20mapping','recommendation':'Configure\x20Allocator\x20for\x20each\x20terminal\x20node.','auto_fixable':![]},{'id':'R-M4-06','name':'clear\x20operation\x20without\x20backup','category':'immutability','severity':'high','description':'Executing\x20node\x20clear\x20before\x20exporting\x20backup.\x20All\x20node\x20data\x20lost,\x20cannot\x20recover.','detection':'Check\x20if\x20machineNode2file\x20backup\x20created\x20before\x20clear\x20operation','recommendation':'Run\x20machineNode2file\x20backup\x20before\x20any\x20clear\x20operation.','auto_fixable':!![]},{'id':'R-M5-01','name':'Service\x20not\x20created','category':'environment','severity':'high','description':'Machine\x20design\x20complete\x20but\x20Service\x20not\x20created.\x20Machine\x20cannot\x20bind\x20to\x20Service.','detection':'Check\x20if\x20Service\x20object\x20is\x20in\x20published_services\x20set','recommendation':'Create\x20Service\x20first,\x20then\x20design/publish\x20Machine.','auto_fixable':![]},{'id':'R-M5-02','name':'Permission\x20object\x20mismatch','category':'environment','severity':'high','description':'Machine\x27s\x20Permission\x20differs\x20from\x20Service\x27s\x20Permission.\x20Permission\x20organization\x20inconsistent,\x20may\x20cause\x20operation\x20failure.','detection':'Cross-check\x20Machine\x27s\x20Permission\x20against\x20Service\x27s\x20Permission','recommendation':'Use\x20the\x20same\x20Permission\x20for\x20Machine\x20and\x20Service\x20(or\x20explicitly\x20document\x20different\x20organizations).','auto_fixable':![]},{'id':'R-M5-03','name':'Allocation\x20configuration\x20incomplete','category':'environment','severity':'high','description':'Service\x27s\x20order_allocators\x20not\x20configured\x20or\x20misconfigured.\x20Terminal\x20node\x20funds\x20cannot\x20be\x20distributed.','detection':'Check\x20if\x20Service.order_allocators\x20is\x20configured\x20for\x20each\x20terminal\x20node','recommendation':'Configure\x20Service.order_allocators,\x20one\x20Allocator\x20per\x20terminal\x20node.','auto_fixable':![]},{'id':'R-M5-04','name':'Reward\x20object\x20not\x20created','category':'environment','severity':'medium','description':'Reward\x20incentive\x20scenario\x20referenced\x20but\x20Reward\x20object\x20not\x20created.','detection':'Check\x20if\x20Reward\x20object\x20is\x20in\x20published_rewards\x20set','recommendation':'Create\x20Reward\x20object\x20first,\x20then\x20design\x20Guard.','auto_fixable':![]},{'id':'R-M5-05','name':'Arbitration\x20object\x20not\x20created','category':'environment','severity':'medium','description':'Arbitration\x20scenario\x20referenced\x20but\x20Arbitration\x20object\x20not\x20created.','detection':'Check\x20if\x20Arbitration\x20object\x20is\x20in\x20published_arbitrations\x20set','recommendation':'Create\x20Arbitration\x20object\x20first.','auto_fixable':![]},{'id':'R-M5-06','name':'Cross-Machine\x20dependency\x20not\x20published','category':'environment','severity':'critical','description':'Machine\x20A\x20depends\x20on\x20Machine\x20B,\x20but\x20B\x20is\x20not\x20published.\x20Guard\x20query\x20for\x20Machine\x20B\x27s\x20Progress\x20will\x20fail.\x20'+'Dependency\x20verification:\x20indirect\x20via\x20progress::new\x20->\x20assert_published\x20(see\x2006\x20§14.6).','detection':'Check\x20machine_ref\x20against\x20published_machines\x20set','recommendation':'Ensure\x20upstream\x20Machine\x20is\x20published\x20first.','auto_fixable':![]},{'id':'R-M5-07','name':'Repository\x20not\x20created','category':'environment','severity':'medium','description':'Guard\x20references\x20Repository\x20but\x20not\x20created.\x20Guard\x20query\x20will\x20fail.','detection':'Check\x20repository_ref\x20against\x20published\x20repositories\x20set','recommendation':'Create\x20and\x20publish\x20Repository\x20first.\x20Note:\x20consensus_repositories\x20is\x20declarative-only\x20(see\x2006\x20§14.4).','auto_fixable':![]},{'id':'R-M5-08','name':'Object\x20dependency\x20table\x20incomplete','category':'environment','severity':'low','description':'Project\x20object\x20dependency\x20table\x20missing\x20some\x20objects.\x20Design\x20decisions\x20based\x20on\x20incomplete\x20information.','detection':'Scan\x20project\x20environment\x20for\x20missing\x20object\x20references','recommendation':'Use\x20machine-context.ts\x20to\x20scan\x20complete\x20project\x20environment.','auto_fixable':![]}];export function assessMachineRisks(a,b){const c=[];c['push'](...checkStructuralRisks(a)),c['push'](...checkGuardIntegrationRisks(a,b)),c['push'](...checkPermissionRisks(a)),c['push'](...checkImmutabilityRisks(a,b)),c['push'](...checkEnvironmentRisks(a,b));const d={'critical':c['filter'](g=>g['severity']==='critical')['length'],'high':c['filter'](g=>g['severity']==='high')['length'],'medium':c['filter'](g=>g['severity']==='medium')['length'],'low':c['filter'](g=>g['severity']==='low')['length']};let e='low';if(d['critical']>0x0)e='critical';else{if(d['high']>0x0)e='high';else{if(d['medium']>0x0)e='medium';else{if(d['low']>0x0)e='low';}}}let f;if(d['critical']>0x0)f='do_not_publish';else d['high']>0x2?f='fix_first':f='publish';return{'overall_level':e,'detected_risks':c,'summary':d,'recommendation':f};}function checkStructuralRisks(a){const b=[],c=a['pairs']['some'](l=>l['prev_node']==='');!c&&b['push'](makeRisk('R-M1-01','No\x20Pair\x20with\x20prev_node=\x27\x27\x20found.\x20Workflow\x20cannot\x20start.'));const d=new Set(a['pairs']['map'](l=>l['prev_node'])['filter'](l=>l!=='')),e=new Set(a['nodes']['map'](l=>l['name'])),f=[...e]['filter'](l=>!d['has'](l));f['length']===0x0&&b['push'](makeRisk('R-M1-02','No\x20terminal\x20node\x20found.\x20Workflow\x20never\x20completes.'));const g=new Set(a['pairs']['filter'](l=>l['prev_node']==='')['map'](l=>l['next_node'])),h=new Set(a['pairs']['map'](l=>l['prev_node'])['filter'](l=>l!==''));for(const l of a['nodes']){if(!g['has'](l['name'])&&!h['has'](l['name'])){const m=a['pairs']['some'](n=>n['next_node']===l['name']);!m&&b['push'](makeRisk('R-M1-04','Node\x20\x22'+l['name']+'\x22\x20is\x20orphaned\x20(no\x20incoming\x20Pair).'));}}a['nodes']['length']>MAX_NODE_COUNT&&b['push'](makeRisk('R-M1-07','Node\x20count\x20'+a['nodes']['length']+'\x20exceeds\x20MAX_NODE_COUNT\x20('+MAX_NODE_COUNT+').'));const i=new Map();for(const n of a['pairs']){i['set'](n['next_node'],(i['get'](n['next_node'])??0x0)+0x1);}for(const [o,q]of i){q>0x28&&b['push'](makeRisk('R-M1-08','Node\x20\x22'+o+'\x22\x20has\x20'+q+'\x20Pairs,\x20exceeds\x20MAX_NODE_PAIR_COUNT\x20(40).'));}for(const r of a['pairs']){r['forwards']['length']>0x14&&b['push'](makeRisk('R-M1-09','Pair\x20('+r['prev_node']+'\x20->\x20'+r['next_node']+')\x20has\x20'+r['forwards']['length']+'\x20Forwards,\x20exceeds\x20MAX_FORWARD_COUNT\x20(20).'));}const j=a['nodes']['map'](s=>s['name']),k=j['filter']((s,t)=>j['indexOf'](s)!==t);return k['length']>0x0&&b['push'](makeRisk('R-M1-10','Duplicate\x20node\x20names:\x20'+[...new Set(k)]['join'](',\x20'))),b;}function checkGuardIntegrationRisks(a,b){const c=[];for(const d of a['pairs']){for(const e of d['forwards']){e['guard']&&!b['published_guards']['has'](e['guard'])&&c['push'](makeRisk('R-M2-01','Forward\x20\x22'+e['name']+'\x22\x20references\x20Guard\x20\x22'+e['guard']+'\x22\x20not\x20in\x20published_guards.')),e['retained_submission']&&!e['guard']&&c['push'](makeRisk('R-M2-04','Forward\x20\x22'+e['name']+'\x22\x20has\x20retained_submission\x20but\x20no\x20Guard.\x20retained_submission\x20requires\x20a\x20Guard.'));}}return c;}function checkPermissionRisks(a){const b=[];for(const c of a['pairs']){for(const d of c['forwards']){const e=d['named_operator']!==undefined&&d['named_operator']!==null,f=d['permission_index']!==undefined&&d['permission_index']!==null;!e&&!f&&b['push'](makeRisk('R-M3-01','Forward\x20\x22'+d['name']+'\x22\x20in\x20Pair\x20('+c['prev_node']+'\x20->\x20'+c['next_node']+')\x20has\x20no\x20permission.'));}}for(const g of a['pairs']){for(const h of g['forwards']){const i=h['named_operator']!==undefined&&h['named_operator']!==null,j=h['permission_index']!==undefined&&h['permission_index']!==null;i&&j&&b['push'](makeRisk('R-M3-07','Forward\x20\x22'+h['name']+'\x22\x20in\x20Pair\x20('+g['prev_node']+'\x20->\x20'+g['next_node']+')\x20has\x20both\x20namedOperator\x20and\x20permissionIndex\x20(OR\x20semantic).'));}}for(const k of a['pairs']){for(const l of k['forwards']){l['permission_index']!==undefined&&l['permission_index']!==null&&l['permission_index']<USER_DEFINED_PERM_INDEX_START&&b['push'](makeRisk('R-M3-08','Forward\x20\x22'+l['name']+'\x22\x20in\x20Pair\x20('+k['prev_node']+'\x20->\x20'+k['next_node']+')\x20'+('has\x20permission_index='+l['permission_index']+'\x20<\x20'+USER_DEFINED_PERM_INDEX_START+'.\x20')+'Indexes\x200-999\x20are\x20reserved\x20for\x20built-in\x20permissions.'));}}return b;}function checkImmutabilityRisks(a,b){const c=[];b['network']==='mainnet'&&!b['testnet_test_passed']&&c['push'](makeRisk('R-M4-02','Mainnet\x20publish\x20attempted\x20without\x20testnet\x20test\x20passing.'));const d=new Set();for(const f of a['pairs']){for(const g of f['forwards']){if(g['guard'])d['add'](g['guard']);}}const e=[...d]['filter'](h=>!b['published_guards']['has'](h));return e['length']>0x0&&c['push'](makeRisk('R-M4-03','Guards\x20not\x20all\x20created\x20before\x20publish.\x20Missing:\x20'+e['join'](',\x20'))),c;}function checkEnvironmentRisks(a,b){const c=[],d=new Set();for(const f of a['pairs']){for(const g of f['forwards']){if(g['guard'])d['add'](g['guard']);}}const e=[...d]['filter'](h=>!b['published_guards']['has'](h));return e['length']>0x0&&c['push'](makeRisk('R-M5-08','Object\x20dependency\x20table\x20incomplete.\x20Missing\x20Guards:\x20'+e['join'](',\x20'))),c;}function makeRisk(a,b){const c=MACHINE_RISK_RULES['find'](d=>d['id']===a);if(!c)return{'rule_id':a,'name':'Unknown','severity':'low','detail':b,'recommendation':'Investigate\x20manually.','auto_fixable':![]};return{'rule_id':c['id'],'name':c['name'],'severity':c['severity'],'detail':b,'recommendation':c['recommendation'],'auto_fixable':c['auto_fixable']};}export function getRiskRulesByCategory(a){return MACHINE_RISK_RULES['filter'](b=>b['category']===a);}export function getRiskRuleById(a){return MACHINE_RISK_RULES['find'](b=>b['id']===a);}export function getRiskRulesBySeverity(a){return MACHINE_RISK_RULES['filter'](b=>b['severity']===a);}export function getAutoFixableRules(){return MACHINE_RISK_RULES['filter'](a=>a['auto_fixable']);}export function getRiskSummary(a){const b=['Overall\x20Risk\x20Level:\x20'+a['overall_level']['toUpperCase'](),'Recommendation:\x20'+a['recommendation'],'','Summary:','\x20\x20Critical:\x20'+a['summary']['critical'],'\x20\x20High:\x20\x20\x20\x20\x20'+a['summary']['high'],'\x20\x20Medium:\x20\x20\x20'+a['summary']['medium'],'\x20\x20Low:\x20\x20\x20\x20\x20\x20'+a['summary']['low'],'','Detected\x20Risks:'];for(const c of a['detected_risks']){b['push']('\x20\x20['+c['severity']['toUpperCase']()+']\x20'+c['rule_id']+':\x20'+c['name']),b['push']('\x20\x20\x20\x20Detail:\x20'+c['detail']),b['push']('\x20\x20\x20\x20Fix:\x20'+c['recommendation']);}return b['join']('\x0a');}export const MACHINE_RISK_VERSION='1.0.0';export const MACHINE_RISK_RULES_COUNT=MACHINE_RISK_RULES['length'];
+import{USER_DEFINED_PERM_INDEX_START,MAX_NODE_COUNT}from'./onchain-constants.js';import{findUnachievableThresholds}from'./machine-topology.js';export const MACHINE_RISK_RULES=[{'id':'R-M1-01','name':'No\x20entry\x20point','category':'structural','severity':'critical','description':'Machine\x20has\x20no\x20Pair\x20with\x20prev_node=\x27\x27\x20(no\x20entry\x20point).\x20Workflow\x20cannot\x20start.','detection':'Check\x20if\x20any\x20pair\x20has\x20prev_node\x20===\x20\x27\x27','recommendation':'Add\x20at\x20least\x20one\x20Pair\x20with\x20prev_node=\x27\x27\x20to\x20serve\x20as\x20entry\x20point.','auto_fixable':![],'related_constraint':'MC-S-01'},{'id':'R-M1-02','name':'No\x20terminal\x20node','category':'structural','severity':'critical','description':'Machine\x20has\x20no\x20terminal\x20node\x20(all\x20nodes\x20have\x20outgoing\x20Pairs).\x20Workflow\x20never\x20completes.','detection':'Check\x20if\x20any\x20node\x20has\x20no\x20outgoing\x20Pair','recommendation':'Designate\x20at\x20least\x20one\x20node\x20as\x20terminal\x20(no\x20outgoing\x20Pair)\x20and\x20bind\x20Allocator\x20to\x20it.','auto_fixable':![],'related_constraint':'MC-S-02'},{'id':'R-M1-03','name':'Dead-end\x20node\x20(non-terminal)','category':'structural','severity':'medium','description':'Non-terminal\x20node\x20has\x20no\x20outgoing\x20Pair.\x20Workflow\x20stalls\x20at\x20this\x20node.','detection':'Find\x20nodes\x20with\x20no\x20outgoing\x20Pair\x20that\x20are\x20not\x20intended\x20terminals','recommendation':'Add\x20outgoing\x20Pair\x20or\x20designate\x20as\x20terminal\x20with\x20Allocator.','auto_fixable':![]},{'id':'R-M1-04','name':'Orphaned\x20node','category':'structural','severity':'high','description':'Node\x20has\x20no\x20incoming\x20Pair\x20(except\x20entry).\x20Unreachable.','detection':'Find\x20non-entry\x20nodes\x20with\x20no\x20incoming\x20Pair','recommendation':'Add\x20Pair\x20from\x20existing\x20node\x20to\x20this\x20orphaned\x20node,\x20or\x20remove\x20it.','auto_fixable':![],'related_constraint':'MC-S-03'},{'id':'R-M1-05','name':'Dead\x20branch\x20(competing\x20Pair\x20always\x20loses)','category':'structural','severity':'high','description':'A\x20competing\x20Pair\x27s\x20threshold\x20can\x20never\x20be\x20met\x20because\x20users\x20always\x20prefer\x20another\x20path.','detection':'Analyze\x20threshold\x20achievability\x20across\x20competing\x20Pairs','recommendation':'Make\x20thresholds\x20balanced,\x20or\x20remove\x20the\x20dead\x20branch.','auto_fixable':![],'related_constraint':'MC-S-04'},{'id':'R-M1-06','name':'Cycle\x20in\x20DAG','category':'structural','severity':'critical','description':'Workflow\x20has\x20a\x20cycle.\x20Nodes\x20reference\x20each\x20other\x20circularly.','detection':'DFS\x20cycle\x20detection','recommendation':'Break\x20the\x20cycle\x20by\x20removing\x20one\x20Pair.','auto_fixable':![],'related_constraint':'MC-S-05'},{'id':'R-M1-07','name':'Exceeds\x20MAX_NODE_COUNT\x20(100)','category':'structural','severity':'critical','description':'Node\x20count\x20exceeds\x20on-chain\x20limit.\x20Publish\x20will\x20fail.','detection':'nodes.length\x20>\x20'+MAX_NODE_COUNT,'recommendation':'Reduce\x20node\x20count\x20or\x20split\x20into\x20multiple\x20Machines.','auto_fixable':![],'related_constraint':'MC-C-01'},{'id':'R-M1-08','name':'Exceeds\x20MAX_NODE_PAIR_COUNT\x20(40)','category':'structural','severity':'high','description':'A\x20single\x20node\x27s\x20Pairs\x20exceed\x20on-chain\x20limit.\x20Publish\x20will\x20fail.','detection':'Find\x20node\x20where\x20pairs.length\x20>\x2040','recommendation':'Split\x20node\x20or\x20simplify\x20branches\x20to\x20reduce\x20Pair\x20count\x20per\x20node.','auto_fixable':![],'related_constraint':'MC-C-02'},{'id':'R-M1-09','name':'Exceeds\x20MAX_FORWARD_COUNT\x20(20)','category':'structural','severity':'high','description':'A\x20single\x20Pair\x27s\x20Forwards\x20exceed\x20on-chain\x20limit.\x20Publish\x20will\x20fail.','detection':'Find\x20Pair\x20where\x20forwards.length\x20>\x2020','recommendation':'Split\x20Pair\x20or\x20merge\x20Forwards\x20to\x20reduce\x20Forward\x20count\x20per\x20Pair.','auto_fixable':![],'related_constraint':'MC-C-03'},{'id':'R-M1-10','name':'Duplicate\x20node\x20name','category':'structural','severity':'critical','description':'Two\x20nodes\x20have\x20the\x20same\x20name.\x20On-chain\x20will\x20reject.','detection':'Find\x20duplicate\x20names\x20in\x20nodes\x20array','recommendation':'Rename\x20one\x20of\x20the\x20duplicates.','auto_fixable':![],'related_constraint':'MC-C-04'},{'id':'R-M1-11','name':'Dispute\x20anti-pattern\x20—\x20machine\x20illegally\x20models\x20dispute\x20flow','category':'structural','severity':'critical','description':'Machine\x20contains\x20nodes\x20named\x20\x27disputed\x27,\x20\x27refunded\x27,\x20\x27arb\x27,\x20\x27arbitration\x27,\x20'+'\x27dispute\x27,\x20or\x20\x27refund\x27.\x20This\x20is\x20a\x20CRITICAL\x20design\x20anti-pattern\x20because\x20'+'dispute\x20is\x20INDEPENDENT\x20of\x20the\x20machine\x20workflow.\x20Dispute\x20flows\x20through:\x20'+'Order\x20→\x20Arbitration.dispute()\x20→\x20Arb\x20object\x20→\x20arbitration()\x20ruling\x20→\x20'+'arb_withdraw\x20by\x20order\x20holder.\x20Arbitrators\x20are\x20configured\x20in\x20'+'Arbitration.voting_guard,\x20NOT\x20in\x20Permission.\x20Merchants\x20who\x20model\x20'+'dispute\x20in\x20the\x20machine\x20(e.g.,\x20\x27disputed\x20→\x20refunded\x27\x20forward\x20guarded\x20'+'by\x20Permission\x20index\x201500)\x20create\x20dead-end\x20paths\x20because\x20no\x20one\x20has\x20'+'Permission\x201500\x20—\x20arbitrators\x20are\x20NOT\x20Permission\x20holders.','detection':'Match\x20node\x20names\x20against\x20regex\x20/(^|_)(disputed?|refund(?:ed)?|arbitration|arb)(_|$)/i\x20'+'(catches\x20both\x20exact\x20names\x20like\x20\x27refunded\x27\x20and\x20compound\x20fund-flow\x20terminals\x20like\x20'+'\x27deposit_refunded\x27/\x27deposit_deducted\x27;\x20business\x20states\x20like\x20\x27return_approved\x27/'+'\x27damage_confirmed\x27/\x27cancelled\x27/\x27returned\x27\x20do\x20NOT\x20match)','recommendation':'Remove\x20all\x20dispute/refund\x20nodes\x20from\x20the\x20machine.\x20Instead:\x20(1)\x20bind\x20an\x20'+'Arbitration\x20object\x20to\x20the\x20Service\x20via\x20Service.arbitrations,\x20(2)\x20configure\x20'+'arbitrators\x20via\x20Arbitration.voting_guard_add,\x20(3)\x20deposit\x20compensation_fund\x20'+'to\x20the\x20Service.\x20Disputes\x20are\x20then\x20filed\x20via\x20arbitration::dispute(order,\x20'+'arbitration)\x20—\x20completely\x20independent\x20of\x20the\x20machine\x20workflow.','auto_fixable':![]},{'id':'R-M1-12','name':'Unreachable\x20threshold\x20—\x20Pair\x20can\x20never\x20migrate','category':'structural','severity':'critical','description':'A\x20Pair\x27s\x20threshold\x20exceeds\x20the\x20sum\x20of\x20its\x20forward\x20weights.\x20Each\x20forward\x20'+'contributes\x20its\x20weight\x20AT\x20MOST\x20ONCE:\x20it\x20is\x20locked\x20by\x20the\x20first\x20operator\x20that\x20'+'accomplishes\x20it\x20(progress.move\x20session_accomplish_imp),\x20and\x20a\x20second\x20operator\x20'+'re-executing\x20the\x20same\x20forward\x20aborts\x20E_NOT_THE_HOLDER.\x20The\x20maximum\x20achievable\x20'+'weight\x20of\x20a\x20Pair\x20is\x20therefore\x20the\x20sum\x20of\x20its\x20DISTINCT\x20forward\x20weights.\x20When\x20'+'that\x20sum\x20<\x20threshold,\x20the\x20transition\x20can\x20never\x20migrate\x20and\x20the\x20workflow\x20is\x20'+'permanently\x20stuck\x20at\x20this\x20node.','detection':'For\x20each\x20Pair\x20compute\x20sum(forward.weight)\x20and\x20compare\x20with\x20threshold;\x20flag\x20'+'Pairs\x20where\x20sum\x20<\x20threshold\x20(use\x20machine-topology\x20findUnachievableThresholds).','recommendation':'Raise\x20forward\x20weights\x20so\x20sum(weights)\x20>=\x20threshold,\x20or\x20lower\x20the\x20threshold.\x20'+'For\x20multi-operator\x20cooperation\x20add\x20one\x20DISTINCT\x20forward\x20per\x20contributing\x20'+'operator\x20(threshold\x20N\x20needs\x20N\x20distinct\x20forwards,\x20each\x20weight\x20≥\x201).','auto_fixable':![],'related_constraint':'MC-S-04'},{'id':'R-M1-13','name':'Single-forward\x20multi-operator\x20misuse\x20—\x20threshold\x20>\x201\x20with\x20too\x20few\x20forwards','category':'structural','severity':'high','description':'A\x20Pair\x20with\x20threshold\x20>\x201\x20has\x20fewer\x20distinct\x20forwards\x20than\x20the\x20threshold\x20'+'(with\x20weight-1\x20forwards,\x20or\x20a\x20single\x20forward\x20that\x20can\x20only\x20ever\x20be\x20accomplished\x20'+'by\x20ONE\x20operator).\x20Because\x20a\x20forward\x20is\x20single-operator-locked,\x20N\x20different\x20'+'people\x20cannot\x20all\x20\x27execute\x20the\x20same\x20forward\x27\x20—\x20each\x20contributor\x20needs\x20their\x20OWN\x20'+'forward\x20in\x20the\x20Pair.\x20This\x20either\x20makes\x20the\x20transition\x20unreachable\x20or\x20forces\x20a\x20'+'single\x20operator\x20to\x20control\x20multiple\x20forwards\x20(defeating\x20the\x20cooperation\x20design).','detection':'Flag\x20Pairs\x20where\x20threshold\x20>\x201\x20and\x20the\x20count\x20of\x20distinct\x20forwards\x20<\x20threshold\x20'+'(i.e.\x20threshold\x20cannot\x20be\x20met\x20by\x20that\x20many\x20different\x20operators).','recommendation':'Model\x20cooperation\x20with\x20parallel\x20forwards:\x20Pair\x20{\x20threshold:\x20N,\x20forwards:\x20['+'begin_a\x20(weight\x201,\x20operator\x20A),\x20begin_b\x20(weight\x201,\x20operator\x20B),\x20...]\x20}\x20—\x20one\x20'+'distinct\x20forward\x20per\x20contributing\x20operator.','auto_fixable':![],'related_constraint':'MC-S-04'},{'id':'R-M2-01','name':'Guard\x20not\x20created','category':'guard_integration','severity':'critical','description':'Forward\x20references\x20a\x20Guard\x20that\x20is\x20not\x20yet\x20created\x20on-chain.\x20Forward\x20execution\x20will\x20fail\x20Guard\x20verification.','detection':'Check\x20forward.guard\x20against\x20published_guards\x20set','recommendation':'Create\x20the\x20Guard\x20object\x20before\x20publishing\x20this\x20Machine.','auto_fixable':![],'related_constraint':'MC-C-09'},{'id':'R-M2-02','name':'Guard\x20not\x20tested\x20via\x20gen_passport','category':'guard_integration','severity':'high','description':'Guard\x20has\x20not\x20been\x20tested\x20via\x20gen_passport.\x20Guard\x20may\x20have\x20bugs,\x20cannot\x20be\x20fixed\x20after\x20publish.','detection':'Check\x20testnet\x20test\x20records\x20for\x20this\x20Guard','recommendation':'Run\x20gen_passport\x20on\x20testnet\x20before\x20binding\x20to\x20Machine.','auto_fixable':![]},{'id':'R-M2-03','name':'Guard\x20+\x20Machine\x20immutability\x20deadlock','category':'guard_integration','severity':'critical','description':'After\x20Machine\x20publish,\x20a\x20Guard\x20bug\x20is\x20discovered.\x20Guard\x20is\x20immutable\x20(cannot\x20be\x20fixed),\x20Machine\x20is\x20immutable\x20(cannot\x20be\x20rebound).','detection':'Verify\x20all\x20Guards\x20tested\x20before\x20Machine\x20publish','recommendation':'Keep\x20Machine\x20unpublished\x20until\x20all\x20Guards\x20are\x20verified.','auto_fixable':![]},{'id':'R-M2-04','name':'retained_submission\x20index\x20mismatch','category':'guard_integration','severity':'high','description':'Forward\x27s\x20retained_submission\x20key\x20does\x20not\x20correspond\x20to\x20Guard\x20table\x20b_submission=true\x20entry.\x20Retained\x20data\x20fails\x20or\x20is\x20incorrect.','detection':'Cross-check\x20forward.retained_submission\x20against\x20Guard\x20table\x20entries','recommendation':'Align\x20retained_submission\x20key\x20with\x20Guard\x20table\x20b_submission=true\x20identifier.','auto_fixable':!![],'related_constraint':'MC-C-11'},{'id':'R-M2-05','name':'Guard\x20reentry\x20risk','category':'guard_integration','severity':'high','description':'Guard\x20lacks\x20anti-reentry\x20mechanism\x20(see\x20Guard\x20R-X1-14).\x20Risk\x20of\x20duplicate\x20execution\x20or\x20vote\x20manipulation.','detection':'For\x20each\x20Guard\x20scene,\x20verify\x20anti-reentry\x20Guard\x20is\x20configured\x20(see\x20Guard\x20semantic\x20layer\x20R-X1-14)','recommendation':'Add\x20anti-reentry\x20Guard\x20for\x20each\x20scenario\x20(see\x20Guard\x20semantic\x20layer\x20R-X1-14).','auto_fixable':![]},{'id':'R-M2-06','name':'Guard\x20scene\x20mismatch','category':'guard_integration','severity':'medium','description':'Forward\x27s\x20bound\x20Guard\x20scene\x20does\x20not\x20match\x20Forward\x27s\x20business\x20(e.g.,\x20Forward\x20uses\x20reward_guard\x20instead\x20of\x20machine_forward_guard).','detection':'Cross-check\x20Guard\x20scene\x20against\x20Forward\x20business\x20purpose','recommendation':'Use\x20the\x20correct\x20Guard\x20scene\x20(machine_forward_guard).','auto_fixable':![]},{'id':'R-M2-07','name':'Cross-Machine\x20Guard\x20dependency\x20cycle','category':'guard_integration','severity':'critical','description':'Machine\x20A\x20depends\x20on\x20Machine\x20B\x20(via\x20Guard),\x20B\x20depends\x20on\x20A.\x20Circular\x20dependency.','detection':'Identify\x20cross-Machine\x20Guard\x20references\x20and\x20detect\x20cycles','recommendation':'Ensure\x20cross-Machine\x20dependencies\x20are\x20unidirectional.','auto_fixable':![]},{'id':'R-M2-08','name':'Guard\x20references\x20unpublished\x20object','category':'guard_integration','severity':'high','description':'Guard\x20table\x20references\x20an\x20object\x20(e.g.,\x20Service)\x20that\x20is\x20not\x20yet\x20published.','detection':'Cross-check\x20Guard\x20table\x20object\x20references\x20against\x20published\x20objects\x20set','recommendation':'Use\x20P16\x20circular\x20reference\x20pattern\x20(name\x20instead\x20of\x20address),\x20or\x20publish\x20referenced\x20objects\x20first.','auto_fixable':![]},{'id':'R-M3-01','name':'Forward\x20without\x20permission','category':'permission','severity':'critical','description':'Forward\x20has\x20neither\x20namedOperator\x20nor\x20permissionIndex.\x20Cannot\x20be\x20executed.','detection':'Check\x20each\x20forward\x20has\x20at\x20least\x20one\x20of\x20namedOperator\x20or\x20permissionIndex','recommendation':'Set\x20namedOperator=\x27\x27\x20for\x20OrderHolder,\x20or\x20set\x20permissionIndex.','auto_fixable':![],'related_constraint':'MC-C-07'},{'id':'R-M3-02','name':'permissionIndex\x20out\x20of\x20bounds','category':'permission','severity':'critical','description':'Forward\x27s\x20permissionIndex\x20>=\x20Permission.indices.length.\x20Execution\x20will\x20fail.','detection':'Check\x20permission_index\x20<\x20Permission.indices.length','recommendation':'Use\x20a\x20valid\x20permission\x20index\x20or\x20extend\x20Permission.indices.','auto_fixable':![],'related_constraint':'MC-C-08'},{'id':'R-M3-03','name':'Permission\x20rotation\x20failure','category':'permission','severity':'high','description':'Permission\x20object\x20updated,\x20indices\x20order\x20changed.\x20Original\x20permissionIndex\x20now\x20points\x20to\x20wrong\x20permission.','detection':'Detect\x20Permission\x20object\x20update\x20that\x20reorders\x20indices','recommendation':'Use\x20custom\x20Permission;\x20document\x20index\x20meanings;\x20avoid\x20frequent\x20Permission\x20updates.','auto_fixable':![]},{'id':'R-M3-04','name':'OrderHolder\x20misuse','category':'permission','severity':'medium','description':'namedOperator=\x27\x27\x20used\x20in\x20non-customer-operation\x20scenarios.\x20Non-intended\x20personnel\x20gain\x20operation\x20permission.','detection':'Find\x20Forwards\x20with\x20namedOperator=\x27\x27\x20on\x20non-customer-operation\x20nodes','recommendation':'Clarify\x20\x27\x27=OrderHolder\x20(customer),\x20not\x20\x27anyone\x27.\x20Use\x20namedOperator\x20for\x20specific\x20roles.','auto_fixable':![]},{'id':'R-M3-05','name':'NamedOperator\x20not\x20assigned\x20at\x20Progress\x20creation','category':'permission','severity':'high','description':'Forward\x20expects\x20namedOperator\x20role\x20but\x20Progress\x20doesn\x27t\x20have\x20it\x20assigned.\x20'+'Note:\x20MCP\x20API\x20layer\x20supports\x20progress_new.progress_namedOperator\x20(SDK\x20translates\x20to\x20namedOperator_add),\x20'+'but\x20Move\x20layer\x20progress::new\x20does\x20NOT\x20accept\x20it\x20(see\x2006\x20§14.5).','detection':'Verify\x20progress_namedOperator\x20is\x20provided\x20in\x20Progress\x20creation','recommendation':'Pass\x20progress_namedOperator\x20in\x20progress_new,\x20or\x20call\x20namedOperator_add\x20separately.','auto_fixable':![]},{'id':'R-M3-06','name':'Permission\x20game\x20imbalance','category':'permission','severity':'medium','description':'One\x20party\x20has\x20excessive\x20permission,\x20can\x20unilaterally\x20advance\x20workflow.\x20Game\x20theory\x20imbalance.','detection':'Analyze\x20permission\x20distribution\x20across\x20parties','recommendation':'Use\x20dual-signature\x20(threshold=2)\x20or\x20multi-signature\x20mechanism\x20to\x20balance\x20power.','auto_fixable':![]},{'id':'R-M3-07','name':'Permission\x20combination\x20OR\x20semantic\x20misuse','category':'permission','severity':'medium','description':'Both\x20namedOperator\x20and\x20permissionIndex\x20set,\x20but\x20OR\x20semantic\x20not\x20understood.\x20More\x20people\x20than\x20expected\x20can\x20execute\x20Forward.','detection':'Find\x20Forwards\x20with\x20both\x20namedOperator\x20and\x20permissionIndex\x20set','recommendation':'Clarify\x20that\x20when\x20both\x20permissions\x20are\x20non-null,\x20it\x20is\x20OR\x20relation\x20(either\x20can\x20execute).','auto_fixable':![]},{'id':'R-M3-08','name':'permissionIndex\x20below\x20USER_DEFINED_PERM_INDEX_START\x20(1000)','category':'permission','severity':'critical','description':'Forward\x27s\x20permissionIndex\x20<\x201000.\x20On-chain\x20constant\x20USER_DEFINED_PERM_INDEX_START\x20=\x201000\x20'+'in\x20permission.move\x20reserves\x20indexes\x200-999\x20for\x20built-in\x20permissions.\x20Using\x20index\x20<\x201000\x20'+'causes\x20confusion\x20with\x20built-in\x20permissions\x20and\x20is\x20a\x20hard\x20on-chain\x20constraint\x20(see\x20doc\x2006\x20§4.4).','detection':'Check\x20each\x20forward\x20with\x20permission_index\x20<\x201000','recommendation':'Use\x20permission_index\x20>=\x201000\x20(e.g.,\x201000,\x201001,\x201002,\x20...).\x20Reserve\x200-999\x20for\x20built-in\x20permissions.','auto_fixable':![],'related_constraint':'MC-C-08'},{'id':'R-M4-01','name':'No\x20backup\x20before\x20publish','category':'immutability','severity':'high','description':'machineNode2file\x20export\x20not\x20created\x20before\x20publish.\x20Cannot\x20restore\x20if\x20publish\x20fails.','detection':'Check\x20backup_created\x20flag','recommendation':'Run\x20machineNode2file\x20before\x20publish\x20to\x20create\x20backup.','auto_fixable':!![],'related_constraint':'MC-P-02'},{'id':'R-M4-02','name':'No\x20testnet\x20verification\x20before\x20mainnet','category':'immutability','severity':'medium','description':'Directly\x20publishing\x20to\x20mainnet\x20without\x20testnet\x20verification.\x20Potential\x20bugs\x20may\x20cause\x20fund\x20loss.','detection':'Check\x20network\x20===\x20\x27mainnet\x27\x20&&\x20!testnet_test_passed','recommendation':'Test\x20on\x20testnet\x20first.\x20Verify\x20Progress\x20runs\x20end-to-end.','auto_fixable':![],'related_constraint':'MC-P-03'},{'id':'R-M4-03','name':'Guards\x20not\x20all\x20created\x20before\x20publish','category':'immutability','severity':'critical','description':'Some\x20Forward.guard\x20is\x20still\x20null,\x20but\x20design\x20requires\x20Guard.\x20Cannot\x20add\x20Guard\x20after\x20publish\x20(immutability\x20deadlock).','detection':'Check\x20if\x20all\x20required\x20Guards\x20are\x20created\x20and\x20bound','recommendation':'Create\x20and\x20bind\x20all\x20Guards\x20before\x20publishing\x20Machine.','auto_fixable':![]},{'id':'R-M4-04','name':'Publish\x20order\x20incorrect','category':'immutability','severity':'critical','description':'Attempting\x20to\x20publish\x20Machine\x20before\x20creating\x20Guards.\x20Guards\x20cannot\x20bind\x20to\x20already-published\x20Machine.','detection':'Verify\x20dependency\x20order:\x20Permission\x20→\x20Machine(unpublished)\x20→\x20Guard\x20→\x20bind\x20→\x20publish','recommendation':'Follow\x20dependency\x20order:\x20Permission\x20→\x20Machine(unpublished)\x20→\x20Guard\x20→\x20bind\x20→\x20publish.','auto_fixable':![]},{'id':'R-M4-05','name':'Allocation\x20not\x20configured','category':'immutability','severity':'medium','description':'Terminal\x20node\x20not\x20mapped\x20to\x20Allocator.\x20Funds\x20cannot\x20be\x20distributed\x20after\x20workflow\x20completes.','detection':'Check\x20if\x20terminal\x20nodes\x20have\x20Allocator\x20mapping','recommendation':'Configure\x20Allocator\x20for\x20each\x20terminal\x20node.','auto_fixable':![]},{'id':'R-M4-06','name':'clear\x20operation\x20without\x20backup','category':'immutability','severity':'high','description':'Executing\x20node\x20clear\x20before\x20exporting\x20backup.\x20All\x20node\x20data\x20lost,\x20cannot\x20recover.','detection':'Check\x20if\x20machineNode2file\x20backup\x20created\x20before\x20clear\x20operation','recommendation':'Run\x20machineNode2file\x20backup\x20before\x20any\x20clear\x20operation.','auto_fixable':!![]},{'id':'R-M5-01','name':'Service\x20not\x20created','category':'environment','severity':'high','description':'Machine\x20design\x20complete\x20but\x20Service\x20not\x20created.\x20Machine\x20cannot\x20bind\x20to\x20Service.','detection':'Check\x20if\x20Service\x20object\x20is\x20in\x20published_services\x20set','recommendation':'Create\x20Service\x20first,\x20then\x20design/publish\x20Machine.','auto_fixable':![]},{'id':'R-M5-02','name':'Permission\x20object\x20mismatch','category':'environment','severity':'high','description':'Machine\x27s\x20Permission\x20differs\x20from\x20Service\x27s\x20Permission.\x20Permission\x20organization\x20inconsistent,\x20may\x20cause\x20operation\x20failure.','detection':'Cross-check\x20Machine\x27s\x20Permission\x20against\x20Service\x27s\x20Permission','recommendation':'Use\x20the\x20same\x20Permission\x20for\x20Machine\x20and\x20Service\x20(or\x20explicitly\x20document\x20different\x20organizations).','auto_fixable':![]},{'id':'R-M5-03','name':'Allocation\x20configuration\x20incomplete','category':'environment','severity':'high','description':'Service\x27s\x20order_allocators\x20not\x20configured\x20or\x20misconfigured.\x20Terminal\x20node\x20funds\x20cannot\x20be\x20distributed.','detection':'Check\x20if\x20Service.order_allocators\x20is\x20configured\x20for\x20each\x20terminal\x20node','recommendation':'Configure\x20Service.order_allocators,\x20one\x20Allocator\x20per\x20terminal\x20node.','auto_fixable':![]},{'id':'R-M5-04','name':'Reward\x20object\x20not\x20created','category':'environment','severity':'medium','description':'Reward\x20incentive\x20scenario\x20referenced\x20but\x20Reward\x20object\x20not\x20created.','detection':'Check\x20if\x20Reward\x20object\x20is\x20in\x20published_rewards\x20set','recommendation':'Create\x20Reward\x20object\x20first,\x20then\x20design\x20Guard.','auto_fixable':![]},{'id':'R-M5-05','name':'Arbitration\x20object\x20not\x20created','category':'environment','severity':'medium','description':'Arbitration\x20scenario\x20referenced\x20but\x20Arbitration\x20object\x20not\x20created.','detection':'Check\x20if\x20Arbitration\x20object\x20is\x20in\x20published_arbitrations\x20set','recommendation':'Create\x20Arbitration\x20object\x20first.','auto_fixable':![]},{'id':'R-M5-06','name':'Cross-Machine\x20dependency\x20not\x20published','category':'environment','severity':'critical','description':'Machine\x20A\x20depends\x20on\x20Machine\x20B,\x20but\x20B\x20is\x20not\x20published.\x20Guard\x20query\x20for\x20Machine\x20B\x27s\x20Progress\x20will\x20fail.\x20'+'Dependency\x20verification:\x20indirect\x20via\x20progress::new\x20->\x20assert_published\x20(see\x2006\x20§14.6).','detection':'Check\x20machine_ref\x20against\x20published_machines\x20set','recommendation':'Ensure\x20upstream\x20Machine\x20is\x20published\x20first.','auto_fixable':![]},{'id':'R-M5-07','name':'Repository\x20not\x20created','category':'environment','severity':'medium','description':'Guard\x20references\x20Repository\x20but\x20not\x20created.\x20Guard\x20query\x20will\x20fail.','detection':'Check\x20repository_ref\x20against\x20published\x20repositories\x20set','recommendation':'Create\x20and\x20publish\x20Repository\x20first.\x20Note:\x20consensus_repositories\x20is\x20declarative-only\x20(see\x2006\x20§14.4).','auto_fixable':![]},{'id':'R-M5-08','name':'Object\x20dependency\x20table\x20incomplete','category':'environment','severity':'low','description':'Project\x20object\x20dependency\x20table\x20missing\x20some\x20objects.\x20Design\x20decisions\x20based\x20on\x20incomplete\x20information.','detection':'Scan\x20project\x20environment\x20for\x20missing\x20object\x20references','recommendation':'Use\x20machine-context.ts\x20to\x20scan\x20complete\x20project\x20environment.','auto_fixable':![]}];export function assessMachineRisks(a,b){const c=[];c['push'](...checkStructuralRisks(a)),c['push'](...checkGuardIntegrationRisks(a,b)),c['push'](...checkPermissionRisks(a)),c['push'](...checkImmutabilityRisks(a,b)),c['push'](...checkEnvironmentRisks(a,b));const d={'critical':c['filter'](g=>g['severity']==='critical')['length'],'high':c['filter'](g=>g['severity']==='high')['length'],'medium':c['filter'](g=>g['severity']==='medium')['length'],'low':c['filter'](g=>g['severity']==='low')['length']};let e='low';if(d['critical']>0x0)e='critical';else{if(d['high']>0x0)e='high';else{if(d['medium']>0x0)e='medium';else{if(d['low']>0x0)e='low';}}}let f;if(d['critical']>0x0)f='do_not_publish';else d['high']>0x2?f='fix_first':f='publish';return{'overall_level':e,'detected_risks':c,'summary':d,'recommendation':f};}function checkStructuralRisks(a){const b=[],c=a['pairs']['some'](m=>m['prev_node']==='');!c&&b['push'](makeRisk('R-M1-01','No\x20Pair\x20with\x20prev_node=\x27\x27\x20found.\x20Workflow\x20cannot\x20start.'));const d=new Set(a['pairs']['map'](m=>m['prev_node'])['filter'](m=>m!=='')),e=new Set(a['nodes']['map'](m=>m['name'])),f=[...e]['filter'](m=>!d['has'](m));f['length']===0x0&&b['push'](makeRisk('R-M1-02','No\x20terminal\x20node\x20found.\x20Workflow\x20never\x20completes.'));const g=new Set(a['pairs']['filter'](m=>m['prev_node']==='')['map'](m=>m['next_node'])),h=new Set(a['pairs']['map'](m=>m['prev_node'])['filter'](m=>m!==''));for(const m of a['nodes']){if(!g['has'](m['name'])&&!h['has'](m['name'])){const n=a['pairs']['some'](o=>o['next_node']===m['name']);!n&&b['push'](makeRisk('R-M1-04','Node\x20\x22'+m['name']+'\x22\x20is\x20orphaned\x20(no\x20incoming\x20Pair).'));}}a['nodes']['length']>MAX_NODE_COUNT&&b['push'](makeRisk('R-M1-07','Node\x20count\x20'+a['nodes']['length']+'\x20exceeds\x20MAX_NODE_COUNT\x20('+MAX_NODE_COUNT+').'));const i=new Map();for(const o of a['pairs']){i['set'](o['next_node'],(i['get'](o['next_node'])??0x0)+0x1);}for(const [q,r]of i){r>0x28&&b['push'](makeRisk('R-M1-08','Node\x20\x22'+q+'\x22\x20has\x20'+r+'\x20Pairs,\x20exceeds\x20MAX_NODE_PAIR_COUNT\x20(40).'));}for(const s of a['pairs']){s['forwards']['length']>0x14&&b['push'](makeRisk('R-M1-09','Pair\x20('+s['prev_node']+'\x20->\x20'+s['next_node']+')\x20has\x20'+s['forwards']['length']+'\x20Forwards,\x20exceeds\x20MAX_FORWARD_COUNT\x20(20).'));}const j=a['nodes']['map'](t=>t['name']),k=j['filter']((t,v)=>j['indexOf'](t)!==v);k['length']>0x0&&b['push'](makeRisk('R-M1-10','Duplicate\x20node\x20names:\x20'+[...new Set(k)]['join'](',\x20')));const l=findUnachievableThresholds(a['pairs']);for(const t of l){const v=t['threshold']>0x1&&t['distinct_forwards']<t['threshold'];b['push'](makeRisk(v?'R-M1-13':'R-M1-12','Pair\x20('+(t['prev_node']===''?'entry':t['prev_node'])+'\x20->\x20'+t['next_node']+'):\x20'+t['reason']));}return b;}function checkGuardIntegrationRisks(a,b){const c=[];for(const d of a['pairs']){for(const e of d['forwards']){e['guard']&&!b['published_guards']['has'](e['guard'])&&c['push'](makeRisk('R-M2-01','Forward\x20\x22'+e['name']+'\x22\x20references\x20Guard\x20\x22'+e['guard']+'\x22\x20not\x20in\x20published_guards.')),e['retained_submission']&&!e['guard']&&c['push'](makeRisk('R-M2-04','Forward\x20\x22'+e['name']+'\x22\x20has\x20retained_submission\x20but\x20no\x20Guard.\x20retained_submission\x20requires\x20a\x20Guard.'));}}return c;}function checkPermissionRisks(a){const b=[];for(const c of a['pairs']){for(const d of c['forwards']){const e=d['named_operator']!==undefined&&d['named_operator']!==null,f=d['permission_index']!==undefined&&d['permission_index']!==null;!e&&!f&&b['push'](makeRisk('R-M3-01','Forward\x20\x22'+d['name']+'\x22\x20in\x20Pair\x20('+c['prev_node']+'\x20->\x20'+c['next_node']+')\x20has\x20no\x20permission.'));}}for(const g of a['pairs']){for(const h of g['forwards']){const i=h['named_operator']!==undefined&&h['named_operator']!==null,j=h['permission_index']!==undefined&&h['permission_index']!==null;i&&j&&b['push'](makeRisk('R-M3-07','Forward\x20\x22'+h['name']+'\x22\x20in\x20Pair\x20('+g['prev_node']+'\x20->\x20'+g['next_node']+')\x20has\x20both\x20namedOperator\x20and\x20permissionIndex\x20(OR\x20semantic).'));}}for(const k of a['pairs']){for(const l of k['forwards']){l['permission_index']!==undefined&&l['permission_index']!==null&&l['permission_index']<USER_DEFINED_PERM_INDEX_START&&b['push'](makeRisk('R-M3-08','Forward\x20\x22'+l['name']+'\x22\x20in\x20Pair\x20('+k['prev_node']+'\x20->\x20'+k['next_node']+')\x20'+('has\x20permission_index='+l['permission_index']+'\x20<\x20'+USER_DEFINED_PERM_INDEX_START+'.\x20')+'Indexes\x200-999\x20are\x20reserved\x20for\x20built-in\x20permissions.'));}}return b;}function checkImmutabilityRisks(a,b){const c=[];b['network']==='mainnet'&&!b['testnet_test_passed']&&c['push'](makeRisk('R-M4-02','Mainnet\x20publish\x20attempted\x20without\x20testnet\x20test\x20passing.'));const d=new Set();for(const f of a['pairs']){for(const g of f['forwards']){if(g['guard'])d['add'](g['guard']);}}const e=[...d]['filter'](h=>!b['published_guards']['has'](h));return e['length']>0x0&&c['push'](makeRisk('R-M4-03','Guards\x20not\x20all\x20created\x20before\x20publish.\x20Missing:\x20'+e['join'](',\x20'))),c;}function checkEnvironmentRisks(a,b){const c=[],d=new Set();for(const f of a['pairs']){for(const g of f['forwards']){if(g['guard'])d['add'](g['guard']);}}const e=[...d]['filter'](h=>!b['published_guards']['has'](h));return e['length']>0x0&&c['push'](makeRisk('R-M5-08','Object\x20dependency\x20table\x20incomplete.\x20Missing\x20Guards:\x20'+e['join'](',\x20'))),c;}function makeRisk(a,b){const c=MACHINE_RISK_RULES['find'](d=>d['id']===a);if(!c)return{'rule_id':a,'name':'Unknown','severity':'low','detail':b,'recommendation':'Investigate\x20manually.','auto_fixable':![]};return{'rule_id':c['id'],'name':c['name'],'severity':c['severity'],'detail':b,'recommendation':c['recommendation'],'auto_fixable':c['auto_fixable']};}export function getRiskRulesByCategory(a){return MACHINE_RISK_RULES['filter'](b=>b['category']===a);}export function getRiskRuleById(a){return MACHINE_RISK_RULES['find'](b=>b['id']===a);}export function getRiskRulesBySeverity(a){return MACHINE_RISK_RULES['filter'](b=>b['severity']===a);}export function getAutoFixableRules(){return MACHINE_RISK_RULES['filter'](a=>a['auto_fixable']);}export function getRiskSummary(a){const b=['Overall\x20Risk\x20Level:\x20'+a['overall_level']['toUpperCase'](),'Recommendation:\x20'+a['recommendation'],'','Summary:','\x20\x20Critical:\x20'+a['summary']['critical'],'\x20\x20High:\x20\x20\x20\x20\x20'+a['summary']['high'],'\x20\x20Medium:\x20\x20\x20'+a['summary']['medium'],'\x20\x20Low:\x20\x20\x20\x20\x20\x20'+a['summary']['low'],'','Detected\x20Risks:'];for(const c of a['detected_risks']){b['push']('\x20\x20['+c['severity']['toUpperCase']()+']\x20'+c['rule_id']+':\x20'+c['name']),b['push']('\x20\x20\x20\x20Detail:\x20'+c['detail']),b['push']('\x20\x20\x20\x20Fix:\x20'+c['recommendation']);}return b['join']('\x0a');}export const MACHINE_RISK_VERSION='1.0.0';export const MACHINE_RISK_RULES_COUNT=MACHINE_RISK_RULES['length'];

package/dist/knowledge/machine-topology.d.ts

@@ -22,6 +22,7 @@ export interface MachineTopology {
     orphaned_nodes: string[];
     dead_end_nodes: string[];
     dead_branches: DeadBranch[];
+    unachievable_thresholds: UnachievableThreshold[];
     has_cycles: boolean;
     cycle_nodes: string[][];
     reachability: Map<string, Set<string>>;
@@ -33,8 +34,17 @@ export interface MachineTopology {
         max_node_pair_count: boolean;
         max_forward_count: boolean;
         max_forward_order_count: boolean;
+        threshold_achievable: boolean;
     };
 }
+export interface UnachievableThreshold {
+    prev_node: string;
+    next_node: string;
+    threshold: number;
+    max_achievable: number;
+    distinct_forwards: number;
+    reason: string;
+}
 export interface DeadBranch {
     pair: {
         prev_node: string;
@@ -46,6 +56,7 @@ export interface DeadBranch {
 import { MAX_NODE_COUNT, MAX_NODE_PAIR_COUNT, MAX_FORWARD_COUNT, MAX_FORWARD_ORDER_COUNT } from "./onchain-constants.js";
 export { MAX_NODE_COUNT, MAX_NODE_PAIR_COUNT, MAX_FORWARD_COUNT, MAX_FORWARD_ORDER_COUNT, };
 export declare function analyzeTopology(nodes: MachineNode[], pairs: MachinePair[]): MachineTopology;
+export declare function findUnachievableThresholds(pairs: MachinePair[]): UnachievableThreshold[];
 export declare function detectCycle(nodes: MachineNode[], pairs: MachinePair[]): {
     has_cycles: boolean;
     cycle_nodes: string[][];

package/dist/knowledge/machine-topology.js

@@ -1 +1 @@
-import{MAX_NODE_COUNT,MAX_NODE_PAIR_COUNT,MAX_FORWARD_COUNT,MAX_FORWARD_ORDER_COUNT}from'./onchain-constants.js';export{MAX_NODE_COUNT,MAX_NODE_PAIR_COUNT,MAX_FORWARD_COUNT,MAX_FORWARD_ORDER_COUNT};export function analyzeTopology(a,b){const c=a['map'](s=>s['name']),d=new Set(c),e=new Map(),f=new Map();for(const s of c){e['set'](s,[]),f['set'](s,[]);}for(const t of b){!e['has'](t['prev_node'])&&t['prev_node']!==''&&e['set'](t['prev_node'],[]),!f['has'](t['next_node'])&&f['set'](t['next_node'],[]),t['prev_node']!==''&&e['get'](t['prev_node'])['push'](t['next_node']),f['get'](t['next_node'])['push'](t['prev_node']);}const g=b['filter'](u=>u['prev_node']==='')['map'](u=>u['next_node'])['filter'](u=>d['has'](u)),h=c['filter'](u=>(e['get'](u)||[])['length']===0x0),i=c['filter'](u=>!g['includes'](u)&&(f['get'](u)||[])['length']===0x0),j=c['filter'](u=>(e['get'](u)||[])['length']===0x0&&!h['includes'](u)),{has_cycles:k,cycle_nodes:l}=detectCycles(c,b),m=analyzeDeadBranches(b),n=computeReachability(c,b),o=b['reduce']((u,v)=>u+v['forwards']['length'],0x0),p=Math['max'](0x0,...b['map'](u=>u['forwards']['length'])),q=Math['max'](0x0,...b['flatMap'](u=>u['forwards']['map'](v=>countRetainedSubmissions(v['retained_submission'])))),r={'max_node_count':a['length']<=MAX_NODE_COUNT,'max_node_pair_count':b['length']<=MAX_NODE_PAIR_COUNT,'max_forward_count':p<=MAX_FORWARD_COUNT,'max_forward_order_count':q<=MAX_FORWARD_ORDER_COUNT};return{'entry_nodes':g,'terminal_nodes':h,'orphaned_nodes':i,'dead_end_nodes':j,'dead_branches':m,'has_cycles':k,'cycle_nodes':l,'reachability':n,'node_count':a['length'],'pair_count':b['length'],'forward_count':o,'within_limits':r};}function countRetainedSubmissions(a){if(a===undefined||a===null)return 0x0;if(Array['isArray'](a))return a['length'];if(typeof a==='string')return a['length']>0x0?0x1:0x0;return 0x0;}export function detectCycle(a,b){const c=a['map'](d=>d['name']);return detectCycles(c,b);}function detectCycles(a,b){const c=new Map();for(const k of a)c['set'](k,[]);for(const l of b){l['prev_node']!==''&&c['has'](l['prev_node'])&&c['get'](l['prev_node'])['push'](l['next_node']);}const d=0x0,e=0x1,f=0x2,g=new Map();for(const m of a)g['set'](m,d);const h=[],i=[];function j(n){g['set'](n,e),i['push'](n);for(const o of c['get'](n)||[]){if(g['get'](o)===e){const p=i['indexOf'](o);return h['push'](i['slice'](p)),!![];}if(g['get'](o)===d){if(j(o))return!![];}}return i['pop'](),g['set'](n,f),![];}for(const n of a){g['get'](n)===d&&j(n);}return{'has_cycles':h['length']>0x0,'cycle_nodes':h};}function analyzeDeadBranches(a){const b=[],c=new Map();for(const d of a){if(!c['has'](d['prev_node']))c['set'](d['prev_node'],[]);c['get'](d['prev_node'])['push'](d);}for(const [e,f]of c){if(f['length']<=0x1)continue;const g=Math['min'](...f['map'](h=>h['threshold']));for(const h of f){h['threshold']>g*0x2&&b['push']({'pair':{'prev_node':h['prev_node'],'next_node':h['next_node']},'reason':'Threshold\x20'+h['threshold']+'\x20is\x20much\x20higher\x20than\x20competing\x20minimum\x20'+g+'.\x20Likely\x20always\x20loses.','competing_with':f['filter'](i=>i!==h)['map'](i=>i['next_node'])});}}return b;}function computeReachability(a,b){const c=new Map();for(const e of a)c['set'](e,[]);for(const f of b){if(f['prev_node']!==''){if(!c['has'](f['prev_node']))c['set'](f['prev_node'],[]);c['get'](f['prev_node'])['push'](f['next_node']);}}const d=new Map();for(const g of a){const h=new Set(),i=[g];while(i['length']>0x0){const j=i['shift']();for(const k of c['get'](j)||[]){!h['has'](k)&&(h['add'](k),i['push'](k));}}d['set'](g,h);}return d;}export function isReachableFromEntry(a,b){for(const c of b['entry_nodes']){if(c===a)return!![];if(b['reachability']['get'](c)?.['has'](a))return!![];}return![];}export function getNodesReachingTerminals(a){const b=new Set();for(const [c,d]of a['reachability']){for(const e of a['terminal_nodes']){if(d['has'](e)){b['add'](c);break;}}}return b;}export function formatTopologySummary(a){const b=['Nodes:\x20'+a['node_count']+'\x20(max\x20100)','Pairs:\x20'+a['pair_count']+'\x20(max\x2040)','Forwards:\x20'+a['forward_count']+'\x20(max\x2020\x20per\x20Pair)','','Entry\x20nodes:\x20'+(a['entry_nodes']['join'](',\x20')||'(none)'),'Terminal\x20nodes:\x20'+(a['terminal_nodes']['join'](',\x20')||'(none)'),'Orphaned\x20nodes:\x20'+(a['orphaned_nodes']['join'](',\x20')||'(none)'),'Dead\x20branches:\x20'+a['dead_branches']['length'],'Cycles:\x20'+(a['has_cycles']?'YES\x20(❌\x20invalid\x20DAG)':'NO\x20(✓\x20valid\x20DAG)'),'','Within\x20on-chain\x20limits:\x20'+(a['within_limits']['max_node_count']&&a['within_limits']['max_node_pair_count']&&a['within_limits']['max_forward_count']&&a['within_limits']['max_forward_order_count']?'YES\x20✓':'NO\x20❌')];return b['join']('\x0a');}export function identifyTopologyPattern(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';}for(const [g,h]of c){if(h['length']>0x1)return'P-M-FORKMERGE';}return'P-M-LINEAR';}export const MACHINE_TOPOLOGY_VERSION='1.0.0';
+import{MAX_NODE_COUNT,MAX_NODE_PAIR_COUNT,MAX_FORWARD_COUNT,MAX_FORWARD_ORDER_COUNT}from'./onchain-constants.js';export{MAX_NODE_COUNT,MAX_NODE_PAIR_COUNT,MAX_FORWARD_COUNT,MAX_FORWARD_ORDER_COUNT};export function analyzeTopology(a,b){const c=a['map'](t=>t['name']),d=new Set(c),e=new Map(),f=new Map();for(const t of c){e['set'](t,[]),f['set'](t,[]);}for(const u of b){!e['has'](u['prev_node'])&&u['prev_node']!==''&&e['set'](u['prev_node'],[]),!f['has'](u['next_node'])&&f['set'](u['next_node'],[]),u['prev_node']!==''&&e['get'](u['prev_node'])['push'](u['next_node']),f['get'](u['next_node'])['push'](u['prev_node']);}const g=b['filter'](v=>v['prev_node']==='')['map'](v=>v['next_node'])['filter'](v=>d['has'](v)),h=c['filter'](v=>(e['get'](v)||[])['length']===0x0),i=c['filter'](v=>!g['includes'](v)&&(f['get'](v)||[])['length']===0x0),j=c['filter'](v=>(e['get'](v)||[])['length']===0x0&&!h['includes'](v)),{has_cycles:k,cycle_nodes:l}=detectCycles(c,b),m=analyzeDeadBranches(b),n=findUnachievableThresholds(b),o=computeReachability(c,b),p=b['reduce']((v,w)=>v+w['forwards']['length'],0x0),q=Math['max'](0x0,...b['map'](v=>v['forwards']['length'])),r=Math['max'](0x0,...b['flatMap'](v=>v['forwards']['map'](w=>countRetainedSubmissions(w['retained_submission'])))),s={'max_node_count':a['length']<=MAX_NODE_COUNT,'max_node_pair_count':b['length']<=MAX_NODE_PAIR_COUNT,'max_forward_count':q<=MAX_FORWARD_COUNT,'max_forward_order_count':r<=MAX_FORWARD_ORDER_COUNT,'threshold_achievable':n['length']===0x0};return{'entry_nodes':g,'terminal_nodes':h,'orphaned_nodes':i,'dead_end_nodes':j,'dead_branches':m,'unachievable_thresholds':n,'has_cycles':k,'cycle_nodes':l,'reachability':o,'node_count':a['length'],'pair_count':b['length'],'forward_count':p,'within_limits':s};}export function findUnachievableThresholds(a){const b=[];for(const c of a){const d=c['forwards']['length'],e=c['forwards']['reduce']((g,h)=>g+Number(h['weight']||0x0),0x0);if(e<c['threshold']){const f=c['threshold']>0x1&&d<c['threshold'];b['push']({'prev_node':c['prev_node'],'next_node':c['next_node'],'threshold':c['threshold'],'max_achievable':e,'distinct_forwards':d,'reason':f?'Threshold\x20'+c['threshold']+'\x20needs\x20'+c['threshold']+'\x20distinct\x20forwards\x20(each\x20forward\x20is\x20single-operator-locked\x20and\x20contributes\x20its\x20weight\x20at\x20most\x20once);\x20this\x20Pair\x20has\x20'+d+'\x20forward(s)\x20summing\x20to\x20'+e+'.\x20Add\x20more\x20parallel\x20forwards\x20or\x20lower\x20the\x20threshold.':'Threshold\x20'+c['threshold']+'\x20exceeds\x20max\x20achievable\x20weight\x20'+e+'\x20(sum\x20of\x20distinct\x20forward\x20weights).\x20The\x20transition\x20can\x20never\x20migrate.'});}}return b;}function countRetainedSubmissions(a){if(a===undefined||a===null)return 0x0;if(Array['isArray'](a))return a['length'];if(typeof a==='string')return a['length']>0x0?0x1:0x0;return 0x0;}export function detectCycle(a,b){const c=a['map'](d=>d['name']);return detectCycles(c,b);}function detectCycles(a,b){const c=new Map();for(const k of a)c['set'](k,[]);for(const l of b){l['prev_node']!==''&&c['has'](l['prev_node'])&&c['get'](l['prev_node'])['push'](l['next_node']);}const d=0x0,e=0x1,f=0x2,g=new Map();for(const m of a)g['set'](m,d);const h=[],i=[];function j(n){g['set'](n,e),i['push'](n);for(const o of c['get'](n)||[]){if(g['get'](o)===e){const p=i['indexOf'](o);return h['push'](i['slice'](p)),!![];}if(g['get'](o)===d){if(j(o))return!![];}}return i['pop'](),g['set'](n,f),![];}for(const n of a){g['get'](n)===d&&j(n);}return{'has_cycles':h['length']>0x0,'cycle_nodes':h};}function analyzeDeadBranches(a){const b=[],c=new Map();for(const d of a){if(!c['has'](d['prev_node']))c['set'](d['prev_node'],[]);c['get'](d['prev_node'])['push'](d);}for(const [e,f]of c){if(f['length']<=0x1)continue;const g=Math['min'](...f['map'](h=>h['threshold']));for(const h of f){h['threshold']>g*0x2&&b['push']({'pair':{'prev_node':h['prev_node'],'next_node':h['next_node']},'reason':'Threshold\x20'+h['threshold']+'\x20is\x20much\x20higher\x20than\x20competing\x20minimum\x20'+g+'.\x20Likely\x20always\x20loses.','competing_with':f['filter'](i=>i!==h)['map'](i=>i['next_node'])});}}return b;}function computeReachability(a,b){const c=new Map();for(const e of a)c['set'](e,[]);for(const f of b){if(f['prev_node']!==''){if(!c['has'](f['prev_node']))c['set'](f['prev_node'],[]);c['get'](f['prev_node'])['push'](f['next_node']);}}const d=new Map();for(const g of a){const h=new Set(),i=[g];while(i['length']>0x0){const j=i['shift']();for(const k of c['get'](j)||[]){!h['has'](k)&&(h['add'](k),i['push'](k));}}d['set'](g,h);}return d;}export function isReachableFromEntry(a,b){for(const c of b['entry_nodes']){if(c===a)return!![];if(b['reachability']['get'](c)?.['has'](a))return!![];}return![];}export function getNodesReachingTerminals(a){const b=new Set();for(const [c,d]of a['reachability']){for(const e of a['terminal_nodes']){if(d['has'](e)){b['add'](c);break;}}}return b;}export function formatTopologySummary(a){const b=['Nodes:\x20'+a['node_count']+'\x20(max\x20100)','Pairs:\x20'+a['pair_count']+'\x20(max\x2040)','Forwards:\x20'+a['forward_count']+'\x20(max\x2020\x20per\x20Pair)','','Entry\x20nodes:\x20'+(a['entry_nodes']['join'](',\x20')||'(none)'),'Terminal\x20nodes:\x20'+(a['terminal_nodes']['join'](',\x20')||'(none)'),'Orphaned\x20nodes:\x20'+(a['orphaned_nodes']['join'](',\x20')||'(none)'),'Dead\x20branches:\x20'+a['dead_branches']['length'],'Unachievable\x20thresholds:\x20'+a['unachievable_thresholds']['length'],'Cycles:\x20'+(a['has_cycles']?'YES\x20(❌\x20invalid\x20DAG)':'NO\x20(✓\x20valid\x20DAG)'),'','Within\x20on-chain\x20limits:\x20'+(a['within_limits']['max_node_count']&&a['within_limits']['max_node_pair_count']&&a['within_limits']['max_forward_count']&&a['within_limits']['max_forward_order_count']&&a['within_limits']['threshold_achievable']?'YES\x20✓':'NO\x20❌')];return b['join']('\x0a');}export function identifyTopologyPattern(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';}for(const [g,h]of c){if(h['length']>0x1)return'P-M-FORKMERGE';}return'P-M-LINEAR';}export const MACHINE_TOPOLOGY_VERSION='1.0.0';

package/dist/knowledge/machine-translation.js

@@ -1 +1 @@
-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};}
+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\x20DISTINCT\x20Forwards\x20(weight=1\x20each)\x20—\x20one\x20forward\x20per\x20contributing\x20operator.\x20'+'A\x20single\x20forward\x20CANNOT\x20be\x20executed\x20by\x20two\x20different\x20people:\x20each\x20forward\x20is\x20single-operator-locked\x20by\x20the\x20first\x20account\x20that\x20accomplishes\x20it\x20'+'(progress.move\x20session_accomplish_imp;\x20a\x20second\x20operator\x20re-executing\x20the\x20same\x20accomplished\x20forward\x20aborts\x20E_NOT_THE_HOLDER,\x20and\x20the\x20weight\x20is\x20counted\x20only\x20once).\x20'+'So\x20N\x20operators\x20cooperating\x20on\x20a\x20threshold-N\x20transition\x20MUST\x20each\x20have\x20their\x20own\x20forward\x20in\x20the\x20Pair.','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\x20contributing\x20operator\x20needs\x20a\x20DISTINCT\x20Forward\x20—\x20never\x20reuse\x20one\x20forward\x20for\x20two\x20people','Each\x20Forward\x20must\x20have\x20a\x20distinct\x20permission\x20model\x20(no\x20two\x20identical)','A\x20forward\x20is\x20locked\x20by\x20its\x20first\x20operator:\x20once\x20accomplished\x20it\x20contributes\x20its\x20weight\x20once\x20and\x20re-execution\x20by\x20others\x20aborts\x20E_NOT_THE_HOLDER','If\x20either\x20party\x20fails\x20to\x20sign,\x20workflow\x20stalls\x20—\x20consider\x20adding\x20timeout\x20Guard'],'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

@@ -10,3 +10,14 @@ export interface MarketMetrics {
     computed_at: number;
 }
 export declare function computeMarketMetrics(network: ENTRYPOINT, no_cache?: boolean): Promise<MarketMetrics>;
+export interface OrderFlowMetrics {
+    order_count: number;
+    gmv: string;
+    top_services: Array<{
+        service: string;
+        orders: number;
+    }>;
+    window: "recent";
+    computed_at: number;
+}
+export declare function computeOrderFlow(network: ENTRYPOINT, limit?: number, no_cache?: boolean): Promise<OrderFlowMetrics>;

package/dist/knowledge/market-metrics.js

@@ -1 +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']()};}
+import{query_events,ArbStatus}from'@wowok/wowok';import{enumerateServices,enumerateDemands,enumerateArbs}from'./jsonrpc-enum.js';export async function computeMarketMetrics(a,b){const [c,d,e]=await Promise['all']([enumerateServices(a,{'no_cache':b}),enumerateDemands(a,{'no_cache':b}),enumerateArbs(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']()};}export async function computeOrderFlow(a,b=0x64,c){const d=await query_events({'type':'NewOrderEvent','order':'descending','limit':b,'no_cache':c,'network':a}),e=(d?.['data']??[])['filter'](i=>i['type']==='NewOrderEvent');let f=0x0n;const g=new Map();for(const i of e){try{f+=BigInt(i['amount']);}catch{}i['service']&&g['set'](i['service'],(g['get'](i['service'])??0x0)+0x1);}const h=Array['from'](g['entries']())['map'](([j,k])=>({'service':j,'orders':k}))['sort']((j,k)=>k['orders']-j['orders'])['slice'](0x0,0xa);return{'order_count':e['length'],'gmv':f['toString'](),'top_services':h,'window':'recent','computed_at':Date['now']()};}

package/dist/knowledge/mcp-schema-audit-cli.js

@@ -1 +1 @@
-import{scanAllMcpSchemas,formatAuditReport,MCP_SCHEMA_AUDIT_VERSION}from'./mcp-schema-audit.js';import*as a136a from'fs';import*as a136b from'path';console['log']('MCP\x20Schema\x20Audit\x20v'+MCP_SCHEMA_AUDIT_VERSION),console['log']('Auditing\x204\x20layers:\x20ts-sdk\x20→\x20Zod\x20→\x20Generated\x20→\x20Deployed\x20...');const result=scanAllMcpSchemas();console['log']('\x0aAudited\x20'+result['census']['length']+'\x20sub-tools,\x20found\x20'+result['total_findings']+'\x20findings.'),console['log']('\x20\x20Gateway\x20deployed:\x20'+(result['gateway']['file_exists']?'yes\x20('+result['gateway']['all_mounts']['length']+'\x20Trae\x20mount(s))':'NO')),console['log']('\x20\x20any/unknown:\x20'+result['any_unknown_instances']['length']+'\x20total\x20('+result['fixable_any_count']+'\x20fixable,\x20'+result['legitimate_any_count']+'\x20legitimate)');const report=formatAuditReport(result),outputPath=a136b['resolve']('d:/wowok/wiki/market/GLM3/mcp-schema-audit-report.md');a136a['writeFileSync'](outputPath,report,'utf-8'),console['log']('\x0aReport\x20written\x20to\x20'+outputPath),console['log']('\x0a===\x20Layer\x204\x20Gateway\x20===');result['gateway']['file_exists']?(console['log']('\x20\x20Descriptor:\x20\x20\x20\x20\x20'+result['gateway']['gateway_file']+'\x20('+(result['gateway']['size_bytes']/0x400)['toFixed'](0x1)+'KB)'),console['log']('\x20\x20Name:\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20'+result['gateway']['gateway_name']),console['log']('\x20\x20Dispatch:\x20\x20\x20\x20\x20\x20\x20tool='+(result['gateway']['has_tool_field']?'OK':'MISSING')+'\x20data='+(result['gateway']['has_data_field']?'OK':'MISSING')+'\x20strict='+(result['gateway']['is_strict']?'OK':'NO')),console['log']('\x20\x20Definitions:\x20\x20\x20\x20'+result['gateway']['definitions_count']),console['log']('\x20\x20schema_query:\x20\x20\x20'+(result['gateway']['has_schema_hint']?'OK':'MISSING'))):console['log']('\x20\x20MISSING\x20—\x20no\x20wowok.json\x20under\x20any\x20Trae\x20mount');console['log']('\x0a===\x20Per-Tool\x20Census\x20==='),console['log']('Tool'['padEnd'](0x1c)+'L3-Input'['padEnd'](0xe)+'L3-Output');for(const c of result['census']){const l3i=c['layer3_generated']['input_exists']?(c['layer3_generated']['input_size_bytes']/0x400)['toFixed'](0x1)+'KB':'MISSING',l3o=c['layer3_generated']['output_exists']?(c['layer3_generated']['output_size_bytes']/0x400)['toFixed'](0x1)+'KB':'MISSING';console['log'](c['name']['padEnd'](0x1c)+l3i['padEnd'](0xe)+l3o);}console['log']('\x0a===\x20Findings\x20by\x20Severity\x20===');for(const sev of['critical','high','medium','low','info']){const arr=result['findings_by_severity']['get'](sev)??[];if(arr['length']>0x0)console['log']('\x20\x20'+sev['padEnd'](0xa)+'\x20'+arr['length']);}console['log']('\x0a===\x20Findings\x20by\x20Category\x20===');for(const cat of['gateway_deployment','layer_parity','handler_types','output_coverage','generation_sync','reflection']){const arr=result['findings_by_category']['get'](cat)??[];if(arr['length']>0x0)console['log']('\x20\x20'+cat['padEnd'](0x16)+'\x20'+arr['length']);}console['log']('\x0a===\x20any/unknown\x20by\x20Pattern\x20===');const patternGroups=new Map();for(const inst of result['any_unknown_instances']){patternGroups['set'](inst['pattern'],(patternGroups['get'](inst['pattern'])??0x0)+0x1);}for(const [pattern,count]of[...patternGroups['entries']()]['sort']((d,e)=>e[0x1]-d[0x1])){console['log']('\x20\x20'+pattern['padEnd'](0x18)+'\x20'+count);}
+import{scanAllMcpSchemas,formatAuditReport,MCP_SCHEMA_AUDIT_VERSION}from'./mcp-schema-audit.js';import*as a140a from'fs';import*as a140b from'path';console['log']('MCP\x20Schema\x20Audit\x20v'+MCP_SCHEMA_AUDIT_VERSION),console['log']('Auditing\x204\x20layers:\x20ts-sdk\x20→\x20Zod\x20→\x20Generated\x20→\x20Deployed\x20...');const result=scanAllMcpSchemas();console['log']('\x0aAudited\x20'+result['census']['length']+'\x20sub-tools,\x20found\x20'+result['total_findings']+'\x20findings.'),console['log']('\x20\x20Gateway\x20deployed:\x20'+(result['gateway']['file_exists']?'yes\x20('+result['gateway']['all_mounts']['length']+'\x20Trae\x20mount(s))':'NO')),console['log']('\x20\x20any/unknown:\x20'+result['any_unknown_instances']['length']+'\x20total\x20('+result['fixable_any_count']+'\x20fixable,\x20'+result['legitimate_any_count']+'\x20legitimate)');const report=formatAuditReport(result),outputPath=a140b['resolve']('d:/wowok/wiki/market/GLM3/mcp-schema-audit-report.md');a140a['writeFileSync'](outputPath,report,'utf-8'),console['log']('\x0aReport\x20written\x20to\x20'+outputPath),console['log']('\x0a===\x20Layer\x204\x20Gateway\x20===');result['gateway']['file_exists']?(console['log']('\x20\x20Descriptor:\x20\x20\x20\x20\x20'+result['gateway']['gateway_file']+'\x20('+(result['gateway']['size_bytes']/0x400)['toFixed'](0x1)+'KB)'),console['log']('\x20\x20Name:\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20\x20'+result['gateway']['gateway_name']),console['log']('\x20\x20Dispatch:\x20\x20\x20\x20\x20\x20\x20tool='+(result['gateway']['has_tool_field']?'OK':'MISSING')+'\x20data='+(result['gateway']['has_data_field']?'OK':'MISSING')+'\x20strict='+(result['gateway']['is_strict']?'OK':'NO')),console['log']('\x20\x20Definitions:\x20\x20\x20\x20'+result['gateway']['definitions_count']),console['log']('\x20\x20schema_query:\x20\x20\x20'+(result['gateway']['has_schema_hint']?'OK':'MISSING'))):console['log']('\x20\x20MISSING\x20—\x20no\x20wowok.json\x20under\x20any\x20Trae\x20mount');console['log']('\x0a===\x20Per-Tool\x20Census\x20==='),console['log']('Tool'['padEnd'](0x1c)+'L3-Input'['padEnd'](0xe)+'L3-Output');for(const c of result['census']){const l3i=c['layer3_generated']['input_exists']?(c['layer3_generated']['input_size_bytes']/0x400)['toFixed'](0x1)+'KB':'MISSING',l3o=c['layer3_generated']['output_exists']?(c['layer3_generated']['output_size_bytes']/0x400)['toFixed'](0x1)+'KB':'MISSING';console['log'](c['name']['padEnd'](0x1c)+l3i['padEnd'](0xe)+l3o);}console['log']('\x0a===\x20Findings\x20by\x20Severity\x20===');for(const sev of['critical','high','medium','low','info']){const arr=result['findings_by_severity']['get'](sev)??[];if(arr['length']>0x0)console['log']('\x20\x20'+sev['padEnd'](0xa)+'\x20'+arr['length']);}console['log']('\x0a===\x20Findings\x20by\x20Category\x20===');for(const cat of['gateway_deployment','layer_parity','handler_types','output_coverage','generation_sync','reflection']){const arr=result['findings_by_category']['get'](cat)??[];if(arr['length']>0x0)console['log']('\x20\x20'+cat['padEnd'](0x16)+'\x20'+arr['length']);}console['log']('\x0a===\x20any/unknown\x20by\x20Pattern\x20===');const patternGroups=new Map();for(const inst of result['any_unknown_instances']){patternGroups['set'](inst['pattern'],(patternGroups['get'](inst['pattern'])??0x0)+0x1);}for(const [pattern,count]of[...patternGroups['entries']()]['sort']((d,e)=>e[0x1]-d[0x1])){console['log']('\x20\x20'+pattern['padEnd'](0x18)+'\x20'+count);}

package/dist/knowledge/mcp-schema-audit.d.ts

@@ -44,6 +44,7 @@ export interface Layer4GatewayInfo {
     gateway_name: string | null;
     has_definitions: boolean;
     definitions_count: number;
+    has_properties: boolean;
     has_tool_field: boolean;
     has_data_field: boolean;
     is_strict: boolean;