eyeling 1.24.6 → 1.24.8

package/examples/output/delfour.md

@@ -0,0 +1,32 @@
+# delfour  
+
+## Answer  
+The scanner is allowed to use a neutral shopping insight and recommends Low-Sugar Tea Biscuits instead of Classic Tea Biscuits.  
+case                 : delfour  
+decision             : Allowed  
+scanned product      : Classic Tea Biscuits  
+suggested alternative: Low-Sugar Tea Biscuits  
+
+## Reason Why  
+The phone desensitizes a diabetes-related household condition into a scoped low-sugar need, wraps it in an expiring Insight + Policy envelope, signs it, and the scanner consumes that envelope for shopping assistance.  
+metric               : sugar_g_per_serving  
+threshold            : 10.0  
+scope                : self-scanner @ pick_up_scanner  
+retailer             : Delfour  
+signature alg        : HMAC-SHA256  
+banner headline      : Track sugar per serving while you scan  
+expires at           : 2025-10-05T22:33:48.907185+00:00  
+reason.txt           : Household requires low-sugar guidance (diabetes in POD). A neutral Insight is scoped to device 'self-scanner', event 'pick_up_scanner', retailer 'Delfour', and expires soon; the policy confines use to shopping assistance.  
+audit entries        : 1  
+bus files written    : 6  
+
+## Check  
+signature verifies              : yes  
+payload hash matches            : yes  
+minimization strips sensitive terms: yes  
+scope complete                  : yes  
+authorization allowed           : yes  
+high-sugar banner               : yes  
+alternative lowers sugar        : yes  
+duty timing consistent          : yes  
+marketing prohibited            : yes  

package/examples/output/digital-product-passport.md

@@ -0,0 +1,3 @@
+# digital-product-passport  
+
+ACME X1000 SN123 | recycled=13% | lifecycle=52500 gCO2e | CRM=true | hint=http://example.org/dpp#repairFriendly  

package/examples/output/dijkstra-risk-path.md

@@ -0,0 +1,11 @@
+# dijkstra-risk-path  
+
+## Answer  
+selected path : ClinicA -> DepotB -> LabD -> HubZ  
+raw cost : 10.00  
+risk sum : 0.55  
+risk-adjusted score : 11.10  
+edges in selected path : 3  
+
+## Explanation  
+Each edge contributes its delivery cost plus the configured risk penalty. The N3 source enumerates the small graph's simple route candidates and compares the selected route against each alternative score. The selected route balances cost and risk through DepotB and LabD, while the apparently cheaper DepotC path is rejected once risk is priced in.  

package/examples/output/{easter.txt → easter.md}

