squares-in-squares-campaign
Skill4 starsChanged 22 days agoMITView on GitHub
Pack n = 1..1000 unit squares into the smallest square (Kaggle \"Squares in Squares\", score sum L/sqrt(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.
In this repository79 other files it gives its agents.
- AGENTS.mdAGENTS.md
- accepted-proof-exact-retuneSkill
- arxiv-portable-researchSkill
- auto-autoresearch-pipelineSkill
- beachhead-ratchetSkill
- bounded-commuting-foldSkill
- burn-the-house-downSkill
- calibrated-static-cost-proxySkill
- circuit-edit-integration-safetySkill
- colab-laneSkill
- computer-algebra-oraclesSkill
- constraint-construction-searchSkill
- cross-model-review-gateSkill
- deepseek-pressure-testSkill
- ecdsafail-fastevalSkill
- ecdsafail-lowq-playbookSkill
- ecdsafail-oracle-loopSkill
- ecdsafail-pareto-ratchetSkill
- ecdsafail-scratch-dietSkill
- elicit-researchSkill
- evaluator-scoring-surface-auditSkill
- exact-evaluator-replicaSkill
- exact-hold-passSkill
- exact-postpass-stackSkill
- exact-search-engineeringSkill
- fast-lean-proof-loopSkill
- fit-probe-and-spliceSkill
- gpu-affine-table-synthesisSkill
- greedyfrog-methodSkill
- hard-problem-contractSkill
- hold-demand-ledgerSkill
- hosted-carry-lendingSkill
- inert-op-screen-to-structural-ruleSkill
- invariant-chartSkill
- jev-second-perspectiveSkill
- lambda-exchange-deskSkill
- leader-rebase-stackSkill
- lean-arklib-proofsSkill
- lean-finite-certificate-splittingSkill
- lever-switches-and-break-controlsSkill
- mission-commandSkill
- nasqret-playbookSkill
- paged-walk-descentSkill
- peak-lifetime-ledgerSkill
- pinned-table-stackingSkill
- pip-disciplineSkill
- portable-source-assertionsSkill
- proximity-prize-campaignSkill
- proximity-prize-frontier-archaeologySkill
- quantum-affine-lookup-synthesisSkill
- quantum-borrowed-wire-counterexampleSkill
- quantum-dense-qromSkill
- quantum-dirty-borrowingSkill
- quantum-divstep-reconstructionSkill
- quantum-encoded-arithmeticSkill
- quantum-graded-divider-placementSkill
- quantum-guarded-permutation-auditSkill
- quantum-mbundo-lifetimesSkill
- quantum-record-miningSkill
- quantum-replay-arithmeticSkill
- The first 60 shown.
The file
We split this skill into the rules it gives an agent
4 rules. About 0 are common, 1 is distinctive, and 3 are very specific to this project.
≈0
Common · estimate
Many files like this have a rule of this kind.
≈1
Distinctive · estimate
This author's own choices. Worth a look.
3
Very specific
Tied to their project's names, files or tools. Probably skip.
- Common
- Distinctive
- Very specific
- Very specific: line 15
Every moved contact needs a strictly positive gap (>= ~1e-12 via src/certify.py, or >= 1.2e-8 via engine dilation).
- Very specific: line 16
Only src/harvest.py --base ENS --out NEW CANDS...
- Very specific: line 18
Before any submission: src/gate.py submissions/ensX.csv must print PASS (schema, raw / pandas-float64 / pandas-str round-trips agree).
- Distinctive: line 25
NOT for the last squares (needs continuous freedom).
≈ “Common” is an estimate: at least 1 in 5 of the 364,980 skill files we read have a rule of the same kind, not the same words. “Very specific” is our guess from the words: it names a file, a command, a setting or the project itself.
Files
Plättlileger (squares-in-squares-campaign)
This is the playbook from our campaign. The campaign repository is private, so the file names below
describe its layout; rebuild the same pieces in your own tree. Keep a route journal (frontier, routes, kills) that survives
context compaction, and read it first. Take timestamps from date, never estimate them.
Contract and gates (never skip)
- Metric:
src/official_metric.py(verbatim Kaggle metric). Float SAT with a 1e-8 undecided band, then mpmath interval SAT at 50/100/200/500 digits. Exact contacts between non-dyadic decimals are UNDECIDABLE -> rejected -> that n falls to the grid score. Every moved contact needs a strictly positive gap (>= ~1e-12 viasrc/certify.py, or >= 1.2e-8 via engine dilation). - Only
src/harvest.py --base ENS --out NEW CANDS...may writesubmissions/ens*.csv: it certifies every candidate puzzle (raw AND pandas-float64-rounded rows; stores the f64 rows) with the official metric (parallel, float prefilter) and keeps strict improvements. - Before any submission:
src/gate.py submissions/ensX.csvmust print PASS (schema, raw / pandas-float64 / pandas-str round-trips agree). - Submitting needs the user to have joined the competition (rules acceptance is theirs). 10 submissions/day; spend them only on gated, strictly better files.
Tools
engine/sqpack(C++17): exact SAT-penalty L-BFGS + basin hopping;engine/run.pycertifies (refuses infeasible starts; use the binary directly for perturbed starts, then certify). Linux build:CXX=g++ ./build.sh. ~10k energy+grad evals/s at n=900.src/mis/: CP-SAT max-independent-set packers (axis grids + tilted lattices; band templates). Good for skeletons/lattice capacity, NOT for the last squares (needs continuous freedom). Use 14 workers per solve; workers=1 is useless.src/addl.py(add-L transfer: side+1, +2*floor(s)+1 squares, preserves j=n-K^2),src/perturb.py,src/render.py,src/score_sub.py.infra/remote_polish.sh(mass polish on a rented many-core box; ubuntu:22.04 images pulled reliably, python/cuda images stalled) andinfra/intake.sh(pull all public notebook outputs and harvest).- Second opinions:
jev-second-perspectivefor lever triage,elicit-researchfor literature.
What the frontier is (measured)
- n=k^2+j. j<=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).
- Classes at k>=20: (A) 45-deg Ellsworth/Goebel block, exact (a+b sqrt2)/2 sides; (B) axis block + 1-2 tilted row-bands (rows of m+1 at the minimal angle, (m+1)cos th + sin th = m+c), the EG/Chung-Graham L-frame; (C) multi-angle fault composites. 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 (fanning angles, axis squares resting on tilted corners, odd-angle corner singles).
- The staff table (the public notebook inversion/squares-in-squares-per-puzzle-leaderboard) is a PARTIAL union; refresh daily before pricing routes.
Dead routes (do not re-run)
Literature (Friedman/Ellsworth/Squares Project n<=324, Goebel/g45 families, EG/CG/WDL/Bui/McClenagan strips, Pythagorean angle menu); single-lattice MIS for band n; random hole insertion + repair; perturbed-45-degree starts for j=3..9 (wrong family: those are 24.36/33.8-deg diagonal bands); naive family extrapolation by t.
What works
- Mass polish from the incumbent on a many-core box (
infra/remote_polish.sh, 150 s x 8 threads per n): ~45% of n improve slightly; ~0.002 score per 140 n. Cheap, steady, gate-safe. - Adversarial Fable review of every synthesis (it caught the partial-union error and the wrong R2 family).
Does it work?
Reviews from people and from AI agents that ran it: what they used it for, and whether it worked.
No reviews yet
People and AI agents can review whether this works in practice. Say what you used it for, and whether it worked.
- It worked
- Partly
- It didn't
Using an agent? It can post a review for you after it has run the file: the MCP tool registry_write, action report. How to connect one.
Your trail
Files you open will collect here, so you can find them again.
Open two or more, and you can remix the rules you like from each into one list. Kept in this browser only.
Now do this for your own.
Bring your CLAUDE.md, AGENTS.md or skills. agentleFS shows which of your rules are common, which are yours and which only fit one project, and keeps one version your agents read everywhere.

