[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M75QJVNH8A4CTWN74HCP49X4":3,"skill-same:01M75QJVNH8A4CTWN74HCP49X4":58},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"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":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":6,"ownerHtmlUrl":28,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":29,"install":30,"resources":43},"01M75QJVNH8A4CTWN74HCP49X4","constraint-construction-search",null,"Encode and verify finite construction or optimization searches with CryptoMiniSat, Z3, OR-Tools CP-SAT or Gurobi, including witness extraction, model audits, and calibrated UNSAT or optimality claims.","odinfree\u002Fstorm-ecdsa-harness","odinfree","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F58338510?v=4","01M75QJA86AKR72RA1GBG2JGKV","01M75QJA8R22TWRQR8CYFXH6F7",4,"MIT","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fconstraint-construction-search\u002FSKILL.md",[],[],"2026-11-12 13:55:43",false,"---\nname: constraint-construction-search\ndescription: \"Encode and verify finite construction or optimization searches with CryptoMiniSat, Z3, OR-Tools CP-SAT or Gurobi, including witness extraction, model audits, and calibrated UNSAT or optimality claims.\"\n---\n\n# Constraint construction search\n\nTranslate a finite mathematical construction problem into constraints, solve it, and verify the result outside the solver. The encoding is a proof obligation, not clerical glue.\n\n## Choose the formulation\n\nRead [references\u002Fsolver-routing.md](references\u002Fsolver-routing.md) when choosing between Boolean, SMT, CP-SAT, and MIP formulations.\n\n- Use CryptoMiniSat for Boolean structure with substantial XOR or parity constraints.\n- Use Z3 for bit-vectors, bounded integers, arrays, symbolic relations, or mixed logical structure.\n- Use OR-Tools CP-SAT for bounded-integer combinatorial models with global or scheduling-style constraints.\n- Use Gurobi for linear or mixed-integer formulations when a licensed installation is available and numerical tolerances are controlled.\n\n## Encoding contract\n\n1. Define variables, domains, symmetry breaking, constraints, objective, and the mathematical map between models and objects.\n2. Bound every integer and bit-vector operation. State overflow, wraparound, and signedness semantics.\n3. Test the encoding on hand-built satisfiable and unsatisfiable fixtures, including boundary cases.\n4. Emit a witness in a solver-neutral format and verify the original mathematical predicate with separate code.\n5. Freeze model text or generated-model hash, solver version, parameters, seed, time limit, termination status, and logs.\n6. Treat feasibility, infeasibility, bounded objective, and proved optimum as different outcomes.\n7. Apply the certification rules in [references\u002Fcertification.md](references\u002Fcertification.md) before reporting UNSAT or optimality.\n\n## Stop conditions\n\n- Stop if the independent verifier reconstructs the solver's encoding instead of checking the original object.\n- Stop if a real-valued tolerance, big-M constant, overflow, or implicit coercion can change feasibility.\n- Stop if symmetry breaking has no proof that every equivalence class retains a representative.\n- Stop before using licensed software, remote services, or paid compute without the required authority.\n","# Constraint construction search\n\nTranslate a finite mathematical construction problem into constraints, solve it, and verify the result outside the solver. The encoding is a proof obligation, not clerical glue.\n\n## Choose the formulation\n\nRead [references\u002Fsolver-routing.md](references\u002Fsolver-routing.md) when choosing between Boolean, SMT, CP-SAT, and MIP formulations.\n\n- Use CryptoMiniSat for Boolean structure with substantial XOR or parity constraints.\n- Use Z3 for bit-vectors, bounded integers, arrays, symbolic relations, or mixed logical structure.\n- Use OR-Tools CP-SAT for bounded-integer combinatorial models with global or scheduling-style constraints.\n- Use Gurobi for linear or mixed-integer formulations when a licensed installation is available and numerical tolerances are controlled.\n\n## Encoding contract\n\n1. Define variables, domains, symmetry breaking, constraints, objective, and the mathematical map between models and objects.\n2. Bound every integer and bit-vector operation. State overflow, wraparound, and signedness semantics.\n3. Test the encoding on hand-built satisfiable and unsatisfiable fixtures, including boundary cases.\n4. Emit a witness in a solver-neutral format and verify the original mathematical predicate with separate code.\n5. Freeze model text or generated-model hash, solver version, parameters, seed, time limit, termination status, and logs.\n6. Treat feasibility, infeasibility, bounded objective, and proved optimum as different outcomes.\n7. Apply the certification rules in [references\u002Fcertification.md](references\u002Fcertification.md) before reporting UNSAT or optimality.\n\n## Stop conditions\n\n- Stop if the independent verifier reconstructs the solver's encoding instead of checking the original object.\n- Stop if a real-valued tolerance, big-M constant, overflow, or implicit coercion can change feasibility.\n- Stop if symmetry breaking has no proof that every equivalence class retains a representative.\n- Stop before using licensed software, remote services, or paid compute without the required authority.\n",{"name":5,"description":7},"main","365c7327d2f1497e7febccb97758c0358e7e2579","skills\u002Fconstraint-construction-search",3,"https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness","https:\u002F\u002Fgithub.com\u002Fodinfree","2026-10-30 23:13:43",{"source":8,"skillName":5,"commands":31,"prompt":41,"zipAvailable":42},[32,35,38],{"tool":33,"command":34},"npx","npx skills add odinfree\u002Fstorm-ecdsa-harness --skill constraint-construction-search",{"tool":36,"command":37},"bunx","bunx skills add odinfree\u002Fstorm-ecdsa-harness --skill constraint-construction-search",{"tool":39,"command":40},"pnpm","pnpm dlx skills add odinfree\u002Fstorm-ecdsa-harness --skill constraint-construction-search","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fconstraint-construction-search\u002FSKILL.md",true,[44,50,54],{"path":45,"resourceType":46,"resourceTypeDesc":47,"sizeBytes":48,"sourceHtmlUrl":49},"agents\u002Fopenai.yaml","REFERENCE","参考文档",295,"https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fconstraint-construction-search\u002Fagents\u002Fopenai.yaml",{"path":51,"resourceType":46,"resourceTypeDesc":47,"sizeBytes":52,"sourceHtmlUrl":53},"references\u002Fcertification.md",980,"https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fconstraint-construction-search\u002Freferences\u002Fcertification.md",{"path":55,"resourceType":46,"resourceTypeDesc":47,"sizeBytes":56,"sourceHtmlUrl":57},"references\u002Fsolver-routing.md",730,"https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fconstraint-construction-search\u002Freferences\u002Fsolver-routing.md",[59,66,73,80,87,94],{"skillNo":60,"name":61,"nameZh":6,"description":62,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":63,"categories":64,"keywords":65,"publishedAt":18},"01M75QQC9A02AFE91366WNZZPA","verify-research-transfer","Check whether a literature finding supports a proposed performance optimization. Read the primary figures and the implementation source, then run a cheap falsifier before writing code or benchmarks.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fverify-research-transfer\u002FSKILL.md",[],[],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":70,"categories":71,"keywords":72,"publishedAt":18},"01M75QQ95WZ1J5HK6DNAGRPPYG","verify-paired-native-measurements","Audit the process, sample and archive evidence behind paired native benchmarks, especially wrappers around an unchanged official client. Use before admitting benchmark results or when reviewing the controller that produced them. Ordinary unit tests do not need this.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fverify-paired-native-measurements\u002FSKILL.md",[],[],{"skillNo":74,"name":75,"nameZh":6,"description":76,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":77,"categories":78,"keywords":79,"publishedAt":18},"01M75QQ5CSVHARTW4XZ5SW9FBR","squares-in-squares-campaign","Pack n = 1..1000 unit squares into the smallest square (Kaggle \"Squares in Squares\", score sum L\u002Fsqrt(n) - 1). Use when improving, certifying or submitting packings, or when choosing the next search route. Covers the official-metric gates, the solver and MIS tools, the structure of the frontier, and the routes measured dead. The competition closed on 25 Oct 2026.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fsquares-in-squares-campaign\u002FSKILL.md",[],[],{"skillNo":81,"name":82,"nameZh":6,"description":83,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":18},"01M75QQ13S3G39R2VTAGF298ET","shot-autopsy","When a candidate fails shots its parent passes, find the structural cause before any nonce search. Reconstruct the exact failing shot, localize the first divergence, repair it by paying precision, and keep the case as a permanent regression. Learned from bulengerk's ecdsa.fail rows. Use when an edited candidate fails shots its parent passed, or when counts drift between builds.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fshot-autopsy\u002FSKILL.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":91,"categories":92,"keywords":93,"publishedAt":18},"01M75QPY03H8X6CFN5YYY35E8R","send-to-claude-fable","Send a bounded task or review packet to the local Claude Code CLI on the Fable model and bring back its verdict. Use when you want an independent second opinion from a different model.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fsend-to-claude-fable\u002FSKILL.md",[],[],{"skillNo":95,"name":96,"nameZh":6,"description":97,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":98,"categories":99,"keywords":100,"publishedAt":18},"01M75QPVJ89VVS9KWEZ7JH27R4","rust-archive-build-binding","Prevent stale Cargo artifacts when a source archive is restored over a reused Rust target directory. Use for reproducible benchmark comparisons and for moving source archives between machines.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Frust-archive-build-binding\u002FSKILL.md",[],[]]