@@ -1,150 +1,152 @@
-Easter — Gregorian computus
-
-=== 2026 ===
-Answer
-Easter Sunday falls on April 5.
-
-Reason Why
-For year 2026, the computus gives j=12, k=20, q=6, r=12, v=2, and final month/day numbers x=4, z=4. Because the day is z+1, the resulting Easter date is April 5.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2027 ===
-Answer
-Easter Sunday falls on March 28.
-
-Reason Why
-For year 2027, the computus gives j=13, k=20, q=6, r=1, v=5, and final month/day numbers x=3, z=27. Because the day is z+1, the resulting Easter date is March 28.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2028 ===
-Answer
-Easter Sunday falls on April 16.
-
-Reason Why
-For year 2028, the computus gives j=14, k=20, q=6, r=20, v=5, and final month/day numbers x=4, z=15. Because the day is z+1, the resulting Easter date is April 16.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2029 ===
-Answer
-Easter Sunday falls on April 1.
-
-Reason Why
-For year 2029, the computus gives j=15, k=20, q=6, r=9, v=1, and final month/day numbers x=4, z=0. Because the day is z+1, the resulting Easter date is April 1.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2030 ===
-Answer
-Easter Sunday falls on April 21.
-
-Reason Why
-For year 2030, the computus gives j=16, k=20, q=6, r=28, v=2, and final month/day numbers x=4, z=20. Because the day is z+1, the resulting Easter date is April 21.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2031 ===
-Answer
-Easter Sunday falls on April 13.
-
-Reason Why
-For year 2031, the computus gives j=17, k=20, q=6, r=17, v=5, and final month/day numbers x=4, z=12. Because the day is z+1, the resulting Easter date is April 13.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2032 ===
-Answer
-Easter Sunday falls on March 28.
-
-Reason Why
-For year 2032, the computus gives j=18, k=20, q=6, r=6, v=0, and final month/day numbers x=3, z=27. Because the day is z+1, the resulting Easter date is March 28.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2033 ===
-Answer
-Easter Sunday falls on April 17.
-
-Reason Why
-For year 2033, the computus gives j=0, k=20, q=6, r=24, v=2, and final month/day numbers x=4, z=16. Because the day is z+1, the resulting Easter date is April 17.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2034 ===
-Answer
-Easter Sunday falls on April 9.
-
-Reason Why
-For year 2034, the computus gives j=1, k=20, q=6, r=13, v=5, and final month/day numbers x=4, z=8. Because the day is z+1, the resulting Easter date is April 9.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
-Easter — Gregorian computus
-
-=== 2035 ===
-Answer
-Easter Sunday falls on March 25.
-
-Reason Why
-For year 2035, the computus gives j=2, k=20, q=6, r=2, v=1, and final month/day numbers x=3, z=24. Because the day is z+1, the resulting Easter date is March 25.
-
-Check
-C1 OK - the Golden Number remainder j is inside the 0–18 cycle.
-C2 OK - the epact-style remainder r is inside the 0–29 cycle.
-C3 OK - the weekday adjustment v is inside the 0–6 cycle.
-C4 OK - the final month is a valid Easter month (March or April).
-C5 OK - the final date is inside the legal Gregorian Easter window.
+# easter  
+
+Easter — Gregorian computus  
+
+## 2026  
+Answer  
+Easter Sunday falls on April 5.  
+
+Reason Why  
+For year 2026, the computus gives j=12, k=20, q=6, r=12, v=2, and final month/day numbers x=4, z=4. Because the day is z+1, the resulting Easter date is April 5.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2027  
+Answer  
+Easter Sunday falls on March 28.  
+
+Reason Why  
+For year 2027, the computus gives j=13, k=20, q=6, r=1, v=5, and final month/day numbers x=3, z=27. Because the day is z+1, the resulting Easter date is March 28.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2028  
+Answer  
+Easter Sunday falls on April 16.  
+
+Reason Why  
+For year 2028, the computus gives j=14, k=20, q=6, r=20, v=5, and final month/day numbers x=4, z=15. Because the day is z+1, the resulting Easter date is April 16.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2029  
+Answer  
+Easter Sunday falls on April 1.  
+
+Reason Why  
+For year 2029, the computus gives j=15, k=20, q=6, r=9, v=1, and final month/day numbers x=4, z=0. Because the day is z+1, the resulting Easter date is April 1.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2030  
+Answer  
+Easter Sunday falls on April 21.  
+
+Reason Why  
+For year 2030, the computus gives j=16, k=20, q=6, r=28, v=2, and final month/day numbers x=4, z=20. Because the day is z+1, the resulting Easter date is April 21.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2031  
+Answer  
+Easter Sunday falls on April 13.  
+
+Reason Why  
+For year 2031, the computus gives j=17, k=20, q=6, r=17, v=5, and final month/day numbers x=4, z=12. Because the day is z+1, the resulting Easter date is April 13.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2032  
+Answer  
+Easter Sunday falls on March 28.  
+
+Reason Why  
+For year 2032, the computus gives j=18, k=20, q=6, r=6, v=0, and final month/day numbers x=3, z=27. Because the day is z+1, the resulting Easter date is March 28.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2033  
+Answer  
+Easter Sunday falls on April 17.  
+
+Reason Why  
+For year 2033, the computus gives j=0, k=20, q=6, r=24, v=2, and final month/day numbers x=4, z=16. Because the day is z+1, the resulting Easter date is April 17.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2034  
+Answer  
+Easter Sunday falls on April 9.  
+
+Reason Why  
+For year 2034, the computus gives j=1, k=20, q=6, r=13, v=5, and final month/day numbers x=4, z=8. Because the day is z+1, the resulting Easter date is April 9.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  
+Easter — Gregorian computus  
+
+## 2035  
+Answer  
+Easter Sunday falls on March 25.  
+
+Reason Why  
+For year 2035, the computus gives j=2, k=20, q=6, r=2, v=1, and final month/day numbers x=3, z=24. Because the day is z+1, the resulting Easter date is March 25.  
+
+Check  
+C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
+C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
+C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
+C4 OK - the final month is a valid Easter month (March or April).  
+C5 OK - the final date is inside the legal Gregorian Easter window.  

