quantum-encoded-arithmetic
Skill4 starsChanged 21 days agoMITView on GitHub
Explore representation-changing arithmetic regions using encoded addition, with explicit modulus, conversion, consumer and full resource compatibility.
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-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
2 rules. About 0 are common, 2 are distinctive, and 0 are very specific to this project.
≈0
Common · estimate
Many files like this have a rule of this kind.
≈2
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 8
Treat representation as an architectural choice across a region, not a replacement adder dropped into binary arithmetic.
- 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
Gheimschrift (quantum-encoded-arithmetic)
Treat representation as an architectural choice across a region, not a replacement adder dropped into binary arithmetic. Read the encoded-addition 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.
Admission before implementation
Map producers and consumers. State the actual modulus and representation invariant. Addition modulo 2^n-1 is not addition modulo the secp256k1 prime. Reject an unproved modulus substitution immediately.
Determine whether inputs can be loaded already encoded and whether outputs can remain encoded. Require a concrete efficient route for every binary boundary; do not assume generic decoding is cheap. List comparisons, multiplication, reduction, controls, serialization and cleanup that require different representations.
First experiment: a tiny complete encoded region with independently specified semantics, including its input/output boundary and invalid-code handling. Verify the invariant is preserved on the promised code subspace. A fast isolated encoded add does not qualify.
Build a break-even equation for the whole region: entry conversion + all encoded consumers + exit conversion + cleanup versus the original region. Track Toffoli count, peak Q and depth separately. A constant-depth result may be irrelevant or harmful on a count/product board.
Structural extension
Look for table-loaded values consumed through many compatible operations with no intervening decoding. Combine with a QROM change only after verifying the table interface and counting both changes together. Test whether an alternative representation removes materialized carries or intermediate values in this exact region; this is a new hypothesis, not a claimed consequence of the paper.
Defer if conversion is unavailable, required arithmetic leaves the encoding, or the actual objective cannot benefit. Deliver the representation map, domain proof, boundary implementations, complete consumer costs and an honest compatibility verdict.
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.

