[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M75QQ5CSVHARTW4XZ5SW9FBR":3,"skill-same:01M75QQ5CSVHARTW4XZ5SW9FBR":44},{"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},"01M75QQ5CSVHARTW4XZ5SW9FBR","squares-in-squares-campaign",null,"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.","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\u002Fsquares-in-squares-campaign\u002FSKILL.md",[],[],"2026-11-12 13:55:43",false,"---\nname: squares-in-squares-campaign\ndescription: \"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.\"\n---\n\n# Squares in Squares campaign\n\nThis is the playbook from our campaign. The campaign repository is private, so the file names below\ndescribe its layout; rebuild the same pieces in your own tree. Keep a route journal (frontier, routes, kills) that survives\ncontext compaction, and read it first. Take timestamps from `date`, never estimate them.\n\n## Contract and gates (never skip)\n- Metric: `src\u002Fofficial_metric.py` (verbatim Kaggle metric). Float SAT with a 1e-8 undecided band, then mpmath interval SAT at\n  50\u002F100\u002F200\u002F500 digits. Exact contacts between non-dyadic decimals are UNDECIDABLE -> rejected -> that n falls to the grid score.\n  Every moved contact needs a strictly positive gap (>= ~1e-12 via `src\u002Fcertify.py`, or >= 1.2e-8 via engine dilation).\n- Only `src\u002Fharvest.py --base ENS --out NEW CANDS...` may write `submissions\u002Fens*.csv`: it certifies every candidate puzzle (raw AND pandas-float64-rounded rows; stores the f64 rows) with the\n  official metric (parallel, float prefilter) and keeps strict improvements.\n- Before any submission: `src\u002Fgate.py submissions\u002FensX.csv` must print PASS (schema, raw \u002F pandas-float64 \u002F pandas-str round-trips agree).\n- Submitting needs the user to have joined the competition (rules acceptance is theirs). 10 submissions\u002Fday; spend them only on gated, strictly better files.\n\n## Tools\n- `engine\u002Fsqpack` (C++17): exact SAT-penalty L-BFGS + basin hopping; `engine\u002Frun.py` certifies (refuses infeasible starts;\n  use the binary directly for perturbed starts, then certify). Linux build: `CXX=g++ .\u002Fbuild.sh`. ~10k energy+grad evals\u002Fs at n=900.\n- `src\u002Fmis\u002F`: CP-SAT max-independent-set packers (axis grids + tilted lattices; band templates). Good for skeletons\u002Flattice capacity,\n  NOT for the last squares (needs continuous freedom). Use 14 workers per solve; workers=1 is useless.\n- `src\u002Faddl.py` (add-L transfer: side+1, +2*floor(s)+1 squares, preserves j=n-K^2), `src\u002Fperturb.py`, `src\u002Frender.py`, `src\u002Fscore_sub.py`.\n- `infra\u002Fremote_polish.sh` (mass polish on a rented many-core box; ubuntu:22.04 images pulled reliably, python\u002Fcuda\n  images stalled) and `infra\u002Fintake.sh` (pull all public notebook outputs and harvest).\n- Second opinions: `jev-second-perspective` for lever triage, `elicit-research` for literature.\n\n## What the frontier is (measured)\n- n=k^2+j. j\u003C=0: L=k. Above j ~ 1.2k nobody beats the grid k+1. Gap mass is at n=400..1000 (0.0997 of 0.105 vs the staff per-puzzle table).\n- Classes at k>=20: (A) 45-deg Ellsworth\u002FGoebel block, exact (a+b sqrt2)\u002F2 sides; (B) axis block + 1-2 tilted row-bands\n  (rows of m+1 at the minimal angle, (m+1)cos th + sin th = m+c), the EG\u002FChung-Graham L-frame; (C) multi-angle fault composites.\n  Interior strips are identical everywhere; the frontier's edge is a k-independent 1-2 (up to 5-6) square gain at band ENDS and CORNERS\n  (fanning angles, axis squares resting on tilted corners, odd-angle corner singles).\n- The staff table (the public notebook inversion\u002Fsquares-in-squares-per-puzzle-leaderboard)\n  is a PARTIAL union; refresh daily before pricing routes.\n\n## Dead routes (do not re-run)\nLiterature (Friedman\u002FEllsworth\u002FSquares Project n\u003C=324, Goebel\u002Fg45 families, EG\u002FCG\u002FWDL\u002FBui\u002FMcClenagan strips, Pythagorean angle menu);\nsingle-lattice MIS for band n; random hole insertion + repair; perturbed-45-degree starts for j=3..9 (wrong family: those are 24.36\u002F33.8-deg\ndiagonal bands); naive family extrapolation by t.\n\n## What works\n- Mass polish from the incumbent on a many-core box (`infra\u002Fremote_polish.sh`, 150 s x 8 threads per n): ~45% of n improve slightly;\n  ~0.002 score per 140 n. Cheap, steady, gate-safe.\n- Adversarial Fable review of every synthesis (it caught the partial-union error and the wrong R2 family).\n","# Squares in Squares campaign\n\nThis is the playbook from our campaign. The campaign repository is private, so the file names below\ndescribe its layout; rebuild the same pieces in your own tree. Keep a route journal (frontier, routes, kills) that survives\ncontext compaction, and read it first. Take timestamps from `date`, never estimate them.\n\n## Contract and gates (never skip)\n- Metric: `src\u002Fofficial_metric.py` (verbatim Kaggle metric). Float SAT with a 1e-8 undecided band, then mpmath interval SAT at\n  50\u002F100\u002F200\u002F500 digits. Exact contacts between non-dyadic decimals are UNDECIDABLE -> rejected -> that n falls to the grid score.\n  Every moved contact needs a strictly positive gap (>= ~1e-12 via `src\u002Fcertify.py`, or >= 1.2e-8 via engine dilation).\n- Only `src\u002Fharvest.py --base ENS --out NEW CANDS...` may write `submissions\u002Fens*.csv`: it certifies every candidate puzzle (raw AND pandas-float64-rounded rows; stores the f64 rows) with the\n  official metric (parallel, float prefilter) and keeps strict improvements.\n- Before any submission: `src\u002Fgate.py submissions\u002FensX.csv` must print PASS (schema, raw \u002F pandas-float64 \u002F pandas-str round-trips agree).\n- Submitting needs the user to have joined the competition (rules acceptance is theirs). 10 submissions\u002Fday; spend them only on gated, strictly better files.\n\n## Tools\n- `engine\u002Fsqpack` (C++17): exact SAT-penalty L-BFGS + basin hopping; `engine\u002Frun.py` certifies (refuses infeasible starts;\n  use the binary directly for perturbed starts, then certify). Linux build: `CXX=g++ .\u002Fbuild.sh`. ~10k energy+grad evals\u002Fs at n=900.\n- `src\u002Fmis\u002F`: CP-SAT max-independent-set packers (axis grids + tilted lattices; band templates). Good for skeletons\u002Flattice capacity,\n  NOT for the last squares (needs continuous freedom). Use 14 workers per solve; workers=1 is useless.\n- `src\u002Faddl.py` (add-L transfer: side+1, +2*floor(s)+1 squares, preserves j=n-K^2), `src\u002Fperturb.py`, `src\u002Frender.py`, `src\u002Fscore_sub.py`.\n- `infra\u002Fremote_polish.sh` (mass polish on a rented many-core box; ubuntu:22.04 images pulled reliably, python\u002Fcuda\n  images stalled) and `infra\u002Fintake.sh` (pull all public notebook outputs and harvest).\n- Second opinions: `jev-second-perspective` for lever triage, `elicit-research` for literature.\n\n## What the frontier is (measured)\n- n=k^2+j. j\u003C=0: L=k. Above j ~ 1.2k nobody beats the grid k+1. Gap mass is at n=400..1000 (0.0997 of 0.105 vs the staff per-puzzle table).\n- Classes at k>=20: (A) 45-deg Ellsworth\u002FGoebel block, exact (a+b sqrt2)\u002F2 sides; (B) axis block + 1-2 tilted row-bands\n  (rows of m+1 at the minimal angle, (m+1)cos th + sin th = m+c), the EG\u002FChung-Graham L-frame; (C) multi-angle fault composites.\n  Interior strips are identical everywhere; the frontier's edge is a k-independent 1-2 (up to 5-6) square gain at band ENDS and CORNERS\n  (fanning angles, axis squares resting on tilted corners, odd-angle corner singles).\n- The staff table (the public notebook inversion\u002Fsquares-in-squares-per-puzzle-leaderboard)\n  is a PARTIAL union; refresh daily before pricing routes.\n\n## Dead routes (do not re-run)\nLiterature (Friedman\u002FEllsworth\u002FSquares Project n\u003C=324, Goebel\u002Fg45 families, EG\u002FCG\u002FWDL\u002FBui\u002FMcClenagan strips, Pythagorean angle menu);\nsingle-lattice MIS for band n; random hole insertion + repair; perturbed-45-degree starts for j=3..9 (wrong family: those are 24.36\u002F33.8-deg\ndiagonal bands); naive family extrapolation by t.\n\n## What works\n- Mass polish from the incumbent on a many-core box (`infra\u002Fremote_polish.sh`, 150 s x 8 threads per n): ~45% of n improve slightly;\n  ~0.002 score per 140 n. Cheap, steady, gate-safe.\n- Adversarial Fable review of every synthesis (it caught the partial-union error and the wrong R2 family).\n",{"name":5,"description":7},"main","365c7327d2f1497e7febccb97758c0358e7e2579","skills\u002Fsquares-in-squares-campaign",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 squares-in-squares-campaign",{"tool":36,"command":37},"bunx","bunx skills add odinfree\u002Fstorm-ecdsa-harness --skill squares-in-squares-campaign",{"tool":39,"command":40},"pnpm","pnpm dlx skills add odinfree\u002Fstorm-ecdsa-harness --skill squares-in-squares-campaign","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Fsquares-in-squares-campaign\u002FSKILL.md",true,[],[45,52,59,66,73,80],{"skillNo":46,"name":47,"nameZh":6,"description":48,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":49,"categories":50,"keywords":51,"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":53,"name":54,"nameZh":6,"description":55,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":56,"categories":57,"keywords":58,"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":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},"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":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},"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":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},"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",[],[],{"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},"01M75QPRX3V19RK99C0V4RTBGB","route-compare-probe-discipline","Compare baseline and candidate on identical input vectors before blaming one call for ecdsa.fail residual or eval dirt. Use when a structural edit changes the op stream, because Fiat-Shamir sampling then tests the two circuits on different shots and can create or hide failures.","https:\u002F\u002Fgithub.com\u002Fodinfree\u002Fstorm-ecdsa-harness\u002Fblob\u002Fmain\u002Fskills\u002Froute-compare-probe-discipline\u002FSKILL.md",[],[]]