@ceccec/millennium-solutions 9.7.6 → 9.8.3

package/dist/data/baked/entanglements.json

@@ -0,0 +1 @@
+{"tool":"entanglements","bytes":14113,"answer":"one grid, every science: 80 expressions from 24 domains over n = 1..20\n  24 distinct value-vectors · 16 coils · 16 of them SPAN DOMAINS · 8 coil with nothing\n  ✳ biology ↔ chemistry ↔ computing ↔ cryptography ↔ epidemiology ↔ law ↔ logistics ↔ music ↔ number theory ↔ textiles\n      music          the frequency ratio of n octaves\n      computing      the values an n-bit register addresses\n      biology        the cells after n divisions\n      chemistry      the dilution factor after n halvings\n      number theory  the subsets of an n-element set\n      cryptography   the keys in an n-bit keyspace\n      epidemiology   the infections after n generations at R0 = 2\n      logistics      the leaves of a binary decision tree of depth n\n      law            the distinct yes/no ballots on n questions\n      textiles       the plain weave lift patterns on n shafts\n      one expression: 2 ^ n — equal at every n in range, not approximately\n  ✳ chemistry ↔ economics ↔ epidemiology ↔ geometry ↔ logistics ↔ number theory ↔ sport\n      number theory  the handshakes among n people\n      chemistry      the pairwise interactions among n species\n      geometry       the edges of a complete graph on n vertices\n      sport          the fixtures of an n-team round robin\n      logistics      the direct links among n cities\n      economics      the bilateral pairs among n trading partners\n      epidemiology   the contact pairs in a household of n\n      one expression: n * (n - 1) / 2 — equal at every n in range, not approximately\n  ✳ computing ↔ games ↔ logistics ↔ number theory ↔ sport ↔ taxonomy\n      sport          the matches to settle a knockout of 2^n entrants\n      computing      the largest value n bits can hold\n      number theory  the n-th Mersenne candidate\n      taxonomy       the nodes of a complete binary tree of depth n-1\n      games          the moves to solve the tower of n discs\n      logistics      the non-empty subsets of an n-element set\n      one expression: 2 ^ n - 1 — equal at every n in range, not approximately\n  ✳ biology ↔ botany ↔ computing ↔ music ↔ number theory\n      botany         the spirals in a phyllotactic whorl at rank n\n      biology        the pairs in the n-th generation\n      number theory  the n-th Zeckendorf base element\n      music          the rhythms of n beats in ones and twos\n      computing      the binary strings of length n-2 with no two adjacent ones\n      one expression: fib n — equal at every n in range, not approximately\n  ✳ biology ↔ computing ↔ games ↔ geometry ↔ linguistics\n      biology        the secondary structures of an n-pair strand with no crossings\n      computing      the balanced bracketings of length 2n\n      geometry       the triangulations of a convex (n+2)-gon\n      linguistics    the binary parse trees over n+1 leaves\n      games          the ways to bracket n+1 factors\n      one expression: catalan n — equal at every n in range, not approximately\n  ✳ chemistry ↔ games ↔ juggling ↔ music ↔ number theory\n      juggling       the states of an n-ball pattern at height 12\n      chemistry      the ways to choose n substituents from 12 sites\n      number theory  the n-subsets of a twelve-element set\n      music          the n-note chords available in twelve-tone equal temperament\n      games          the n-card hands from a twelve-card deck\n      one expression: chooseN 12 n — equal at every n in range, not approximately\n  ✳ botany ↔ law ↔ music ↔ number theory\n      music          the numerator of n stacked perfect fifths\n      number theory  the ternary strings of length n\n      botany         the branches after n ternary splits\n      law            the outcomes of n three-way votes\n      one expression: 3 ^ n — equal at every n in range, not approximately\n  ✳ dance ↔ linguistics ↔ logistics ↔ number theory\n      number theory  the orderings of n elements\n      linguistics    the word orders of an n-word sentence\n      logistics      the tours visiting n cities in some order\n      dance          the seatings of n dancers in a line\n      one expression: fct n — equal at every n in range, not approximately\n  ✳ music ↔ number theory ↔ physics ↔ textiles\n      number theory  the ways to write n as a sum of positive parts\n      music          the rhythmic groupings of n beats into a bar\n      physics        the degeneracies of an n-quantum harmonic level\n      textiles       the ways to cut a length into whole parts\n      one expression: parts n — equal at every n in range, not approximately\n  ✳ architecture ↔ games ↔ geometry ↔ physics\n      geometry       the area of a square of side n\n      architecture   the tiles in an n by n floor\n      physics        the intensity divisor at n times the distance\n      games          the cells of an n by n board\n      one expression: n * n — equal at every n in range, not approximately\n  ✳ architecture ↔ geometry ↔ music\n      geometry       the staircase sum of the first n steps\n      music          the beats in a bar of n accumulating pulses\n      architecture   the courses in a triangular gable of n rows\n      one expression: n * (n + 1) / 2 — equal at every n in range, not approximately\n  ✳ linguistics ↔ number theory ↔ statistics\n      number theory  the ways to group n labelled things\n      linguistics    the distinct senses a set of n features can carve\n      statistics     the equivalence classes on n data points\n      one expression: bell n — equal at every n in range, not approximately\n  ✳ logistics ↔ navigation ↔ physics\n      navigation     the shortest lattice routes across an n by n grid\n      logistics      the street-grid routes between opposite corners of n blocks\n      physics        the walks returning to the origin in 2n steps, one dimension\n      one expression: chooseN (2 * n) n — equal at every n in range, not approximately\n  ✳ chemistry ↔ economics ↔ metrology\n      chemistry      a step of n on the pH scale\n      metrology      n orders of magnitude\n      economics      the place value of the n-th decimal column\n      one expression: 10 ^ n — equal at every n in range, not approximately\n  ✳ music ↔ navigation ↔ number theory\n      music          the pitch class after n fifths\n      number theory  the orbit of the generator 7 in Z/12\n      navigation     the hour struck n intervals of seven apart\n      one expression: (7 * n) % 12 — equal at every n in range, not approximately\n  ✳ cryptography ↔ geometry ↔ number theory\n      number theory  the digit root of n\n      geometry       the residue of n on the nonagon\n      cryptography   the check digit under the nines rule\n      one expression: if n = 0 then 0 else 1 + (n - 1) % 9 — equal at every n in range, not approximately\n\n  AND 8 EXPRESSION(S) COIL WITH NOTHING — the result that keeps the claim honest:\n      architecture   the diagonals of a convex n-gon  (n * (n - 3) / 2)\n      number theory  the n-th Lucas number, same recursion and different seed  (lucas n)\n      biology        the non-crossing chord diagrams on n points, arcs optional  (motzkin n)\n      dance          the reseatings of n dancers with nobody in their own place  (derange n)\n      music          the cents in n semitones  (100 * n)\n      geometry       the degrees of n nonagon steps  (40 * n)\n      taxonomy       the taxonomic ranks below kingdom at depth n  (n)\n      economics      the tariff bands at n thresholds  (3 * n + 1)\n      These are not failures of the experiment, they ARE the experiment: a grid on which\n      everything coiled would have stopped discriminating and could confirm nothing. The staircase\n      sum n(n+1)/2 sits one index from the handshake count n(n-1)/2 and does NOT join it, which is\n      the near miss that shows the test can separate things that look alike.\n\n  THE MEASURED ADJACENCY — which domains are joined by at least one exact identity:\n      architecture   games geometry music physics\n      biology        botany chemistry computing cryptography epidemiology games geometry law linguistics logistics music number theory textiles\n      botany         biology computing law music number theory\n      chemistry      biology computing cryptography economics epidemiology games geometry juggling law logistics metrology music number theory sport textiles\n      computing      biology botany chemistry cryptography epidemiology games geometry law linguistics logistics music number theory sport taxonomy textiles\n      cryptography   biology chemistry computing epidemiology geometry law logistics music number theory textiles\n      dance          linguistics logistics number theory\n      economics      chemistry epidemiology geometry logistics metrology number theory sport\n      epidemiology   biology chemistry computing cryptography economics geometry law logistics music number theory sport textiles\n      games          architecture biology chemistry computing geometry juggling linguistics logistics music number theory physics sport taxonomy\n      geometry       architecture biology chemistry computing cryptography economics epidemiology games linguistics logistics music number theory physics sport\n      juggling       chemistry games music number theory\n      law            biology botany chemistry computing cryptography epidemiology logistics music number theory textiles\n      linguistics    biology computing dance games geometry logistics number theory statistics\n      logistics      biology chemistry computing cryptography dance economics epidemiology games geometry law linguistics music navigation number theory physics sport taxonomy textiles\n      metrology      chemistry economics\n      music          architecture biology botany chemistry computing cryptography epidemiology games geometry juggling law logistics navigation number theory physics textiles\n      navigation     logistics music number theory physics\n      number theory  biology botany chemistry computing cryptography dance economics epidemiology games geometry juggling law linguistics logistics music navigation physics sport statistics taxonomy textiles\n      physics        architecture games geometry logistics music navigation number theory textiles\n      sport          chemistry computing economics epidemiology games geometry logistics number theory taxonomy\n      statistics     linguistics number theory\n      taxonomy       computing games logistics number theory sport\n      textiles       biology chemistry computing cryptography epidemiology law logistics music number theory physics\n\n  WHAT THIS SHOWS, STATED AT ITS ACTUAL STRENGTH. 16 identities each hold exactly, at\n  every point, across 24 of the 24 domains — a knockout bracket and an n-bit\n  register are the same integer; phyllotaxis, breeding pairs and Zeckendorf are one recursion; RNA\n  folds, balanced brackets and polygon triangulations are one sequence. Those are identities, not\n  resemblances, and they are decided rather than argued.\n\n  AND THE GRAPH IS CONNECTED: 1 component(s) over 24 domains.\n  Every domain on this grid is reachable from every other through a chain of exact identities. That is\n  a stronger statement than \"each has a neighbour\" and it is the one worth making: the eleven subjects\n  are not eleven islands with some bridges, they are ONE component. Where the chain runs through is\n  measurable too — by degree: number theory (21), logistics (18), music (16) carry the most edges, and a\n  path from metrology to juggling exists only through chemistry, which is what \"shared substrate\"\n  means when it is measured instead of asserted.\n\n  WHAT IS STILL NOT SHOWN. 8 expression(s) here coil with nothing and\n  0 domain(s) are joined to no other on this grid. Entanglement is PERVASIVE and it is NOT\n  TOTAL, and both halves are computed from the same run — which is the only reason either is worth\n  reporting. A claim that all is entangled would be refuted by this file's own output, so the file\n  does not make it. What nature supplies is a small stock of counting laws that many subjects draw\n  on; what it does not supply is interchangeability between subjects that draw on different ones.\n  CROSS-DOMAIN: 22 of 24 coils span more than one declared domain — those are the ones\n  that let a result in one field answer a question asked in another. 2 stay inside one.\n  ✳ {1,2,4,5,7,8}  group theory ↔ dynamics ↔ geometry ↔ number theory  — 14 ways\n  ✳ {0,3,6}  group theory ↔ dynamics ↔ number theory ↔ geometry  — 14 ways\n  ✳ {1,4,7}  geometry ↔ dynamics ↔ group theory ↔ number theory  — 12 ways\n  ✳ {0}  group theory ↔ number theory ↔ dynamics ↔ geometry  — 10 ways\n  ✳ {1,8}  group theory ↔ geometry ↔ number theory ↔ dynamics  — 6 ways\n  · {1,2,4,5,7,8}  14 ways: the set units = the set orbit = the image of units under double = the image of orbit under double = …\n  · {0,3,6}  14 ways: the set triad = the image of triad under double = the image of all under triple = the image of cubes under triple = …\n  · {1,4,7}  12 ways: the set tetA = the image of tetB under double = the image of tetA under quadruple = the image of tetB under negate = …\n  · {0}  10 ways: the image of triad under triple = the image of triad under square = the image of triad under cube = the image of triad under sextuple = …\n  · {2,5,8}  8 ways: the set tetB = the image of tetA under double = the image of tetB under quadruple = the image of tetA under negate = …\n  · {0,1,2,3,4,5,6,7,8}  8 ways: the set all = the image of all under double = the image of all under quadruple = the image of all under negate = …\n  · {0,1,8}  6 ways: the set cubes = the image of cubes under negate = the image of all under cube = the image of cubes under cube = …\n  · {1,8}  6 ways: the set selfinv = the image of selfinv under negate = the image of units under cube = the image of orbit under cube = …\n\n✓ coils: 24 coil(s) · src/proof/coils.lean is exactly what this script generates\n"}