package/examples/output/eco-route-insight.md

@@ -0,0 +1,20 @@
+# eco-route-insight  
+
+## Answer  
+insight status : issue  
+show eco banner : yes  
+audience : Depot X  
+allowed use : ui.eco.banner  
+suggested route : alt-low-fuel  
+current fuel index : 120.75  
+suggested fuel index : 99.75  
+estimated saving : 21.00  
+expires at : 2025-01-01T11:00:00Z  
+raw data exported : no  
+signature algorithm : HMAC-SHA256  
+payload digest : 00e19becd91e81d6881749655d23d43002d9ea714bba61e855eafbc8ef9a5135  
+signature key : local-demo-key  
+signature : 7fFGBN8fyI7xrmRz5VreeAUSf3LC_ywbj32NGk2ovUs  
+
+## Explanation  
+The current route uses fuel index = distanceKm × (payloadKg / 1000) × gradientFactor. For shipment-1, Current urban route gives 42.00 × 2.50 × 1.15 = 120.75. The policy threshold is 120.00, so a local eco banner is justified. The selected alternative alt-low-fuel gives 38.00 × 2.50 × 1.05 = 99.75, saving 21.00 while staying within the ETA delay limit. The signed envelope exposes audience, use, expiry, route suggestion, and compact fuel indices, but not raw payload, GPS trace, driver behavior, or raw telemetry.  

package/examples/output/flandor.md

@@ -0,0 +1,33 @@
+# flandor  
+
+## Answer  
+Name: Flandor  
+Region: Flanders  
+Metric: regional_retooling_priority  
+Active need count: 3/3  
+Recommended package: Flandor Retooling Pulse  
+Budget cap: €140M  
+Package cost: €120M  
+Payload SHA-256: 718f5b17d07ab6a95503bc04a1000ddb132409f600659c03d21def81914b780b  
+Envelope HMAC-SHA-256: 955968ca99a191783bc00cba068128ccb9ff40a5e6114fda13a52c74ee27329e  
+
+## Reason Why  
+Export weakness is active because at least one cluster has exportOrdersIndex < 90 (Antwerp chemicals=84, Ghent manufacturing=87).  
+Skills strain is active because technical vacancy rate is 4.6% (threshold > 3.9%).  
+Grid stress is active because congestion hours = 19 (threshold > 11).  
+The recommendation policy is "lowest_cost_package_covering_all_active_needs", so the cheapest package that covers all active needs within budget is selected.  
+Selected package "Flandor Retooling Pulse" covers export=true, skills=true, grid=true, cost=€120M.  
+Usage is permitted only for purpose "regional_stabilization" and the envelope expires at 2026-04-08T19:00:00+00:00.  
+
+## Check  
+- PASS: payload hash matches  
+- PASS: hmac matches  
+- PASS: threshold reached  
+- PASS: scope complete  
+- PASS: minimization respected  
+- PASS: authorized purpose allowed  
+- PASS: deletion duty still on time  
+- PASS: surveillance reuse prohibited  
+- PASS: package exists within budget  
+- PASS: package covers all active needs  
+- PASS: lowest-cost eligible package chosen  

package/examples/output/{french-cities.txt → french-cities.md}

@@ -1,14 +1,16 @@
-French cities — ARC style graph reachability
+# french-cities  
 
