[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7AFPD0MTA296CDCPXR123H0":3,"skill-same:01M7AFPD0MTA296CDCPXR123H0":46},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":14,"repositoryHtmlUrl":27,"repositoryHomepageUrl":6,"ownerHtmlUrl":28,"ownerBlogUrl":29,"ownerDescription":30,"updatedAt":31,"install":32,"resources":45},"01M7AFPD0MTA296CDCPXR123H0","0.2.6-understand-network_partition",null,"[0.2.6] Connectivity loss between node subgroups preventing inter-group communication.","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\u002Fmodules\u002Fdistributed_consensus_and_replication_pr\u002Fskills\u002F0-2-6-understand-network-partition\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: 0.2.6-understand-network_partition\ndescription: \"[0.2.6] Connectivity loss between node subgroups preventing inter-group communication.\"\n---\n\n# understand-network_partition\n\n**CALL NUMBER:** `deep_consensus.network_partition : distributed_consensus_and_replication_protocols(8), deep_raft(6)`\n**DEFINITION:** Connectivity loss between node subgroups preventing inter-group communication.\n\nInvoke this skill to understand `network_partition` 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** (d5): 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- **availability** (d2): Probability system remains operational and accessible despite failures.\n- **safety** (d2): Property requiring system never reaches inconsistent or invalid state.\n- **liveness** (d3): Property requiring system to eventually respond or make progress under fair conditions.\n- **quorum_read** (d3): Reading from sufficient replicas to guarantee seeing latest write.\n- **quorum_write** (d3): Writing to sufficient replicas to guarantee subsequent readers see the value.\n- **replication_factor** (d3): Count of replica copies maintained for durability and availability.\n- **strong_quorum** (d3): Quorum where read and write quorums overlap (r + w > n).\n\n### from `deep_raft`\n- **a007** (d5): Quorum in agreement: a subset of processes sufficient to guarantee agreement can be reached, typically intersecting any valid quorum to ensure overlap.\n- **a008** (d5): Threshold in agreement: the minimum number of correct processes required to guarantee safety and liveness under given failure assumptions.\n- **a009** (d6): 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** (d6): Validity in agreement: the decided value must have been proposed by some process in the system, guaranteeing agreements are grounded in actual proposals.\n- **a005** (d7): 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- **a004** (d7): 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- **split_brain** (d1): Scenario where network partition causes multiple nodes to believe they are leader; resolved by quorum.\n- **quorum** (d2): Subset of nodes sufficient for reads or writes; typically majority (n\u002F2+1) for strong consistency.\n- **linearizability** (d3): Strongest consistency model: every operation appears atomic and ordered in real time across all nodes.\n- **semi_synchronous_replication** (d3): Write waits for quorum of replicas to acknowledge; balances latency and durability.\n- **synchronous_replication** (d3): Write waits for all replicas to acknowledge before returning to client.\n- **consensus** (d4): Agreement on a single value among a set of distributed processes; the core problem consensus protocols solve.\n- **fault_tolerance** (d5): System's ability to continue operating correctly despite component failures.\n- **replicated_log** (d6): Ordered log of commands maintained across replicas; foundation of state machine replication.\n\n## CONSUMERS (what needs this)\n`cap_partition_tolerance`, `failure_mode`\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-network_partition\n\n**CALL NUMBER:** `deep_consensus.network_partition : distributed_consensus_and_replication_protocols(8), deep_raft(6)`\n**DEFINITION:** Connectivity loss between node subgroups preventing inter-group communication.\n\nInvoke this skill to understand `network_partition` 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** (d5): 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- **availability** (d2): Probability system remains operational and accessible despite failures.\n- **safety** (d2): Property requiring system never reaches inconsistent or invalid state.\n- **liveness** (d3): Property requiring system to eventually respond or make progress under fair conditions.\n- **quorum_read** (d3): Reading from sufficient replicas to guarantee seeing latest write.\n- **quorum_write** (d3): Writing to sufficient replicas to guarantee subsequent readers see the value.\n- **replication_factor** (d3): Count of replica copies maintained for durability and availability.\n- **strong_quorum** (d3): Quorum where read and write quorums overlap (r + w > n).\n\n### from `deep_raft`\n- **a007** (d5): Quorum in agreement: a subset of processes sufficient to guarantee agreement can be reached, typically intersecting any valid quorum to ensure overlap.\n- **a008** (d5): Threshold in agreement: the minimum number of correct processes required to guarantee safety and liveness under given failure assumptions.\n- **a009** (d6): 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** (d6): Validity in agreement: the decided value must have been proposed by some process in the system, guaranteeing agreements are grounded in actual proposals.\n- **a005** (d7): 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- **a004** (d7): 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- **split_brain** (d1): Scenario where network partition causes multiple nodes to believe they are leader; resolved by quorum.\n- **quorum** (d2): Subset of nodes sufficient for reads or writes; typically majority (n\u002F2+1) for strong consistency.\n- **linearizability** (d3): Strongest consistency model: every operation appears atomic and ordered in real time across all nodes.\n- **semi_synchronous_replication** (d3): Write waits for quorum of replicas to acknowledge; balances latency and durability.\n- **synchronous_replication** (d3): Write waits for all replicas to acknowledge before returning to client.\n- **consensus** (d4): Agreement on a single value among a set of distributed processes; the core problem consensus protocols solve.\n- **fault_tolerance** (d5): System's ability to continue operating correctly despite component failures.\n- **replicated_log** (d6): Ordered log of commands maintained across replicas; foundation of state machine replication.\n\n## CONSUMERS (what needs this)\n`cap_partition_tolerance`, `failure_mode`\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",{"name":5,"description":7},"main","dfed66814f223a9f42bec375a3c59d74eefdcad5","kbworld\u002Fstate\u002Fmodules\u002Fdistributed_consensus_and_replication_pr\u002Fskills\u002F0-2-6-understand-network-partition","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":8,"skillName":5,"commands":33,"prompt":43,"zipAvailable":44},[34,37,40],{"tool":35,"command":36},"npx","npx skills add sancovp\u002Fdark-factory-live --skill 0.2.6-understand-network_partition",{"tool":38,"command":39},"bunx","bunx skills add sancovp\u002Fdark-factory-live --skill 0.2.6-understand-network_partition",{"tool":41,"command":42},"pnpm","pnpm dlx skills add sancovp\u002Fdark-factory-live --skill 0.2.6-understand-network_partition","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fkbworld\u002Fstate\u002Fmodules\u002Fdistributed_consensus_and_replication_pr\u002Fskills\u002F0-2-6-understand-network-partition\u002FSKILL.md",true,[],[47,54,61,68,75,82],{"skillNo":48,"name":49,"nameZh":6,"description":50,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":51,"categories":52,"keywords":53,"publishedAt":19},"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":55,"name":56,"nameZh":6,"description":57,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":58,"categories":59,"keywords":60,"publishedAt":19},"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":62,"name":63,"nameZh":6,"description":64,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":65,"categories":66,"keywords":67,"publishedAt":19},"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":69,"name":70,"nameZh":6,"description":71,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":72,"categories":73,"keywords":74,"publishedAt":19},"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":76,"name":77,"nameZh":6,"description":78,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":19},"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":83,"name":84,"nameZh":6,"description":85,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":19},"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",[],[]]