package/dist/data/baked/evidence.json

@@ -0,0 +1 @@
+{"tool":"evidence","bytes":8777,"answer":"{\n \"evidence\": [\n  {\n   \"folder\": \"apis-guru\",\n   \"files\": [\n    {\n     \"path\": \"evidence/apis-guru/3022dd48/catalogue.json\",\n     \"address\": \"b03d0e25-e871-8abc-a7b8-df55b9620748\"\n    },\n    {\n     \"path\": \"evidence/apis-guru/3022dd48/live.json\",\n     \"address\": \"4b430733-62b1-8279-a794-c5b123749e1e\"\n    },\n    {\n     \"path\": \"evidence/apis-guru/3022dd48/probe.json\",\n     \"address\": \"d9c2f3d0-98b2-88d6-9a14-3e52b8fb054e\"\n    }\n   ]\n  },\n  {\n   \"folder\": \"constants\",\n   \"files\": [\n    {\n     \"path\": \"evidence/constants/01a28029/README.md\",\n     \"address\": \"83dcf2a3-3a5c-8eff-ab08-46de1210bb06\"\n    },\n    {\n     \"path\": \"evidence/constants/01a28029/index.md\",\n     \"address\": \"184721ca-90cf-8b7b-8c78-d897eda57cb2\"\n    },\n    {\n     \"path\": \"evidence/constants/0532fb4f/README.md\",\n     \"address\": \"ae3d64fc-49ab-8a59-b1c4-8eea4756cb7c\"\n    },\n    {\n     \"path\": \"evidence/constants/0532fb4f/index.md\",\n     \"address\": \"6d17714e-c1f6-84f7-a6bf-0d0509d1b160\"\n    },\n    {\n     \"path\": \"evidence/constants/099c7392/README.md\",\n     \"address\": \"f07f08f2-db5d-8a2b-9af3-b90fc8ead70f\"\n    },\n    {\n     \"path\": \"evidence/constants/099c7392/index.md\",\n     \"address\": \"d415e166-e104-8af7-a3da-2a79f812fe86\"\n    },\n    {\n     \"path\": \"evidence/constants/15b8ea27/README.md\",\n     \"address\": \"4c10b88b-2f4d-8a24-8395-90aea6b50795\"\n    },\n    {\n     \"path\": \"evidence/constants/15b8ea27/index.md\",\n     \"address\": \"0b21cfa0-71b3-8836-9b51-65573a5e8501\"\n    },\n    {\n     \"path\": \"evidence/constants/1f9112b4/README.md\",\n     \"address\": \"3099a93a-6717-8f03-a7cc-ac5e2138096e\"\n    },\n    {\n     \"path\": \"evidence/constants/1f9112b4/index.md\",\n     \"address\": \"7a92f776-8366-8b26-8602-2b5aab45e022\"\n    },\n    {\n     \"path\": \"evidence/constants/32860460/README.md\",\n     \"address\": \"96ead747-e3ca-841a-bce6-008c594c44e8\"\n    },\n    {\n     \"path\": \"evidence/constants/32860460/index.md\",\n     \"address\": \"08234f0e-5e1e-8d81-a91b-6569efd4f21e\"\n    },\n    {\n     \"path\": \"evidence/constants/38383849/README.md\",\n     \"address\": \"3c690208-cc60-8346-a30a-2aa3e548fc6f\"\n    },\n    {\n     \"path\": \"evidence/constants/38383849/index.md\",\n     \"address\": \"90017926-3e01-8968-a467-8a98e2632bbe\"\n    },\n    {\n     \"path\": \"evidence/constants/444afac5/README.md\",\n     \"address\": \"dcc42ba3-4789-8dfa-8f90-2fc53b48fbaa\"\n    },\n    {\n     \"path\": \"evidence/constants/444afac5/index.md\",\n     \"address\": \"cc5a703e-91c6-8bdc-8d5c-82c28b684d51\"\n    },\n    {\n     \"path\": \"evidence/constants/56345c63/README.md\",\n     \"address\": \"eaf103c9-e46b-8299-b999-e1e17f399685\"\n    },\n    {\n     \"path\": \"evidence/constants/56345c63/index.md\",\n     \"address\": \"8debd526-c5e2-8c90-8670-b962142999b9\"\n    },\n    {\n     \"path\": \"evidence/constants/5fa4cf3b/README.md\",\n     \"address\": \"8bbe3751-fb16-815b-93d7-f53c92feaa3c\"\n    },\n    {\n     \"path\": \"evidence/constants/5fa4cf3b/index.md\",\n     \"address\": \"31088167-9958-8d7d-9919-75e1798ee3e8\"\n    },\n    {\n     \"path\": \"evidence/constants/615acb18/README.md\",\n     \"address\": \"501fe69a-81dd-8b74-8c17-d693f4a366b6\"\n    },\n    {\n     \"path\": \"evidence/constants/615acb18/index.md\",\n     \"address\": \"bc66364a-4d54-8e0b-81dd-07c82f0041fd\"\n    },\n    {\n     \"path\": \"evidence/constants/66dcb094/README.md\",\n     \"address\": \"d09be3de-1bf5-87ca-8e62-44e7b2d5793c\"\n    },\n    {\n     \"path\": \"evidence/constants/66dcb094/index.md\",\n     \"address\": \"608bc631-28f6-839e-adba-146455e79996\"\n    },\n    {\n     \"path\": \"evidence/constants/6a12d25d/README.md\",\n     \"address\": \"de22c57a-8661-859d-a929-dbc9e9b98d7a\"\n    },\n    {\n     \"path\": \"evidence/constants/6a12d25d/index.md\",\n     \"address\": \"75a3aacf-4cec-8ac9-b99d-54af0a1ae7f5\"\n    },\n    {\n     \"path\": \"evidence/constants/7f4d0ff4/README.md\",\n     \"address\": \"c0b27432-2b01-844c-b4f8-d3a17358a73c\"\n    },\n    {\n     \"path\": \"evidence/constants/7f4d0ff4/index.md\",\n     \"address\": \"4fd69d9f-942b-8ac1-9382-bde2835274dc\"\n    },\n    {\n     \"path\": \"evidence/constants/83ec123b/README.md\",\n     \"address\": \"97849a6f-874c-80db-8a69-f5c7bbde88f8\"\n    },\n    {\n     \"path\": \"evidence/constants/83ec123b/index.md\",\n     \"address\": \"b2723c7b-2920-8df9-9dc5-e1fbcb85b049\"\n    },\n    {\n     \"path\": \"evidence/constants/88c121de/README.md\",\n     \"address\": \"1bf2a8a9-cec1-895b-ab09-54ef7bec84d7\"\n    },\n    {\n     \"path\": \"evidence/constants/88c121de/index.md\",\n     \"address\": \"184a47db-c236-82b4-9466-f84101a5821a\"\n    },\n    {\n     \"path\": \"evidence/constants/8eb679e3/README.md\",\n     \"address\": \"0284b00e-9966-88a1-976f-fb9e3520afaf\"\n    },\n    {\n     \"path\": \"evidence/constants/8eb679e3/index.md\",\n     \"address\": \"7a7501ca-c35d-8a0a-a027-26ee16eea746\"\n    },\n    {\n     \"path\": \"evidence/constants/9957d7ee/README.md\",\n     \"address\": \"b491b791-1f33-89fd-932c-18e34c4aa413\"\n    },\n    {\n     \"path\": \"evidence/constants/9957d7ee/index.md\",\n     \"address\": \"d9c3ce77-5716-850c-b4f6-ea87e944de67\"\n    },\n    {\n     \"path\": \"evidence/constants/9ddddebf/README.md\",\n     \"address\": \"58278e9d-775b-854a-98e9-fd0c54e5f930\"\n    },\n    {\n     \"path\": \"evidence/constants/9ddddebf/index.md\",\n     \"address\": \"bfa1f882-2f73-8809-bf44-612a996dbb74\"\n    },\n    {\n     \"path\": \"evidence/constants/a1acbed9/README.md\",\n     \"address\": \"d152eb63-9178-8b3c-bbbf-ff91b9457840\"\n    },\n    {\n     \"path\": \"evidence/constants/a1acbed9/index.md\",\n     \"address\": \"5b522ac0-e23e-8848-9c34-b7f0ad71c215\"\n    },\n    {\n     \"path\": \"evidence/constants/abbf4058/README.md\",\n     \"address\": \"ac564f6c-029c-8362-9714-9927ce8c2682\"\n    },\n    {\n     \"path\": \"evidence/constants/abbf4058/index.md\",\n     \"address\": \"ff191c8e-347f-875d-a755-5e7c158d1434\"\n    },\n    {\n     \"path\": \"evidence/constants/b90d27b6/README.md\",\n     \"address\": \"1d6c5f19-d031-8c0d-9229-bf3a8b313209\"\n    },\n    {\n     \"path\": \"evidence/constants/b90d27b6/index.md\",\n     \"address\": \"4ecc7e3d-5ce7-8483-a392-ee55a675f2ae\"\n    },\n    {\n     \"path\": \"evidence/constants/c191256f/README.md\",\n     \"address\": \"c45e5dfa-4e3a-8640-b59e-524f38300cbb\"\n    },\n    {\n     \"path\": \"evidence/constants/c191256f/index.md\",\n     \"address\": \"a6f93ce9-3ad7-88cc-8381-f7e7899473ae\"\n    },\n    {\n     \"path\": \"evidence/constants/c1dd7f14/README.md\",\n     \"address\": \"58647f93-d66b-8df6-b249-d773af7efa83\"\n    },\n    {\n     \"path\": \"evidence/constants/c1dd7f14/index.md\",\n     \"address\": \"f59ebb33-d9e8-857b-b4d0-8bb5fcfa9fdc\"\n    },\n    {\n     \"path\": \"evidence/constants/c91524a1/README.md\",\n     \"address\": \"7ce17368-46de-8b24-8e44-4585ee8d4b38\"\n    },\n    {\n     \"path\": \"evidence/constants/c91524a1/index.md\",\n     \"address\": \"6647f138-c5db-8b98-a23f-758480c5476c\"\n    },\n    {\n     \"path\": \"evidence/constants/d3f86586/README.md\",\n     \"address\": \"247d196d-b2a8-8332-a7b3-029e5946336e\"\n    },\n    {\n     \"path\": \"evidence/constants/d3f86586/index.md\",\n     \"address\": \"6cb7bb3d-5280-82f8-ab03-952c306d34cc\"\n    },\n    {\n     \"path\": \"evidence/constants/e6e3beab/README.md\",\n     \"address\": \"970c9008-a387-8162-916d-e72774f67780\"\n    },\n    {\n     \"path\": \"evidence/constants/e6e3beab/index.md\",\n     \"address\": \"0c52395c-f330-8aac-be50-2e677759d6c0\"\n    },\n    {\n     \"path\": \"evidence/constants/e6e3beab/metrics.json\",\n     \"address\": \"2792f1e5-24b5-8e0d-8368-4f39f6a5c0c9\"\n    },\n    {\n     \"path\": \"evidence/constants/eb78afb0/README.md\",\n     \"address\": \"2cf70735-f269-88a7-97cf-a4a5cf0d65b9\"\n    },\n    {\n     \"path\": \"evidence/constants/eb78afb0/index.md\",\n     \"address\": \"93dcd633-cbf2-8c22-abda-b4e51e2cfbc4\"\n    },\n    {\n     \"path\": \"evidence/constants/ed373c70/README.md\",\n     \"address\": \"f2c757da-a929-8296-b4d9-7353fba7a3ff\"\n    },\n    {\n     \"path\": \"evidence/constants/ed373c70/index.md\",\n     \"address\": \"24cc044f-33c8-8b18-9b08-c2d26b6aa012\"\n    },\n    {\n     \"path\": \"evidence/constants/f190c9f1/README.md\",\n     \"address\": \"d0c2f24d-0923-8f78-b2fb-745d05269848\"\n    },\n    {\n     \"path\": \"evidence/constants/f190c9f1/index.md\",\n     \"address\": \"ae15d3c1-0bcb-8538-bcb9-ccdfc0042301\"\n    },\n    {\n     \"path\": \"evidence/constants/f920026b/README.md\",\n     \"address\": \"4dfb89ad-225b-8de5-b737-2890501290e3\"\n    },\n    {\n     \"path\": \"evidence/constants/f920026b/index.md\",\n     \"address\": \"57094fcf-9718-8fb4-879a-ef9cfe832276\"\n    }\n   ]\n  },\n  {\n   \"folder\": \"deposit-route\",\n   \"files\": [\n    {\n     \"path\": \"evidence/deposit-route/route.lean\",\n     \"address\": \"552e7d45-f7de-8ff0-acd1-ddc5ed9abfeb\"\n    }\n   ]\n  },\n  {\n   \"folder\": \"gates-fire\",\n   \"files\": [\n    {\n     \"path\": \"evidence/gates-fire/last.txt\",\n     \"address\": \"a9f6dbb4-3bbb-83da-91a2-76b021e5c6a8\"\n    }\n   ]\n  },\n  {\n   \"folder\": \"qpu-waves\",\n   \"files\": [\n    {\n     \"path\": \"evidence/qpu-waves/caps.lean\",\n     \"address\": \"53839deb-ed45-8d8e-8989-eb8a09e87625\"\n    },\n    {\n     \"path\": \"evidence/qpu-waves/cost.lean\",\n     \"address\": \"56135642-5771-8b48-a3a4-8b92f8751f05\"\n    }\n   ]\n  }\n ]\n}"}