-Answer
-Four cities in this small network can reach Nantes: Paris, Chartres, Le Mans, and Angers.
+French cities — ARC style graph reachability  
 
-Reason Why
-The original example says that every :oneway link is also a :path, and that :path is transitive. So once Angers can reach Nantes directly, longer routes can be built by chaining earlier links. Angers reaches Nantes directly. Le Mans reaches Nantes through Angers. Chartres reaches Nantes through Le Mans and Angers. Paris reaches Nantes through Chartres, Le Mans, and Angers.
+Answer  
+Four cities in this small network can reach Nantes: Paris, Chartres, Le Mans, and Angers.  
 
-Check
-C1 OK - Angers has a direct one-way connection to Nantes.
-C2 OK - Le Mans reaches Nantes by chaining Le Mans → Angers → Nantes.
-C3 OK - Chartres reaches Nantes by chaining Chartres → Le Mans → Angers → Nantes.
-C4 OK - Paris reaches Nantes by chaining Paris → Chartres → Le Mans → Angers → Nantes.
-C5 OK - cities without a chain to Nantes are rejected by fail-loud fuse rules.
+Reason Why  
+The original example says that every :oneway link is also a :path, and that :path is transitive. So once Angers can reach Nantes directly, longer routes can be built by chaining earlier links. Angers reaches Nantes directly. Le Mans reaches Nantes through Angers. Chartres reaches Nantes through Le Mans and Angers. Paris reaches Nantes through Chartres, Le Mans, and Angers.  
+
+Check  
+C1 OK - Angers has a direct one-way connection to Nantes.  
+C2 OK - Le Mans reaches Nantes by chaining Le Mans → Angers → Nantes.  
+C3 OK - Chartres reaches Nantes by chaining Chartres → Le Mans → Angers → Nantes.  
+C4 OK - Paris reaches Nantes by chaining Paris → Chartres → Le Mans → Angers → Nantes.  
+C5 OK - cities without a chain to Nantes are rejected by fail-loud fuse rules.  

package/examples/output/{fundamental-theorem-arithmetic.txt → fundamental-theorem-arithmetic.md}

@@ -1,15 +1,17 @@
-Fundamental Theorem of Arithmetic — ARC-style
+# fundamental-theorem-arithmetic  
 
-Answer
-For n = 202692987, the prime factors are 3 * 3 * 7 * 829 * 3881, the prime-power form is 3^2 * 7 * 829 * 3881, and the product of these factors is 202692987 with 4 distinct primes.
+Fundamental Theorem of Arithmetic — ARC-style  
 
-Reason Why
-Existence in this run comes from repeated smallest-divisor decomposition: 202692987 factors as 3 * 3 * 7 * 829 * 3881. Each distinct factor is prime. For uniqueness up to order, the reverse traversal gives 3881 * 829 * 7 * 3 * 3, and both traversals sort to the same multiset of primes. So this concrete case exhibits the Fundamental Theorem of Arithmetic for 202692987: a prime factorization exists and is unique up to order. The extreme prime factors are 3 and 3881.
+Answer  
+For n = 202692987, the prime factors are 3 * 3 * 7 * 829 * 3881, the prime-power form is 3^2 * 7 * 829 * 3881, and the product of these factors is 202692987 with 4 distinct primes.  
 
-Check
-C1 OK - repeated smallest-divisor decomposition produced the expected smallest-first factor list (3 3 7 829 3881).
-C2 OK - the product of the computed factors reconstructs n = 202692987.
-C3 OK - every distinct factor in the decomposition is prime by trial division.
-C4 OK - the prime-power form matches 3^2 * 7 * 829 * 3881.
-C5 OK - smallest-first and largest-first traversals have the same multiset of primes, so the factorization agrees up to order.
-C6 OK - the smallest and largest prime factors are 3 and 3881.
+Reason Why  
+Existence in this run comes from repeated smallest-divisor decomposition: 202692987 factors as 3 * 3 * 7 * 829 * 3881. Each distinct factor is prime. For uniqueness up to order, the reverse traversal gives 3881 * 829 * 7 * 3 * 3, and both traversals sort to the same multiset of primes. So this concrete case exhibits the Fundamental Theorem of Arithmetic for 202692987: a prime factorization exists and is unique up to order. The extreme prime factors are 3 and 3881.  
+
+Check  
+C1 OK - repeated smallest-divisor decomposition produced the expected smallest-first factor list (3 3 7 829 3881).  
+C2 OK - the product of the computed factors reconstructs n = 202692987.  
+C3 OK - every distinct factor in the decomposition is prime by trial division.  
+C4 OK - the prime-power form matches 3^2 * 7 * 829 * 3881.  
+C5 OK - smallest-first and largest-first traversals have the same multiset of primes, so the factorization agrees up to order.  
+C6 OK - the smallest and largest prime factors are 3 and 3881.  

