quantum-divstep-reconstruction
Skill4 starsChanged 21 days agoMITView on GitHub
Replace stored reversible branch history with successor-state decision reconstruction or hybrid storage in prime-field arithmetic.
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-encoded-arithmeticSkill
- quantum-graded-divider-placementSkill
- quantum-guarded-permutation-auditSkill
- quantum-mbundo-lifetimesSkill
- quantum-record-miningSkill
- quantum-replay-arithmeticSkill
- quantum-residue-scan-ambiguitySkill
- The first 60 shown.
The file
We split this skill into the rules it gives an agent
1 rule. About 0 are common, 1 is distinctive, and 0 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.
0
Very specific
Tied to their project's names, files or tools. Probably skip.
- Common
- Distinctive
- Very specific
- Distinctive: line 10
Read the shared contract before a trial.
≈ “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
Brösmelispur (quantum-divstep-reconstruction)
Target information storage itself: identify which past decisions are already encoded in successor state. Read the divstep source.
Read the shared contract before a trial. Start with the five-line post; the shared native-test order, stop rules and promotion gate apply.
Practical lane
Write the exact recurrence and state: signed control counter, integer registers, field payloads and history. State domain, parity, width and determinant invariants. For each branch, ask whether the successor state uniquely determines the decision. Prove that claim for this recurrence; do not import a theorem solely because both implementations are called GCD.
First experiment: derive reachable states from actual forward traversals, then exhaustively enumerate the justified small domain, group predecessors by successor and required reverse action, and detect ambiguities. Derive the minimum predicate required by the actual consumer. Compare direct predicate evaluation, full decision reconstruction and stored-bit fallback; independently verify reverse transitions.
Bound decoding cost and temporary lifetimes before removing history. Reconstructing a bit can cost more than preserving it. If a hybrid route survives, price its full emitted history stack, overflow behavior, all forward/reverse traversals and both divisions. Reject any assumption that an average history length supplies a worst-case storage guarantee.
Structural extension
Try consumer-specific predicates that bypass generic decoding. Alternatively construct an independent divstep family with a common point-add interface. These are distinct experiments and should not share claimed savings.
A smaller published qubit count alone does not imply a better Q*T score, nor a feasible point below a target qubit cap. Deliver proof premises, ambiguity census, decoder/fallback boundary, capacity evidence and integrated resources. Stop on ambiguous reconstruction without enough stored information, violated theorem premises, or a decoder whose complete cost erases the proposed gain.
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.