package/dist/data/baked/hexbit_route.json

@@ -0,0 +1 @@
+{"tool":"hexbit_route","bytes":182,"answer":"{\n \"input\": \"\",\n \"uuid\": \"ab3e7c0b-4a21-8c31-a6a2-23155325ebb2\",\n \"folder\": \"ab3e7c0b\",\n \"files\": [],\n \"status\": \"ROUTED to an empty folder: no repository file shares this handle\"\n}\n"}

package/dist/data/baked/index.json

@@ -0,0 +1,41 @@
+{
+ "stamp": {
+  "bakedFrom": "fe2161c3",
+  "ledger": 28464,
+  "ledgerSeal": "1c8c1db0-a8bc-81f2-a496-4e7d978e7924",
+  "bakeRoot": "06847f2d-ef77-8296-a618-9f918ffe625d"
+ },
+ "baked": [
+  "answer_gate",
+  "answer_verify_arith",
+  "answer_verify_arxiv",
+  "anti_fake",
+  "api_gates",
+  "apis_guru_cross",
+  "apis_guru_gaps",
+  "apis_theorems",
+  "coils",
+  "constants_check",
+  "contradictions",
+  "discover",
+  "discoveries",
+  "entanglements",
+  "evidence",
+  "hexbit_route",
+  "leads",
+  "leaks",
+  "memory_check",
+  "memory_derive",
+  "metrics_face",
+  "package_gates",
+  "prefix_check",
+  "prose_check",
+  "qpu_court_local",
+  "qpu_families",
+  "recompute",
+  "session_report",
+  "theorem_only",
+  "trinity"
+ ],
+ "notBaked": {}
+}