package/examples/output/genetic-algorithm-knapsack.md

@@ -0,0 +1,3 @@
+# genetic-algorithm-knapsack  
+
+Knapsack GA best genome 101000000101 (feasible=true): weight=50 value=101 after 4 generations.  

package/examples/output/genetic-algorithm.md

@@ -0,0 +1,3 @@
+# genetic-algorithm  
+
+GA evolved 11111101010 -> 2026 in 8 generations.  

package/examples/output/genetic-knapsack-selection.md

@@ -0,0 +1,13 @@
+# genetic-knapsack-selection  
+
+## Answer  
+final genome : 101000000101  
+selected items : item01, item03, item10, item12  
+weight : 50 / 50  
+value : 101  
+fitness : 999899  
+generations evaluated : 5  
+exhaustive optimum value : 104 at genome 001000011111  
+
+## Explanation  
+Each genome bit says whether the corresponding item is selected for the knapsack. Feasible candidates get fitness 1000000 minus value, so higher value means lower fitness; overweight candidates are penalized above every feasible candidate. The N3 source records the deterministic local-search result and validates that the final genome respects capacity and has no strictly better one-bit neighbor. For transparency, an exhaustive enumeration also records the global best feasible value, showing this is a local mutation search rather than a global-optimality claim.  

package/examples/output/{gps.txt → gps.md}

@@ -1,15 +1,17 @@
-GPS — Goal driven route planning
+# gps  
 
-Answer
-Take the direct route via Brugge.
-Recommended route: Gent → Brugge → Oostende
+GPS — Goal driven route planning  
 
-Reason Why
-From Gent to Oostende, the planner found two routes in this small map. The direct route (Gent → Brugge → Oostende) takes 2400 seconds at cost 0.01, with belief 0.9408 and comfort 0.99. The alternative (Gent → Kortrijk → Brugge → Oostende) takes 4100 seconds at cost 0.018, with belief 0.903168 and comfort 0.9801. So the direct route is faster, cheaper, more reliable, and slightly more comfortable.
+Answer  
+Take the direct route via Brugge.  
+Recommended route: Gent → Brugge → Oostende  
 
-Check
-C1 OK - the direct Gent → Brugge → Oostende route was derived.
-C2 OK - the alternative Gent → Kortrijk → Brugge → Oostende route was derived.
-C3 OK - the recommended route is faster than the alternative.
-C4 OK - the recommended route is cheaper than the alternative.
-C5 OK - the recommended route has higher belief and comfort scores.
+Reason Why  
+From Gent to Oostende, the planner found two routes in this small map. The direct route (Gent → Brugge → Oostende) takes 2400 seconds at cost 0.01, with belief 0.9408 and comfort 0.99. The alternative (Gent → Kortrijk → Brugge → Oostende) takes 4100 seconds at cost 0.018, with belief 0.903168 and comfort 0.9801. So the direct route is faster, cheaper, more reliable, and slightly more comfortable.  
+
+Check  
+C1 OK - the direct Gent → Brugge → Oostende route was derived.  
+C2 OK - the alternative Gent → Kortrijk → Brugge → Oostende route was derived.  
+C3 OK - the recommended route is faster than the alternative.  
+C4 OK - the recommended route is cheaper than the alternative.  
+C5 OK - the recommended route has higher belief and comfort scores.  

