[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7AE4HYS792DR136RWX7TT6P":3,"skill-same:01M7AE4HYS792DR136RWX7TT6P":45},{"skillNo":4,"name":5,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":13,"repositoryHtmlUrl":26,"repositoryHomepageUrl":6,"ownerHtmlUrl":27,"ownerBlogUrl":28,"ownerDescription":29,"updatedAt":30,"install":31,"resources":44},"01M7AE4HYS792DR136RWX7TT6P","0.2.1-understand-failure_detector",null,"sancovp\u002Fdark-factory-live","sancovp","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F147458096?v=4","01M74F2EFE4Q0KF1Y5AY27HVNB","Isaac Wostrel-Rubin","01M7AC3EB8VZXS1SKHQW1EZ4N1",0,"MIT","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fkbworld\u002Fstate\u002Flibraries\u002Fdistributed_consensus_and_replication_protocols\u002Funderstand-deep_consensus\u002Funderstand-failure_detector\u002F.claude\u002Fskills\u002F0.2.1-understand-failure_detector\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: 0.2.1-understand-failure_detector\ndescription: [0.2.1] Mechanism to distinguish crashed nodes from slow ones based on timeouts, heartbeats, or phi_accrual.\n---\n\n# understand-failure_detector\n\n**CALL NUMBER:** `deep_consensus.failure_detector : distributed_consensus_and_replication_protocols(20), deep_raft(6)`\n**DEFINITION:** Mechanism to distinguish crashed nodes from slow ones based on timeouts, heartbeats, or phi_accrual.\n\nInvoke this skill to understand `failure_detector` down to its primitives. The RELATIVE ROOT below is the least-fixed-point closure of everything it bundles from — the full import cone, grouped by the lib each prim comes from. Projected from a prover-typed KB (MAP\u002FSWI-Prolog consistency gate): every reference below resolves.\n\n## THE RELATIVE ROOT (the import cone, by lib)\n\n### from `?`\n- **agreement** (d7): The property that a set of distributed processes reach the same decision outcome on a given value. Uniform agreement requires all processes including those that later crash to decide identically; asymmetric agreement permits different decision classes for different process roles such as primary versus backup.\n\n### from `deep_consensus`\n- **failure_mode** (d1): Classification of ways components can fail: crash_stop, crash_recovery, omission, timing, response, arbitrary_byzantine.\n- **byzantine_failure** (d2): Component exhibits arbitrary behavior including lies, omissions, or timing violations.\n- **crash_failure** (d2): Component ceases operation entirely without warning or recovery attempt.\n- **network_partition** (d2): Connectivity loss between node subgroups preventing inter-group communication.\n- **shadow_operations** (d3): Redundant execution paths validated against primary to detect silent corruption.\n- **replica_synchronization** (d4): Propagation of updates to ensure all replicas converge toward identical state.\n- **availability** (d4): Probability system remains operational and accessible despite failures.\n- **safety** (d4): Property requiring system never reaches inconsistent or invalid state.\n- **gossip_dissemination** (d5): Probabilistic epidemic protocol spreading updates through pairwise exchanges.\n- **liveness** (d5): Property requiring system to eventually respond or make progress under fair conditions.\n- **quorum_read** (d5): Reading from sufficient replicas to guarantee seeing latest write.\n- **quorum_write** (d5): Writing to sufficient replicas to guarantee subsequent readers see the value.\n- **replication_factor** (d5): Count of replica copies maintained for durability and availability.\n- **strong_quorum** (d5): Quorum where read and write quorums overlap (r + w > n).\n- **view_change** (d10): Transition of consensus membership to new configuration after membership modification.\n\n### from `deep_raft`\n- **a005** (d5): Uniform agreement: all processes including those that later fail must decide on the same value, stricter than ordinary agreement which only binds correct processes.\n- **a007** (d7): Quorum in agreement: a subset of processes sufficient to guarantee agreement can be reached, typically intersecting any valid quorum to ensure overlap.\n- **a008** (d7): Threshold in agreement: the minimum number of correct processes required to guarantee safety and liveness under given failure assumptions.\n- **a009** (d8): Asymmetric agreement: one class of processes (e.g., primary) must agree while another class (e.g., backups) may reach different decisions, used in primary-backup protocols.\n- **a002** (d8): Validity in agreement: the decided value must have been proposed by some process in the system, guaranteeing agreements are grounded in actual proposals.\n- **a004** (d9): Termination in agreement: every correct process eventually decides some value, ensuring the protocol makes progress and does not stall indefinitely.\n\n### from `distributed_consensus_and_replication_protocols`\n- **state_machine_replication** (d3): Technique where deterministic state machines are replicated across nodes via a common log.\n- **recovery** (d3): Process of restoring a failed node or the system to a consistent state.\n- **split_brain** (d3): Scenario where network partition causes multiple nodes to believe they are leader; resolved by quorum.\n- **replicated_log** (d4): Ordered log of commands maintained across replicas; foundation of state machine replication.\n- **roll_back** (d4): Reverting uncommitted changes to maintain consistency after transaction abort.\n- **roll_forward** (d4): Reapplying committed log entries to reconstruct state after failure.\n- **quorum** (d4): Subset of nodes sufficient for reads or writes; typically majority (n\u002F2+1) for strong consistency.\n- **anti_entropy** (d5): Repair of divergent replicas by comparing Merkle trees and exchanging differences.\n- **read_repair** (d5): Background correction of stale replicas when read reveals outdated data.\n- **linearizability** (d5): Strongest consistency model: every operation appears atomic and ordered in real time across all nodes.\n- **semi_synchronous_replication** (d5): Write waits for quorum of replicas to acknowledge; balances latency and durability.\n- **synchronous_replication** (d5): Write waits for all replicas to acknowledge before returning to client.\n- **state_transfer** (d6): Sending full current state to a lagging replica for rapid catch-up.\n- **eventual_consistency** (d6): Given no new updates, all replicas will eventually converge to the same value.\n- **consensus** (d6): Agreement on a single value among a set of distributed processes; the core problem consensus protocols solve.\n- **catch_up_recovery** (d7): Process of syncing a lagging or new replica with current leader state.\n- **fault_tolerance** (d7): System's ability to continue operating correctly despite component failures.\n- **reconfiguration** (d8): Process of changing cluster membership while maintaining consistency guarantees.\n- **membership_change** (d9): Adding or removing nodes from the cluster without service interruption.\n- **joint_consensus** (d10): Raft's two-phase configuration change using joint configuration of old and new members.\n\n## CONSUMERS (what needs this)\n`failure_detection_timeout`, `heartbeat`, `phi_accrual_detector`, `preemptive_recovery`\n\n---\n*Projected from the `distributed consensus and replication protocols` KB (196 concepts \u002F 187 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.*\n\n_(leaf — this is an actual skill.)_\n","# understand-failure_detector\n\n**CALL NUMBER:** `deep_consensus.failure_detector : distributed_consensus_and_replication_protocols(20), deep_raft(6)`\n**DEFINITION:** Mechanism to distinguish crashed nodes from slow ones based on timeouts, heartbeats, or phi_accrual.\n\nInvoke this skill to understand `failure_detector` down to its primitives. The RELATIVE ROOT below is the least-fixed-point closure of everything it bundles from — the full import cone, grouped by the lib each prim comes from. Projected from a prover-typed KB (MAP\u002FSWI-Prolog consistency gate): every reference below resolves.\n\n## THE RELATIVE ROOT (the import cone, by lib)\n\n### from `?`\n- **agreement** (d7): The property that a set of distributed processes reach the same decision outcome on a given value. Uniform agreement requires all processes including those that later crash to decide identically; asymmetric agreement permits different decision classes for different process roles such as primary versus backup.\n\n### from `deep_consensus`\n- **failure_mode** (d1): Classification of ways components can fail: crash_stop, crash_recovery, omission, timing, response, arbitrary_byzantine.\n- **byzantine_failure** (d2): Component exhibits arbitrary behavior including lies, omissions, or timing violations.\n- **crash_failure** (d2): Component ceases operation entirely without warning or recovery attempt.\n- **network_partition** (d2): Connectivity loss between node subgroups preventing inter-group communication.\n- **shadow_operations** (d3): Redundant execution paths validated against primary to detect silent corruption.\n- **replica_synchronization** (d4): Propagation of updates to ensure all replicas converge toward identical state.\n- **availability** (d4): Probability system remains operational and accessible despite failures.\n- **safety** (d4): Property requiring system never reaches inconsistent or invalid state.\n- **gossip_dissemination** (d5): Probabilistic epidemic protocol spreading updates through pairwise exchanges.\n- **liveness** (d5): Property requiring system to eventually respond or make progress under fair conditions.\n- **quorum_read** (d5): Reading from sufficient replicas to guarantee seeing latest write.\n- **quorum_write** (d5): Writing to sufficient replicas to guarantee subsequent readers see the value.\n- **replication_factor** (d5): Count of replica copies maintained for durability and availability.\n- **strong_quorum** (d5): Quorum where read and write quorums overlap (r + w > n).\n- **view_change** (d10): Transition of consensus membership to new configuration after membership modification.\n\n### from `deep_raft`\n- **a005** (d5): Uniform agreement: all processes including those that later fail must decide on the same value, stricter than ordinary agreement which only binds correct processes.\n- **a007** (d7): Quorum in agreement: a subset of processes sufficient to guarantee agreement can be reached, typically intersecting any valid quorum to ensure overlap.\n- **a008** (d7): Threshold in agreement: the minimum number of correct processes required to guarantee safety and liveness under given failure assumptions.\n- **a009** (d8): Asymmetric agreement: one class of processes (e.g., primary) must agree while another class (e.g., backups) may reach different decisions, used in primary-backup protocols.\n- **a002** (d8): Validity in agreement: the decided value must have been proposed by some process in the system, guaranteeing agreements are grounded in actual proposals.\n- **a004** (d9): Termination in agreement: every correct process eventually decides some value, ensuring the protocol makes progress and does not stall indefinitely.\n\n### from `distributed_consensus_and_replication_protocols`\n- **state_machine_replication** (d3): Technique where deterministic state machines are replicated across nodes via a common log.\n- **recovery** (d3): Process of restoring a failed node or the system to a consistent state.\n- **split_brain** (d3): Scenario where network partition causes multiple nodes to believe they are leader; resolved by quorum.\n- **replicated_log** (d4): Ordered log of commands maintained across replicas; foundation of state machine replication.\n- **roll_back** (d4): Reverting uncommitted changes to maintain consistency after transaction abort.\n- **roll_forward** (d4): Reapplying committed log entries to reconstruct state after failure.\n- **quorum** (d4): Subset of nodes sufficient for reads or writes; typically majority (n\u002F2+1) for strong consistency.\n- **anti_entropy** (d5): Repair of divergent replicas by comparing Merkle trees and exchanging differences.\n- **read_repair** (d5): Background correction of stale replicas when read reveals outdated data.\n- **linearizability** (d5): Strongest consistency model: every operation appears atomic and ordered in real time across all nodes.\n- **semi_synchronous_replication** (d5): Write waits for quorum of replicas to acknowledge; balances latency and durability.\n- **synchronous_replication** (d5): Write waits for all replicas to acknowledge before returning to client.\n- **state_transfer** (d6): Sending full current state to a lagging replica for rapid catch-up.\n- **eventual_consistency** (d6): Given no new updates, all replicas will eventually converge to the same value.\n- **consensus** (d6): Agreement on a single value among a set of distributed processes; the core problem consensus protocols solve.\n- **catch_up_recovery** (d7): Process of syncing a lagging or new replica with current leader state.\n- **fault_tolerance** (d7): System's ability to continue operating correctly despite component failures.\n- **reconfiguration** (d8): Process of changing cluster membership while maintaining consistency guarantees.\n- **membership_change** (d9): Adding or removing nodes from the cluster without service interruption.\n- **joint_consensus** (d10): Raft's two-phase configuration change using joint configuration of old and new members.\n\n## CONSUMERS (what needs this)\n`failure_detection_timeout`, `heartbeat`, `phi_accrual_detector`, `preemptive_recovery`\n\n---\n*Projected from the `distributed consensus and replication protocols` KB (196 concepts \u002F 187 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.*\n\n_(leaf — this is an actual skill.)_\n",{},"main","dfed66814f223a9f42bec375a3c59d74eefdcad5","kbworld\u002Fstate\u002Flibraries\u002Fdistributed_consensus_and_replication_protocols\u002Funderstand-deep_consensus\u002Funderstand-failure_detector\u002F.claude\u002Fskills\u002F0.2.1-understand-failure_detector","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live","https:\u002F\u002Fgithub.com\u002Fsancovp","https:\u002F\u002Fisaacwr.carrd.co\u002F","AKA Olivus Victory-Promise\r\n\r\nAI Agents, Tools, and Infrastructure","2026-10-09 02:22:46",{"source":7,"skillName":5,"commands":32,"prompt":42,"zipAvailable":43},[33,36,39],{"tool":34,"command":35},"npx","npx skills add sancovp\u002Fdark-factory-live --skill 0.2.1-understand-failure_detector",{"tool":37,"command":38},"bunx","bunx skills add sancovp\u002Fdark-factory-live --skill 0.2.1-understand-failure_detector",{"tool":40,"command":41},"pnpm","pnpm dlx skills add sancovp\u002Fdark-factory-live --skill 0.2.1-understand-failure_detector","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fkbworld\u002Fstate\u002Flibraries\u002Fdistributed_consensus_and_replication_protocols\u002Funderstand-deep_consensus\u002Funderstand-failure_detector\u002F.claude\u002Fskills\u002F0.2.1-understand-failure_detector\u002FSKILL.md",true,[],[46,53,60,67,74,81],{"skillNo":47,"name":48,"nameZh":6,"description":49,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":50,"categories":51,"keywords":52,"publishedAt":18},"01M7AGYB2CPCQYJP631CH18A1A","quests","The quest board — accept quests, craft skills to fulfill them, earn gold rewards.","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fworld\u002Fagents\u002Fagent_002\u002F.claude\u002Fskills\u002Fthings\u002Fquests\u002FSKILL.md",[],[],{"skillNo":54,"name":55,"nameZh":6,"description":56,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":57,"categories":58,"keywords":59,"publishedAt":18},"01M7AGXYVW23T3X4APFAV3H4ZY","metrics","Check your profitability and trading performance — gold earned, spent, net profit, trade history.","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fworld\u002Fagents\u002Fagent_002\u002F.claude\u002Fskills\u002Fthings\u002Fmetrics\u002FSKILL.md",[],[],{"skillNo":61,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":64,"categories":65,"keywords":66,"publishedAt":18},"01M7AGXWC0C1W7PZK5YXQW0NQM","things","Flat search across the game — find quests, knowledge domains, agents, trade listings, memories.","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fworld\u002Fagents\u002Fagent_002\u002F.claude\u002Fskills\u002Fthings\u002FSKILL.md",[],[],{"skillNo":68,"name":69,"nameZh":6,"description":70,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":71,"categories":72,"keywords":73,"publishedAt":18},"01M7AGXT9SX50REN4K7ZGE08JT","test-skill","Test a crafted skill by running it through a fresh Claude instance. Use before posting to trade or submitting for quests.","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fworld\u002Fagents\u002Fagent_002\u002F.claude\u002Fskills\u002Ftest_skill\u002FSKILL.md",[],[],{"skillNo":75,"name":76,"nameZh":6,"description":77,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":78,"categories":79,"keywords":80,"publishedAt":18},"01M7AGXRA67MFHJJNDEVX6PFKR","remember","Your zettelkasten — persistent memory that survives across seasons. Record observations, strategies, and craft insights.","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fworld\u002Fagents\u002Fagent_002\u002F.claude\u002Fskills\u002Fremember\u002FSKILL.md",[],[],{"skillNo":82,"name":83,"nameZh":6,"description":84,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":85,"categories":86,"keywords":87,"publishedAt":18},"01M7AGXNND02SYFXB1JV9YRPAN","skill-types","The type system — Template, Lens, Prosthesis, Towering, Combiner, Persona, Recipe. Learn to type skills, chain them, and write Recipes.","https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fworld\u002Fagents\u002Fagent_002\u002F.claude\u002Fskills\u002Fplaces\u002Fskill_types\u002FSKILL.md",[],[]]