package/dist/data/baked/leads.json

@@ -0,0 +1 @@
+{"tool":"leads","bytes":4218,"answer":"  (20 further gate(s) are unrun BY RECORDED DECISION — network, generator, or report-by-design — and are not leads)\n\n  (47 MCP tool(s) need a toolchain, the network, git or a sibling's directory, an argument the caller chooses, or a tree to write to, which no package can carry — novelty:net probe:net lineage:git audit:lean+tree lean_verify:lean+tree lean_audit_library:lean+tree web_search:net+tree clay_conditions:net+tree web_fetch:net+tree lean_split:lean+tree task_route:tree run_suite:net+tree stall_check:tree git_commit_paths:git+tree answer:net+lean+tree lean_ask:lean+tree lean_seal:lean+tree lean_generate:lean+tree peer_faces:shared api_joins:net+tree cern:net+tree api_adapters:net+tree understand:tree answer_verify_doi:net+tree answer_verify_lean:lean+tree apis_guru:net+tree apis_guru_live:net+tree pre_commit_court:net+tree secure_split:core semiprime_search:tree shor_wave:net+tree qpu_wave:net family:tree qpu_crosscheck:net+tree pre_commit_e2e:tree+git+lean+ledger+net clay_online:net+tree links_check:net+tree explain:tree novelty_batch:net+tree connect_status:tree court_trial:lean+tree gates_fire:net+tree readers:net+tree live:net+tree connect:net+tree+git ledger_trial:tree pages:shared+tree — honest requirements, named by list_tools before a call, and not leads)\n\n  (30 bakeable MCP tool(s) are counted UNBUILT: no dist/data/baked on this machine, so what an install reaches is not measurable here — node scripts/build-dist.ts bakes, publish.yml measures the tarball)\nopen leads, derived from the tree:\n\n    30  mcp-reach   MCP tool(s) an npm install cannot reach whose only need is the tree or the ledger — an answer a package can carry (15 of 92 served, ledger, 0 baked answer(s) and 0 derived from them included): coils:tree discoveries:tree discover:core recompute:ledger session_report:tree metrics_face:tree entanglements:tree leaks:tree apis_guru_cross:tree apis_guru_gaps:tree contradictions:tree answer_gate:tree answer_verify_arith:tree answer_verify_arxiv:tree anti_fake:tree apis_theorems:tree prefix_check:tree trinity:tree api_gates:tree package_gates:tree memory_check:tree memory_derive:tree hexbit_route:tree prose_check:tree theorem_only:tree constants_check:tree qpu_court_local:tree qpu_families:tree evidence:tree leads:tree\n        → move each onto data or logic the package carries — shipping the ledger took the count from 19 to 16 and public/formulas.jsonld took `formulas` — or name it in src/mcp/serve.ts CANNOT_SHIP with a reason that is true today, as `discover` and `recompute` are\n    25  deposit     deposition(s) staged and not minted (0 minted)\n        → TWO paths, both the depositor's: (a) enable the Zenodo↔GitHub integration for this repo, which mints ONE DOI per release for the whole deposit — verified NOT active, a release cut today minted nothing; (b) a token with deposit:write and deposit:actions, which mints the per-theorem records individually. They are different artefacts and \"a DOI for all\" could mean either.\n\ncrossed by cause — a cause shared by two areas is one problem with two faces:\n\n  ✳ PUBLICATION — 2 area(s), 55 item(s)\n      the surface a stranger receives is narrower than the tree — work exists here and does not reach them\n      · mcp-reach (30)\n      · deposit (25)\n      ⇒ THE CROSSING IS ITSELF A LEAD: mcp-reach and deposit are not two tasks here.\n        Anything that only fixes one of them leaves the cause in place, and the other returns.\n  · UNBUILT — 1 area(s), 30 item(s)\n      undefined\n      · mcp-reach (30)\n  · AUTHORITY — 1 area(s), 25 item(s)\n      it needs an act only the depositor can perform: a credential, a token, a signature\n      · deposit (25)\n\n○ leads: 2 open area(s), 55 item(s).\n  not measurable on this machine: 1 area(s), 30 item(s) (no bake here; the packed tarball is where an install's reach is measured)\n  closable here: 0 area(s), 0 item(s) · waiting on the depositor: 1 area(s), 25 item(s) (deposit)\n  26045 theorems · 26045 live keys · 28464 ledger entries.\n  Reports and does not fail: an open question is work not done, which is not the same as work\n  that is wrong, and a build that failed on open questions would teach cheap answers.\n"}