package/examples/output/harborsmr.md

@@ -0,0 +1,22 @@
+# harborsmr  
+
+HarborSMR — bounded flexible-export insight for port electrolysis  
+
+Answer  
+PERMIT  
+The port hydrogen hub may use the SMR insight to run PEM electrolyzer train 2 at 16 MW from 14:00 to 18:00.  
+
+Reason Why  
+The operator shares only a narrow, expiring insight that a temporary 18 MW flexible-export window is available. The request is for electrolysis dispatch only, the requested 16 MW fits inside the permitted window, safety margins are above threshold, no outage blocks the window, and the policy forbids redistribution for market resale. Raw reactor telemetry stays local.  
+
+Check  
+C1  OK - reserve margin exceeds the dispatch threshold  
+C2  OK - cooling margin exceeds the dispatch threshold  
+C3  OK - no planned outage blocks the window  
+C4  OK - requested MW fits within the export window  
+C5  OK - serialized insight omits sensitive telemetry terms  
+C6  OK - aggregate excludes core temperature, rod position, neutron flux, and operator IDs  
+C7  OK - policy allows use for electrolysis dispatch before expiry  
+C8  OK - policy prohibits redistribution for market resale  
+C9  OK - scope is explicit: device, event, start, and expiry  
+C10 OK - dispatch plan matches the requested load and power  

package/examples/output/{interop-demo.txt → interop-demo.md}

@@ -1 +1,3 @@
-ACTION: apply GoldDiscount and send invoice reminder (opt-in confirmed).
+# interop-demo  
+
+ACTION: apply GoldDiscount and send invoice reminder (opt-in confirmed).  

package/examples/output/matrix-mechanics.md

@@ -0,0 +1,16 @@
+# matrix-mechanics  
+
+## Answer  
+In this toy matrix-mechanics model, the Hamiltonian has two discrete energy levels and does not commute with a second observable.  
+
+## Reason Why  
+H = [[1,0],[0,2]]  
+X = [[0,1],[1,0]]  
+HX = [[0,1],[2,0]]  
+XH = [[0,2],[1,0]]  
+[H,X] = [[0,-1],[1,0]]  
+
+## Check  
+trace/determinant match energy levels: yes  
+X^2 = I : yes  
+[H,X] != 0 : yes  

package/examples/output/medior.md

@@ -0,0 +1,34 @@
+# medior  
+
+## Answer  
+Name: Medior  
+Region: Flanders  
+Metric: post_discharge_coordination_priority  
+Active need count: 4/3  
+Recommended package: Medior Continuity Pulse  
+Budget cap: €5  
+Package cost: €4  
+Payload SHA-256: b5fec8971d6c5e313a1387f08151f1c3203effce05d6455469c9f63305be05ae  
+Envelope HMAC-SHA-256: 072f4c2774ce362e660649d145c9d784e5e95d63d24d4057b119a419c6ba34dc  
+
+## Reason Why  
+RenalSafetyConcern holds because eGFR = 52 and the threshold is < 60.  
+PolypharmacyRisk holds because the active medication count is 9 and the threshold is ≥ 8.  
+ReadmissionHistory holds because admissionsLast180Days = 2 and the threshold is ≥ 1.  
+RecentDischargeWindow holds because hoursSinceDischarge = 18 and the threshold is ≤ 48.  
+The recommendation rule selects the least-cost package that covers every active need and remains within budget.  
+The selected package is "Medior Continuity Pulse" with cost €4, touches=3.  
+Use is permitted only for purpose "care_coordination" and expires at 2026-04-11T08:00:00+00:00.  
+
+## Check  
+- PASS: payloadHashMatches  
+- PASS: signatureVerifies  
+- PASS: thresholdReached  
+- PASS: scopeComplete  
+- PASS: minimizationRespected  
+- PASS: authorizationAllowed  
+- PASS: dutyTimely  
+- PASS: insurancePricingProhibited  
+- PASS: packageWithinBudget  
+- PASS: packageCoversAllActiveNeeds  
+- PASS: lowestCostEligiblePackageChosen