exact-search-engineering
Skill4 starsChanged 20 days agoMITView on GitHub
Build and verify performance-critical exact searches in FLINT, Nemo, Julia, C++ or Rust when a general computer algebra system is too slow or exhaustive coverage has to be engineered explicitly.
In this repository34 other files it gives its agents.
- AGENTS.mdAGENTS.md
- accepted-proof-exact-retuneSkill
- beachhead-ratchetSkill
- circuit-edit-integration-safetySkill
- 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
- fast-lean-proof-loopSkill
- hard-problem-contractSkill
- invariant-chartSkill
- jev-second-perspectiveSkill
- lean-arklib-proofsSkill
- lean-finite-certificate-splittingSkill
- mission-commandSkill
- nasqret-playbookSkill
- pip-disciplineSkill
- portable-source-assertionsSkill
- proximity-prize-campaignSkill
- proximity-prize-frontier-archaeologySkill
- research-loopSkill
- route-compare-probe-disciplineSkill
- rust-archive-build-bindingSkill
- send-to-claude-fableSkill
- shot-autopsySkill
- squares-in-squares-campaignSkill
- verify-paired-native-measurementsSkill
- verify-research-transferSkill
The file
We split this skill into the rules it gives an agent
9 rules. About 0 are common, 9 are distinctive, and 0 are very specific to this project.
≈0
Common · estimate
Many files like this have a rule of this kind.
≈9
Distinctive · estimate
This author's own choices. Worth a look.
0
Very specific
Tied to their project's names, files or tools. Probably skip.
- Common
- Distinctive
- Very specific
- Distinctive: line 12
Read references/implementation-routing.md before changing language or library.
- Distinctive: line 14
Use FLINT when the hot kernel is exact integer, rational, finite-field, or polynomial arithmetic and low-level control pays.
- Distinctive: line 15
Use Nemo when Julia-level composition and FLINT-backed exact arithmetic shorten the implementation without obscuring the model.
- Distinctive: line 16
Use C++ or Rust for tight loops, data-layout control, parallel scheduling, or a small standalone search binary.
- Distinctive: line 17
Use Julia for rapid specialization and orchestration when measurements show acceptable runtime and allocation behavior.
- Distinctive: line 22
Create a small reference implementation and known fixtures before optimizing.
- Distinctive: line 25
Use exact types and prove or check every narrowing conversion and overflow bound.
- Distinctive: line 33
No witness found means only that the recorded coverage was searched.
- Distinctive: line 37
Do not install toolchains, start paid compute, or reserve remote capacity without the authority required for that environment.
≈ “Common” is an estimate: at least 1 in 5 of the 350,495 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
Exact search engineering
Turn a mathematically defined finite search into a deterministic search engine and a separate exact verifier. Preserve exactness, coverage, and replay while improving speed.
Route by bottleneck
Read references/implementation-routing.md before changing language or library.
- Use FLINT when the hot kernel is exact integer, rational, finite-field, or polynomial arithmetic and low-level control pays.
- Use Nemo when Julia-level composition and FLINT-backed exact arithmetic shorten the implementation without obscuring the model.
- Use C++ or Rust for tight loops, data-layout control, parallel scheduling, or a small standalone search binary.
- Use Julia for rapid specialization and orchestration when measurements show acceptable runtime and allocation behavior.
Build contract
- Freeze the mathematical domain, enumeration order, symmetry reductions, and acceptance predicate.
- Create a small reference implementation and known fixtures before optimizing.
- Measure the baseline. Profile before moving languages, adding threads, or rewriting arithmetic.
- Move only the measured hot path. Keep the verifier simpler than the searcher and free of search-only pruning.
- Use exact types and prove or check every narrowing conversion and overflow bound.
- Make sharding deterministic and disjoint. Checkpoints must record the exact covered interval or canonical shard ID.
- Compare optimized and reference implementations on exhaustive small domains plus randomized larger fixtures.
- Preserve the receipt in references/search-receipt.md.
Claim boundaries
- A found witness is valid only after the separate verifier accepts it.
- No witness found means only that the recorded coverage was searched.
- Exhaustiveness requires a complete, duplicate-aware coverage manifest with zero unclassified skips.
- A speedup is relative to a named baseline, input distribution, build, host, and correctness gate.
Do not install toolchains, start paid compute, or reserve remote capacity without the authority required for that environment.
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.