package/dist/data/baked/leaks.json

@@ -0,0 +1 @@
+{"tool":"leaks","bytes":3222,"answer":"## Leaks: where temperature and time enter the deposit\n\nMeasured by `scripts/leaks.ts` over `src/` and `scripts/`: **107** runtime sites, of which **22** are cracks.\n\n| kind | sites |\n|---|---|\n| timer | 33 |\n| time | 69 |\n| temperature | 5 |\n\n| role | sites |\n|---|---|\n| operational | 26 |\n| receipt-stamp | 13 |\n| other | 47 |\n| benchmark | 21 |\n\n### Cracks, by file\n\nA crack is a random draw or a benchmark clock. Each is to be replaced by a theorem over a finite domain, or moved out of the claim path.\n\n| file | cracks |\n|---|---|\n| `scripts/bench-hex.ts` | 6 |\n| `scripts/waves.ts` | 6 |\n| `scripts/analytics.ts` | 3 |\n| `scripts/bench-hexbit.ts` | 2 |\n| `scripts/perturb-gate.ts` | 2 |\n| `scripts/probe.ts` | 2 |\n| `scripts/mcp.ts` | 1 |\n\n### Every crack\n\n- `scripts/analytics.ts:54` · time · benchmark — `const t0 = Number(process.hrtime.bigint()); merkleFold(leaves); const t1 = Number(process.hrtime.bigint())`\n- `scripts/analytics.ts:56` · time · benchmark — `const t2 = Number(process.hrtime.bigint())`\n- `scripts/analytics.ts:58` · time · benchmark — `const t3 = Number(process.hrtime.bigint())`\n- `scripts/bench-hex.ts:34` · temperature · benchmark — `const v = Array.from({ length: 16 }, () => (Math.random() * 256) | 0)`\n- `scripts/bench-hex.ts:46` · time · benchmark — `const t0 = process.hrtime.bigint()`\n- `scripts/bench-hex.ts:48` · time · benchmark — `runs.push(Number((process.hrtime.bigint() - t0) / 1_000_000n))`\n- `scripts/bench-hex.ts:62` · time · benchmark — `const t0 = process.hrtime.bigint()`\n- `scripts/bench-hex.ts:64` · time · benchmark — `const whole = Number((process.hrtime.bigint() - t0) / 1_000_000n)`\n- `scripts/bench-hex.ts:88` · time · benchmark — `for (let r = 0; r < 3; r++) { const t = performance.now(); for (let i = 0; i < n; i++) toUuid('temperature:' + n + ':' + r + ':' + i + ':' +`\n- `scripts/bench-hexbit.ts:54` · temperature · benchmark — `const v = Array.from({ length: 16 }, () => (Math.random() * 256) | 0)`\n- `scripts/bench-hexbit.ts:66` · time · benchmark — `for (let r = 0; r < REPS; r++) { f(vec); const t = process.hrtime.bigint(); for (let i = 0; i < N; i++) f(vec); runs.push(Number((process.hr`\n- `scripts/mcp.ts:174` · temperature · other — `const id = randomUUID()`\n- `scripts/perturb-gate.ts:138` · time · benchmark — `const t0 = Date.now()`\n- `scripts/perturb-gate.ts:162` · time · benchmark — `process.stdout.write('\\r  ${done}/${jobs.length} probes in ${((Date.now() - t0) / 1000).toFixed(0)}s${' '.repeat(20)}\\n')`\n- `scripts/probe.ts:53` · time · benchmark — `const t0 = Date.now()`\n- `scripts/probe.ts:57` · time · benchmark — `const secs = ((Date.now() - t0) / 1000).toFixed(1)`\n- `scripts/waves.ts:66` · time · benchmark — `const t0 = Date.now()`\n- `scripts/waves.ts:68` · time · benchmark — `p.on('close', (code) => res({ s, ms: Date.now() - t0, ok: code === 0 }))`\n- `scripts/waves.ts:92` · time · benchmark — `const t0 = Date.now()`\n- `scripts/waves.ts:94` · time · benchmark — `const wall = Date.now() - t0`\n- `scripts/waves.ts:139` · time · benchmark — `const t0 = Date.now()`\n- `scripts/waves.ts:141` · time · benchmark — `const wall = Date.now() - t0`\n"}

