[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7ADQKJB0R4BZRB7B88AWDWM":3,"skill-same:01M7ADQKJB0R4BZRB7B88AWDWM":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},"01M7ADQKJB0R4BZRB7B88AWDWM","0.1.5-understand-happens_before_relation",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\u002Fconcurrency_synchronization_primitives_and_memor\u002Funderstand-concurrency_synchronization_primitives_and_memor\u002Funderstand-happens_before_relation\u002F.claude\u002Fskills\u002F0.1.5-understand-happens_before_relation\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: 0.1.5-understand-happens_before_relation\ndescription: [0.1.5] A fundamental ordering relation in memory models defining that if operation A happens-before operation B, then\n---\n\n# understand-happens_before_relation\n\n**CALL NUMBER:** `concurrency_synchronization_primitives_and_memor.happens_before_relation : deep_synchronizes_with(20), deep_happens_before_relat(7), deep_c11_memory_model(1)`\n**DEFINITION:** A fundamental ordering relation in memory models defining that if operation A happens-before operation B, then A's effects are visible to B; forms the basis for reasoning about program correctness in concurrent settings.\n\nInvoke this skill to understand `happens_before_relation` 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- **atomic_cas** (d3): Compare-and-swap operation atomically loading a value, comparing it to an expected value, and storing a new value only if they matched, returning whether the swap occurred.\n\n### from `concurrency_synchronization_primitives_and_memor`\n- **synchronizes_with** (d1): A relation between atomic operations in memory models where a release fence on one thread synchronizes with an acquire fence on another thread, establishing happens-before order across threads.\n- **atomic_compare_exchange** (d2): C++11\u002FC11 atomic operation attempting to replace expected value with desired; returns boolean indicating success; on failure, expected is updated with actual value for retry loops.\n\n### from `deep_c11_memory_model`\n- **seq_cst_fence** (d2): The explicit memory fence with sequentially consistent ordering that provides both acquire and release semantics plus additional ordering constraints to enforce the global total order.\n\n### from `deep_happens_before_relat`\n- **acquire_fence** (d3): A memory ordering primitive that ensures all load and store operations appearing after the fence in program order do not begin until the fence completes and all prior writes are visible.\n- **release_fence** (d3): A memory ordering primitive that ensures all load and store operations appearing before the fence in program order complete before any operations appearing after the fence begin.\n- **synchronizes_with_acquire_side** (d4): The acquire-side endpoint of a synchronizes_with relation: an atomic operation or fence that performs an acquire action, making all subsequently observed writes visible to the acquiring thread.\n- **synchronizes_with_release_side** (d4): The release-side endpoint of a synchronizes_with relation: an atomic operation or fence that performs a release action, making all prior memory operations visible to acquiring threads.\n- **program_order** (d5): The sequential ordering of operations within a single thread as written in the source code, before any concurrent interleaving is considered.\n- **inter_thread_happens_before** (d6): The subset of happens_before relations that cross thread boundaries, established by synchronizes_with connections between release and acquire operations.\n- **happens_before_order** (d7): A transitive, irreflexive partial order over operations in a memory model that defines which operations must appear to precede others from any thread's perspective.\n\n### from `deep_synchronizes_with`\n- **atomic_load** (d2): load operation with memory_order semantics; load with acquire is the endpoint of synchronizes_with from release store\n- **atomic_store** (d2): store operation with memory_order semantics; store with release triggers synchronizes_with on matching acquire\n- **barrier_arrival** (d2): The event when a thread reaches a synchronization barrier; each arrival synchronizes-with all other arrival events at the same barrier instance, enforcing a global rendezvous.\n- **condvar_broadcast** (d2): A condition variable broadcast that wakes all waiting threads; each woken thread's lock acquire synchronizes-with the broadcast operation.\n- **condvar_signal** (d2): signal operation on condition variable; may synchronize_with a condvar_wait on the same condition variable and mutex\n- **condvar_wait** (d2): wait operation on condition variable; releases associated mutex (release) and blocks until signal (acquire); part of condvar synchronizes_with\n- **full_fence** (d2): A memory fence providing both acquire and release semantics; no memory operation on the issuing core may be reordered across the fence in either direction.\n- **lock_acquire** (d2): A synchronization operation that atomically claims exclusive access to a protected region; on most architectures it is an acquire operation establishing a synchronizes-with edge with the matching release.\n- **lock_release** (d2): A synchronization operation that atomically relinquishes exclusive access; it is a release operation establishing a synchronizes-with edge with all subsequent acquires of the same lock.\n- **memory_order_acquire** (d2): Memory ordering barrier ensuring all loads and stores after the barrier in program order cannot be reordered before it, synchronizing with release stores.\n- **memory_order_release** (d2): Memory ordering barrier ensuring all loads and stores before the barrier in program order cannot be reordered after it, making prior writes visible to acquiring threads.\n- **semaphore_acquire** (d2): A decrement of a semaphore counter that claims a permit; when it succeeds the acquire synchronizes-with the release that previously published the permit.\n- **semaphore_release** (d2): An increment of a semaphore counter that releases a permit; the release synchronizes-with any subsequent acquire that consumes that permit.\n- **signal_delivery** (d2): The delivery of a signal to a thread creates a synchronizes-with edge from the last operation before the signal mask change to the first operation in the signal handler.\n- **thread_creation** (d2): The operation of spawning a new thread of execution; the creating thread's operations before the spawn synchronizes-with the new thread's first operation in program order.\n- **thread_join** (d2): joining a thread; synchronizes_with the termination of the joined thread; acquire semantics for thread's memory effects\n- **memory_order_acq_rel** (d3): A memory ordering that is simultaneously acquire and release; applies to read-modify-write atomics and makes the update visible atomically with surrounding writes.\n- **fence_synchronizes_with_fence** (d3): A pair of fences on different threads where the second fence in program order synchronizes-with the first fence establishing an ordering boundary.\n- **fence_synchronizes_with_op** (d3): A relation where a fence on one thread establishes a synchronizes-with edge over an operation on another thread that accesses memory visible across the fence boundary.\n- **unlock_synchronizes_with** (d3): A specific instance of synchronizes-with: a lock-release operation synchronizes-with the lock-acquire operation of the same lock on another thread.\n\n## CONSUMERS (what needs this)\n`c11_memory_model`, `memory_order_relaxed`, `no_happens_before_establishment`, `relaxed_no_happens_before_edge_vs_acquire_hb_edge`, `seq_cst_atomic_visibility_happens_before_cutoff_visibility`, `seq_cst_atomic_visibility_observation_consistency_rule`, `seq_cst_global_total_order`, `synchronizes_with_absence`\n\n---\n*Projected from the `concurrency synchronization primitives and memory models` KB (407 concepts \u002F 477 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-happens_before_relation\n\n**CALL NUMBER:** `concurrency_synchronization_primitives_and_memor.happens_before_relation : deep_synchronizes_with(20), deep_happens_before_relat(7), deep_c11_memory_model(1)`\n**DEFINITION:** A fundamental ordering relation in memory models defining that if operation A happens-before operation B, then A's effects are visible to B; forms the basis for reasoning about program correctness in concurrent settings.\n\nInvoke this skill to understand `happens_before_relation` 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- **atomic_cas** (d3): Compare-and-swap operation atomically loading a value, comparing it to an expected value, and storing a new value only if they matched, returning whether the swap occurred.\n\n### from `concurrency_synchronization_primitives_and_memor`\n- **synchronizes_with** (d1): A relation between atomic operations in memory models where a release fence on one thread synchronizes with an acquire fence on another thread, establishing happens-before order across threads.\n- **atomic_compare_exchange** (d2): C++11\u002FC11 atomic operation attempting to replace expected value with desired; returns boolean indicating success; on failure, expected is updated with actual value for retry loops.\n\n### from `deep_c11_memory_model`\n- **seq_cst_fence** (d2): The explicit memory fence with sequentially consistent ordering that provides both acquire and release semantics plus additional ordering constraints to enforce the global total order.\n\n### from `deep_happens_before_relat`\n- **acquire_fence** (d3): A memory ordering primitive that ensures all load and store operations appearing after the fence in program order do not begin until the fence completes and all prior writes are visible.\n- **release_fence** (d3): A memory ordering primitive that ensures all load and store operations appearing before the fence in program order complete before any operations appearing after the fence begin.\n- **synchronizes_with_acquire_side** (d4): The acquire-side endpoint of a synchronizes_with relation: an atomic operation or fence that performs an acquire action, making all subsequently observed writes visible to the acquiring thread.\n- **synchronizes_with_release_side** (d4): The release-side endpoint of a synchronizes_with relation: an atomic operation or fence that performs a release action, making all prior memory operations visible to acquiring threads.\n- **program_order** (d5): The sequential ordering of operations within a single thread as written in the source code, before any concurrent interleaving is considered.\n- **inter_thread_happens_before** (d6): The subset of happens_before relations that cross thread boundaries, established by synchronizes_with connections between release and acquire operations.\n- **happens_before_order** (d7): A transitive, irreflexive partial order over operations in a memory model that defines which operations must appear to precede others from any thread's perspective.\n\n### from `deep_synchronizes_with`\n- **atomic_load** (d2): load operation with memory_order semantics; load with acquire is the endpoint of synchronizes_with from release store\n- **atomic_store** (d2): store operation with memory_order semantics; store with release triggers synchronizes_with on matching acquire\n- **barrier_arrival** (d2): The event when a thread reaches a synchronization barrier; each arrival synchronizes-with all other arrival events at the same barrier instance, enforcing a global rendezvous.\n- **condvar_broadcast** (d2): A condition variable broadcast that wakes all waiting threads; each woken thread's lock acquire synchronizes-with the broadcast operation.\n- **condvar_signal** (d2): signal operation on condition variable; may synchronize_with a condvar_wait on the same condition variable and mutex\n- **condvar_wait** (d2): wait operation on condition variable; releases associated mutex (release) and blocks until signal (acquire); part of condvar synchronizes_with\n- **full_fence** (d2): A memory fence providing both acquire and release semantics; no memory operation on the issuing core may be reordered across the fence in either direction.\n- **lock_acquire** (d2): A synchronization operation that atomically claims exclusive access to a protected region; on most architectures it is an acquire operation establishing a synchronizes-with edge with the matching release.\n- **lock_release** (d2): A synchronization operation that atomically relinquishes exclusive access; it is a release operation establishing a synchronizes-with edge with all subsequent acquires of the same lock.\n- **memory_order_acquire** (d2): Memory ordering barrier ensuring all loads and stores after the barrier in program order cannot be reordered before it, synchronizing with release stores.\n- **memory_order_release** (d2): Memory ordering barrier ensuring all loads and stores before the barrier in program order cannot be reordered after it, making prior writes visible to acquiring threads.\n- **semaphore_acquire** (d2): A decrement of a semaphore counter that claims a permit; when it succeeds the acquire synchronizes-with the release that previously published the permit.\n- **semaphore_release** (d2): An increment of a semaphore counter that releases a permit; the release synchronizes-with any subsequent acquire that consumes that permit.\n- **signal_delivery** (d2): The delivery of a signal to a thread creates a synchronizes-with edge from the last operation before the signal mask change to the first operation in the signal handler.\n- **thread_creation** (d2): The operation of spawning a new thread of execution; the creating thread's operations before the spawn synchronizes-with the new thread's first operation in program order.\n- **thread_join** (d2): joining a thread; synchronizes_with the termination of the joined thread; acquire semantics for thread's memory effects\n- **memory_order_acq_rel** (d3): A memory ordering that is simultaneously acquire and release; applies to read-modify-write atomics and makes the update visible atomically with surrounding writes.\n- **fence_synchronizes_with_fence** (d3): A pair of fences on different threads where the second fence in program order synchronizes-with the first fence establishing an ordering boundary.\n- **fence_synchronizes_with_op** (d3): A relation where a fence on one thread establishes a synchronizes-with edge over an operation on another thread that accesses memory visible across the fence boundary.\n- **unlock_synchronizes_with** (d3): A specific instance of synchronizes-with: a lock-release operation synchronizes-with the lock-acquire operation of the same lock on another thread.\n\n## CONSUMERS (what needs this)\n`c11_memory_model`, `memory_order_relaxed`, `no_happens_before_establishment`, `relaxed_no_happens_before_edge_vs_acquire_hb_edge`, `seq_cst_atomic_visibility_happens_before_cutoff_visibility`, `seq_cst_atomic_visibility_observation_consistency_rule`, `seq_cst_global_total_order`, `synchronizes_with_absence`\n\n---\n*Projected from the `concurrency synchronization primitives and memory models` KB (407 concepts \u002F 477 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\u002Fconcurrency_synchronization_primitives_and_memor\u002Funderstand-concurrency_synchronization_primitives_and_memor\u002Funderstand-happens_before_relation\u002F.claude\u002Fskills\u002F0.1.5-understand-happens_before_relation","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.1.5-understand-happens_before_relation",{"tool":37,"command":38},"bunx","bunx skills add sancovp\u002Fdark-factory-live --skill 0.1.5-understand-happens_before_relation",{"tool":40,"command":41},"pnpm","pnpm dlx skills add sancovp\u002Fdark-factory-live --skill 0.1.5-understand-happens_before_relation","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fsancovp\u002Fdark-factory-live\u002Fblob\u002Fmain\u002Fkbworld\u002Fstate\u002Flibraries\u002Fconcurrency_synchronization_primitives_and_memor\u002Funderstand-concurrency_synchronization_primitives_and_memor\u002Funderstand-happens_before_relation\u002F.claude\u002Fskills\u002F0.1.5-understand-happens_before_relation\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",[],[]]