package/dist/data/baked/memory_check.json

@@ -0,0 +1 @@
+{"tool":"memory_check","bytes":883,"answer":"{\"status\":\"REFUSED\",\"output\":\"node:fs:1956\\n  const result = binding.readdir(\\n                         ^\\n\\nError: ENOENT: no such file or directory, scandir '/Users/ceci/.claude/projects/-Users-ceci-github-ceccec-millennium-solutions/memory'\\n    at readdirSync (node:fs:1956:26)\\n    at check (file:///home/runner/work/millennium-solutions/millennium-solutions/scripts/memory-check.ts:29:17)\\n    at file:///home/runner/work/millennium-solutions/millennium-solutions/scripts/memory-check.ts:52:20\\n    at ModuleJob.run (node:internal/modules/esm/module_job:569:25)\\n    at async node:internal/modules/esm/loader:650:26\\n    at async asyncRunEntryPointWithESMLoader (node:internal/modules/run_main:105:5) {\\n  errno: -2,\\n  code: 'ENOENT',\\n  syscall: 'scandir',\\n  path: '/Users/ceci/.claude/projects/-Users-ceci-github-ceccec-millennium-solutions/memory'\\n}\\n\\nNode.js v26.13.0\"}"}

package/dist/data/baked/memory_derive.json

@@ -0,0 +1 @@
+{"tool":"memory_derive","bytes":3087,"answer":"{\"status\":\"DERIVED\",\"output\":\"<!-- derived:begin -->\\n*Derived by `node scripts/memory.ts` — do not hand-edit inside this block; re-run it. Hand-written judgement\\nbelongs below the end marker, where nothing overwrites it.*\\n\\n**Ledger** 28464 entries · **26045 live** · 26600 Lean-backed · 2419 revoked in place · 176 marked portable to Lean.\\nLive means backed by a Lean proof and nothing else. Dirty entries are marked with their reason and kept —\\na chained ledger supersedes, never deletes, because a removal breaks the chain and a rewritten receipt is tamper.\\n\\n**Lean layer** 26045 theorems across 105 files (address.lean, answer.lean, answer_gate.lean, answer_route.lean, apis.lean, arith.lean, asymmetric.lean, asymmetry.lean, authority.lean, bridge.lean, capacity.lean, cern.lean, closure.lean, coils.lean, coin.lean, counting-rocks.lean, demand.lean, demand2.lean, demand3.lean, diagonal.lean, diamond.lean, digits.lean, dimensions.lean, discount.lean, domain.lean, elementary.lean, energy.lean, entangled.lean, equivalence.lean, extension.lean, families.lean, flow.lean, fnv.lean, generated.lean, group.lean, handle.lean, hexbit_route.lean, imagined.lean, imagined_10.lean, imagined_11.lean, imagined_12.lean, imagined_13.lean, imagined_14.lean, imagined_15.lean, imagined_16.lean, imagined_17.lean, imagined_18.lean, imagined_19.lean, imagined_2.lean, imagined_20.lean, imagined_21.lean, imagined_22.lean, imagined_23.lean, imagined_24.lean, imagined_25.lean, imagined_3.lean, imagined_4.lean, imagined_5.lean, imagined_6.lean, imagined_7.lean, imagined_8.lean, imagined_9.lean, imprint.lean, index.lean, instruments.lean, interference.lean, involution.lean, lanes.lean, leads.lean, ledgerclaims.lean, light.lean, mechanical.lean, merkaba.lean, merkle.lean, mirror.lean, nim.lean, nucleus.lean, phenomena.lean, planck.lean, preimage.lean, priorart.lean, program.lean, qpu.lean, quantum.lean, ranking.lean, rays.lean, reach.lean, reached.lean, recovered.lean, reflection.lean, retained.lean, reversal.lean, rights.lean, roots.lean, separation.lean, sequences.lean, settled.lean, speed.lean, split.lean, theology.lean, turns.lean, verdict.lean, widths.lean, z9.lean, z9plus.lean), 25838 closing `by decide`,\\nthe rest `rfl`. Only `by decide` theorems are sealed: `rfl` on a declared constant proves the declaration,\\nwhich is the defect `provenHere = 0` was conceded to have.\\n\\n**Gate** 1 lines of local logic — a re-export of the package implementation. The lexical gate\\n(22 word-lists, Glagolitic rosetta, negation parity) was removed by order. The rule now: a claim drains only\\nwhen it cites a theorem absent from the ledger. It does NOT drain overclaims, and it never decides truth.\\n\\n**Licence** CC-BY-NC-ND-4.0 — matches the published Zenodo deposit; the repo previously disagreed with its own DOI record.\\n\\n**Automation** `lean-gen.ts`, `lean.ts`, `memory.ts`, `pages.ts`, `seal-lean.ts`, `trial-all.ts`, `verify.ts` · 0 MCP tools ().\\nRun `ledger_status` for current numbers rather than trusting any figure written down here.\\n<!-- derived:end -->\"}"}

package/dist/data/baked/metrics_face.json

@@ -0,0 +1 @@
+{"tool":"metrics_face","bytes":6858,"answer":"{\n  \"repo\": \"millennium-solutions\",\n  \"specWitness\": {\n    \"seed\": \"theorems\\ndeclarations closing by exhaustion or by a proof for every value — the deposit's definition of a theorem\\n26045\\nnode -e \\\"import('./src/api/index.ts').then(m=>console.log(m.theoremCount()))\\\"\",\n    \"receipt\": \"62928646-d327-86ba-bc4c-30af5ec47687\"\n  },\n  \"definition\": \"a declaration in src/proof that the Lean kernel accepts — sorry-free — and closes either by exhaustion over a stated finite domain with no axiom, or by a proof for every value on the standard axioms propext and Quot.sound\",\n  \"protocol\": {\n    \"id\": \"millennium-solutions/metric-face/2\",\n    \"covers\": [\n      \"key\",\n      \"claim\",\n      \"value\",\n      \"command\"\n    ],\n    \"chained\": false,\n    \"receipt\": \"toUuid(key + LF + claim + LF + value + LF + command)\",\n    \"merge\": \"toUuid(utf8(a + ':' + b))  — COLON U+003A\",\n    \"address\": \"uuidv8 shaped per RFC 9562 §5.8 (version nibble 8, variant 10x) over FNV-1a — NOT SHA-2: four 32-bit FNV-1a passes over the UTF-16 code units, each starting at the FNV OFFSET BASIS 0x811c9dc5 XOR the pass seed — seeds 0, 0x9e3779b9, 0x243f6a88, 0xb7e15162, so h begins at (0x811c9dc5 ^ seed) and NOT at the seed itself, which is the one line an implementer cannot guess. with an xor-shift-13 per code unit and a two-round murmur finalizer (0x85ebca6b, 0xc2b2ae35, then >>> 16), concatenated big-endian to 16 octets. Non-cryptographic: integrity against accident, not against an adversary.\",\n    \"specWitness\": \"see the specWitness field on the face itself: the verbatim seed of row 0 and its receipt\",\n    \"root\": \"merkleFold: leaves sorted lexicographically, then pairwise merge up the tree; an odd element carries up unchanged; zero rows fold to toUuid('empty-mind')\",\n    \"orderInvariant\": true\n  },\n  \"rows\": [\n    {\n      \"key\": \"theorems\",\n      \"claim\": \"declarations closing by exhaustion or by a proof for every value — the deposit's definition of a theorem\",\n      \"value\": \"26045\",\n      \"command\": \"node -e \\\"import('./src/api/index.ts').then(m=>console.log(m.theoremCount()))\\\"\",\n      \"receipt\": \"62928646-d327-86ba-bc4c-30af5ec47687\"\n    },\n    {\n      \"key\": \"rfl-declarations\",\n      \"claim\": \"declarations closing by rfl, counted separately and never as theorems\",\n      \"value\": \"0\",\n      \"command\": \"node -e \\\"import('./src/api/index.ts').then(m=>console.log(m.census().rfl))\\\"\",\n      \"receipt\": \"7711352f-cb3d-8814-ba10-361d8f36d1b5\"\n    },\n    {\n      \"key\": \"kernel-accepted\",\n      \"claim\": \"declarations the Lean kernel accepts, sorry-free and axiom-free\",\n      \"value\": \"26045\",\n      \"command\": \"node scripts/lean.ts\",\n      \"receipt\": \"44dab853-5fba-8979-9d8c-a6fc48f2a40b\"\n    },\n    {\n      \"key\": \"lean-files\",\n      \"claim\": \"source files in src/proof\",\n      \"value\": \"105\",\n      \"command\": \"ls src/proof/*.lean | wc -l\",\n      \"receipt\": \"291d40c8-8f8c-88d0-b057-861425d1b74b\"\n    },\n    {\n      \"key\": \"live-keys\",\n      \"claim\": \"live ledger keys — ADDRESSES, not theorems; some theorems carry two\",\n      \"value\": \"26045\",\n      \"command\": \"node -e \\\"import('./src/api/index.ts').then(m=>console.log(m.census().liveKeys))\\\"\",\n      \"receipt\": \"529952a0-7ec6-8622-a7c0-c51000289e01\"\n    },\n    {\n      \"key\": \"ledger-entries\",\n      \"claim\": \"entries in the append-only ledger — RECEIPTS, most of them withdrawn\",\n      \"value\": \"28464\",\n      \"command\": \"node scripts/forensics.ts\",\n      \"receipt\": \"6de4687e-7977-8d27-a909-d5ffc16356e8\"\n    },\n    {\n      \"key\": \"census-closes\",\n      \"claim\": \"liveKeys = sealed + keyed-twice + unresolvable, asserted not reconciled by a reader\",\n      \"value\": \"26045 = 26045 + 0 + 0\",\n      \"command\": \"node scripts/contradictions.ts\",\n      \"receipt\": \"4b9c6cd5-3a7a-80d6-a5c1-eaa2d14aa417\"\n    },\n    {\n      \"key\": \"verify-advantage\",\n      \"claim\": \"verification path against recomputation at 2^20 leaves — classical and structural\",\n      \"value\": \"20 rounds vs 1048576 recomputations, ratio 567971x\",\n      \"command\": \"node scripts/pages.ts\",\n      \"receipt\": \"f8ccb580-65a4-8b54-8275-71acafea8354\"\n    },\n    {\n      \"key\": \"quantum-speedup\",\n      \"claim\": \"quantum speedup claimed — no hardware, no algorithm\",\n      \"value\": \"0\",\n      \"command\": \"node scripts/contradictions.ts\",\n      \"receipt\": \"f54462bd-1e2c-8b39-bff5-880b6d4ba687\"\n    },\n    {\n      \"key\": \"novelty-claimed\",\n      \"claim\": \"novelty claims, which require a NAMED prior-art search that none has\",\n      \"value\": \"0\",\n      \"command\": \"node scripts/priorart.ts\",\n      \"receipt\": \"9ad2ac0e-3734-890a-89f3-ff8546f8034c\"\n    },\n    {\n      \"key\": \"prior-art-attributed\",\n      \"claim\": \"declarations restating work with an earlier author, credited\",\n      \"value\": \"167\",\n      \"command\": \"node scripts/priorart.ts\",\n      \"receipt\": \"0d39eb3a-7002-86ba-bc9b-f6589de471a5\"\n    },\n    {\n      \"key\": \"typeset\",\n      \"claim\": \"statements rendering as mathematics, each round-trip clean against its source\",\n      \"value\": \"26045/26045\",\n      \"command\": \"node scripts/latex-gate.ts\",\n      \"receipt\": \"009e8885-8680-8d3e-baac-5d75138aabbb\"\n    },\n    {\n      \"key\": \"coin-unlock\",\n      \"claim\": \"a 128-bit seal affords 64 payments of two coins = one turn of the doubling orbit\",\n      \"value\": \"128/2 = 64, 2^6 mod 9 = 1\",\n      \"command\": \"node scripts/split-check.ts || node scripts/lean.ts\",\n      \"receipt\": \"61793808-475d-8705-920d-e3d7c2d3b694\"\n    },\n    {\n      \"key\": \"gate:contradictions\",\n      \"claim\": \"the contradictions gate, run now rather than remembered\",\n      \"value\": \"pass\",\n      \"command\": \"npm run contradictions\",\n      \"receipt\": \"67a9b48b-35db-844e-bf2a-3218e6bc1711\"\n    },\n    {\n      \"key\": \"gate:latex-gate\",\n      \"claim\": \"the latex-gate gate, run now rather than remembered\",\n      \"value\": \"pass\",\n      \"command\": \"npm run latex-gate\",\n      \"receipt\": \"f8669bcb-b409-8d6b-a159-4da081d33c33\"\n    },\n    {\n      \"key\": \"gate:prior-art\",\n      \"claim\": \"the prior-art gate, run now rather than remembered\",\n      \"value\": \"pass\",\n      \"command\": \"npm run prior-art\",\n      \"receipt\": \"c450d904-c448-87f0-bb62-29f2ffd08f5c\"\n    },\n    {\n      \"key\": \"gate:verify\",\n      \"claim\": \"the verify gate, run now rather than remembered\",\n      \"value\": \"pass\",\n      \"command\": \"npm run verify\",\n      \"receipt\": \"3f618f97-d8ec-8c70-9cb2-8320da71aee8\"\n    },\n    {\n      \"key\": \"gate:trial-all\",\n      \"claim\": \"the trial-all gate, run now rather than remembered\",\n      \"value\": \"pass\",\n      \"command\": \"npm run trial-all\",\n      \"receipt\": \"d0d82890-368d-8828-8141-a9a5d3250730\"\n    },\n    {\n      \"key\": \"gate:gates\",\n      \"claim\": \"the gates gate, run now rather than remembered\",\n      \"value\": \"FAIL\",\n      \"command\": \"npm run gates\",\n      \"receipt\": \"576a57a2-120b-835d-93d2-aab1b52c7d4b\"\n    }\n  ],\n  \"root\": \"eb32335f-69cd-8c37-92c9-45a03933a767\"\n}\n"}

package/dist/data/baked/package_gates.json

@@ -0,0 +1 @@
+{"tool":"package_gates","bytes":184,"answer":"{\"status\":\"HELD\",\"output\":\"✓ package-gates: 335 lockfile gate(s) hold (each pinned, each with an integrity hash); 0 apk gate(s) — no Dockerfile named, so no apk gates are derived\"}"}

package/dist/data/baked/prefix_check.json

@@ -0,0 +1 @@
+{"tool":"prefix_check","bytes":55,"answer":"usage: prefix-check.ts <repoDir> <prefix> [prefix ...]\n"}

package/dist/data/baked/prose_check.json

@@ -0,0 +1 @@
+{"tool":"prose_check","bytes":88,"answer":"✓ pre-commit: 0 staged prose file(s) compute 1 — every citation live in the ledger.\n"}

package/dist/data/baked/qpu_court_local.json

@@ -0,0 +1 @@
+{"tool":"qpu_court_local","bytes":56,"answer":"{\"status\":\"FAILED\",\"why\":\"Error: spawnSync node ENOENT\"}"}

package/dist/data/baked/qpu_families.json

@@ -0,0 +1 @@
+{"tool":"qpu_families","bytes":59,"answer":"{\"status\":\"FAILED\",\"why\":\"Error: spawnSync /bin/sh ENOENT\"}"}