eyeling 1.24.7 → 1.24.9

package/examples/output/barley-seed-becoming.md

@@ -0,0 +1,31 @@
+# barley-seed-becoming  
+
+## Source files  
+
+- [N3 rules](../barley-seed-becoming.n3)  
+
+Barley seed lineage — becoming  
+
+## Answer  
+YES for the viable barley lineage.  
+NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.  
+
+## Reason Why  
+The main lineage can be read as a becoming: a protected dormant seed can germinate, an adult plant can become a next seed stage, and the lineage can therefore become a self-renewing cycle. Because its hereditary information is digitally instantiated and repair is available, it can also become an accurately reproduced next generation under no-design laws. And because heritable variation is present under a matching selection environment, it can become an adaptively persistent lineage. The contrast lineages mark blocked becomings: non-digital heredity blocks accurate copying, lack of repair blocks reliable renewal, lack of dormancy protection blocks closure through the seed phase, and lack of heritable variation blocks adaptive becoming.  
+
+## Check  
+B1  OK - no-design laws are assumed  
+B2  OK - the viable genome can become accurately copied  
+B3  OK - the viable seed can become a protected dormant phase  
+B4  OK - the viable seed can become a germinating stage  
+B5  OK - the viable adult can become a next dormant seed stage  
+B6  OK - the viable lineage can become an accurately reproduced next generation  
+B7  OK - the viable lineage can become a closed life cycle  
+B8  OK - the viable lineage can become a novel variant lineage  
+B9  OK - the viable lineage can become adaptively persistent  
+B10 OK - the viable lineage is an evolvable becoming  
+B11 OK - the non-digital lineage cannot become an accurately reproduced next generation  
+B12 OK - the repair-deficient lineage cannot become an accurately reproduced next generation  
+B13 OK - the coatless lineage cannot become a closed life cycle  
+B14 OK - the static lineage cannot become an adaptive lineage  
+B15 OK - the static lineage cannot become an evolvable becoming  

package/examples/output/bmi.md

@@ -0,0 +1,26 @@
+# bmi  
+
+## Source files  
+
+- [N3 rules](../bmi.n3)  
+
+BMI — ARC-style Body Mass Index example  
+
+## Answer  
+BMI = 22.72  
+Category = Normal  
+At height 178 cm, a healthy-weight range is about 58.6–78.9 kg (BMI 18.5–24.9).  
+
+## Reason Why  
+BMI is defined as weight in kilograms divided by height in meters squared. This program first normalizes the input to SI units, computes BMI, and then applies WHO adult categories as half-open intervals. The healthy-weight band is the weight range at the same height that corresponds to BMI 18.5 through 24.9.  
+
+## Check  
+C1 OK - the input was normalized into positive SI values.  
+C2 OK - height squared was reconstructed from the normalized height.  
+C3 OK - the BMI value matches the BMI = kg / m² formula.  
+C4 OK - a BMI of 18.49 stays below the normal-weight threshold.  
+C5 OK - the lower boundary is half-open: BMI 18.5 is classified as Normal.  
+C6 OK - BMI 25.0 starts the Overweight category.  
+C7 OK - BMI 30.0 starts the Obesity I category.  
+C8 OK - classification behavior is monotonic across representative BMI values.  
+C9 OK - the healthy-weight band was reconstructed from BMI 18.5 to 24.9 at the same height.  

package/examples/output/builtin-coverage.md

@@ -0,0 +1,7 @@
+# builtin-coverage  
+
+## Source files  
+
+- [N3 rules](../builtin-coverage.n3)  
+- [Input TriG](../input/builtin-coverage.trig)  
+

package/examples/output/calidor.md

@@ -0,0 +1,35 @@
+# calidor  
+
+## Source files  
+
+- [N3 rules](../calidor.n3)  
+
+## Answer  
+The city is allowed to use a narrow heatwave-response insight and recommends Calidor Priority Cooling Bundle for this household.  
+case                 : calidor  
+decision             : Allowed  
+municipality         : Calidor  
+recommended package  : Calidor Priority Cooling Bundle  
+
+## Reason Why  
+The gateway desensitizes local heat, vulnerability, and prepaid-energy stress into an expiring municipal support insight, and the city consumes that envelope only for heatwave response.  
+metric               : active_need_count  
+threshold            : 3.0  
+scope                : household-gateway @ heat-alert-window  
+required capabilities: bill_credit, cooling_kit, transport, welfare_check  
+signature alg        : HMAC-SHA256  
+expires at           : 2026-07-18T21:00:00+00:00  
+reason.txt           : The gateway keeps raw indoor heat, vulnerability, and prepaid-energy data local, derives a priority-support signal, and shares only a scoped heatwave-response envelope with expiry.  
+dispatches logged    : 1  
+
+## Check  
+signature verifies              : yes  
+payload hash matches            : yes  
+minimization strips sensitive terms: yes  
+scope complete                  : yes  
+authorization allowed           : yes  
+heat-alert active               : yes  
+unsafe indoor heat              : yes  
+recommended package eligible    : yes  
+duty timing consistent          : yes  
+tenant screening prohibited     : yes  

package/examples/output/collection.md

@@ -0,0 +1,7 @@
+# collection  
+
+## Source files  
+
+- [N3 rules](../collection.n3)  
+- [Input TriG](../input/collection.trig)  
+

package/examples/output/{complex-matrix-stability.txt → complex-matrix-stability.md}

@@ -1,14 +1,20 @@
-Complex Matrix Stability — ARC-style
+# complex-matrix-stability  
 
-Answer
-We compare three diagonal 2x2 complex matrices for discrete-time stability: A_unstable = [[(1,1),(0,0)],[(0,0),(2,0)]], A_stable = [[(1,0),(0,0)],[(0,0),(-1,0)]], and A_damped = [[(0,0),(0,0)],[(0,0),(0,0)]]. Their spectral radii are ρ(A_unstable) = 2, ρ(A_stable) = 1, and ρ(A_damped) = 0. So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.
+## Source files  
 
-Reason Why
-For a discrete-time linear system x_{k+1} = A x_k, the eigenvalues of A govern the behaviour of the modes. Because these matrices are diagonal, the eigenvalues are just the diagonal entries. The spectral radius is the maximum modulus of the eigenvalues: if it is greater than 1 a mode grows, if it equals 1 the modes remain bounded without decaying, and if it is less than 1 all modes decay to zero. Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.
+- [N3 rules](../complex-matrix-stability.n3)  
 
-Check
-C1 OK - A_unstable has eigenvalues (1,1) and (2,0) with spectral radius 2, so it is unstable.
-C2 OK - A_stable has eigenvalues (1,0) and (-1,0) with spectral radius 1, so it is marginally stable.
-C3 OK - A_damped has eigenvalues (0,0) and (0,0) with spectral radius 0, so every mode decays to zero.
-C4 OK - for z = (1,2) and w = (0,1), the squared modulus of z*w equals the product of the squared moduli.
-C5 OK - the spectral-radius-squared of 2*A_unstable is four times that of A_unstable.
+Complex Matrix Stability — ARC-style  
+
+## Answer  
+We compare three diagonal 2x2 complex matrices for discrete-time stability: A_unstable = [[(1,1),(0,0)],[(0,0),(2,0)]], A_stable = [[(1,0),(0,0)],[(0,0),(-1,0)]], and A_damped = [[(0,0),(0,0)],[(0,0),(0,0)]]. Their spectral radii are ρ(A_unstable) = 2, ρ(A_stable) = 1, and ρ(A_damped) = 0. So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.  
+
+## Reason Why  
+For a discrete-time linear system x_{k+1} = A x_k, the eigenvalues of A govern the behaviour of the modes. Because these matrices are diagonal, the eigenvalues are just the diagonal entries. The spectral radius is the maximum modulus of the eigenvalues: if it is greater than 1 a mode grows, if it equals 1 the modes remain bounded without decaying, and if it is less than 1 all modes decay to zero. Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.  
+
+## Check  
+C1 OK - A_unstable has eigenvalues (1,1) and (2,0) with spectral radius 2, so it is unstable.  
+C2 OK - A_stable has eigenvalues (1,0) and (-1,0) with spectral radius 1, so it is marginally stable.  
+C3 OK - A_damped has eigenvalues (0,0) and (0,0) with spectral radius 0, so every mode decays to zero.  
+C4 OK - for z = (1,2) and w = (0,1), the squared modulus of z*w equals the product of the squared moduli.  
+C5 OK - the spectral-radius-squared of 2*A_unstable is four times that of A_unstable.  

package/examples/output/context-association.md

@@ -0,0 +1,12 @@
+# Context association  
+
+## Source files  
+
+- [N3 rules](../context-association.n3)  
+- [Input TriG](../input/context-association.trig)  
+
+## Entailment  
+The RDF dataset associates Bob's data graph with a Data Integrity proof graph and a second metadata proof graph.  
+
+## Explanation  
+The input TriG names three graph contexts. The data graph states Bob's name. The signature graph links to that data graph with a proof and records an ecdsa-rdfc-2019 Data Integrity proof from the university issuer. The metadata graph then signs the signature graph itself, giving a chained context association.  

package/examples/output/{control-system.txt → control-system.md}

@@ -1,20 +1,26 @@
-Control System — ARC explanation of two control signals
+# control-system  
 
-Answer
-Send both actuator commands now.
-Actuator 1 command: 39.27346198678276
-Actuator 2 command: 26.08
+## Source files  
 
-Reason Why
-The first sensor pair is 6 and 11, so the reading is rising and the controller normalizes the gap 5 into 2.23606797749979. That normalized value creates a feedforward term of 43.82693235899588, while the known disturbance 35766 contributes a compensation term of 4.553470372213121. Subtracting that compensation gives actuator 1 the command 39.27346198678276. For actuator 2, the target is 5 units above the measured output, so the tracking error is positive. The observed state is -2 relative units below the measured output, so the differential correction is negative. That yields a proportional feedback part of 29, a nonlinear factor of 1.46, and a differential contribution of -2.92. Together they produce actuator 2 command 26.08.
+- [N3 rules](../control-system.n3)  
 
-Check
-C1 OK - the first sensor pair is rising, so the normalization uses the rising-branch rule.
-C2 OK - the normalized measurement is positive and smaller than the raw gap, which is consistent with a square-root normalization.
-C3 OK - actuator 1 is lower than its proportional feedforward term because disturbance compensation is subtracted.
-C4 OK - the target is above the measured output, so the tracking error is positive.
-C5 OK - the observed state is below the measured output, so the differential error is negative.
-C6 OK - actuator 2 is lower than its pure proportional term because the differential part reduces it.
-C7 OK - actuator 1 matches an independently reconstructed feedforward calculation.
-C8 OK - actuator 2 matches an independently reconstructed feedback calculation.
-C9 OK - both actuator commands stay positive.
+Control System — ARC explanation of two control signals  
+
+## Answer  
+Send both actuator commands now.  
+Actuator 1 command: 39.27346198678276  
+Actuator 2 command: 26.08  
+
+## Reason Why  
+The first sensor pair is 6 and 11, so the reading is rising and the controller normalizes the gap 5 into 2.23606797749979. That normalized value creates a feedforward term of 43.82693235899588, while the known disturbance 35766 contributes a compensation term of 4.553470372213121. Subtracting that compensation gives actuator 1 the command 39.27346198678276. For actuator 2, the target is 5 units above the measured output, so the tracking error is positive. The observed state is -2 relative units below the measured output, so the differential correction is negative. That yields a proportional feedback part of 29, a nonlinear factor of 1.46, and a differential contribution of -2.92. Together they produce actuator 2 command 26.08.  
+
+## Check  
+C1 OK - the first sensor pair is rising, so the normalization uses the rising-branch rule.  
+C2 OK - the normalized measurement is positive and smaller than the raw gap, which is consistent with a square-root normalization.  
+C3 OK - actuator 1 is lower than its proportional feedforward term because disturbance compensation is subtracted.  
+C4 OK - the target is above the measured output, so the tracking error is positive.  
+C5 OK - the observed state is below the measured output, so the differential error is negative.  
+C6 OK - actuator 2 is lower than its pure proportional term because the differential part reduces it.  
+C7 OK - actuator 1 matches an independently reconstructed feedforward calculation.  
+C8 OK - actuator 2 matches an independently reconstructed feedback calculation.  
+C9 OK - both actuator commands stay positive.  

package/examples/output/deep-taxonomy-10.md

@@ -0,0 +1,21 @@
+# deep-taxonomy-10  
+
+## Source files  
+
+- [N3 rules](../deep-taxonomy-10.n3)  
+
+Deep Taxonomy - deep classification benchmark  
+
+## Answer  
+The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10 and then as A2.  
+
+## Reason Why  
+Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N10, the final rule deriving A2 fires, and that in turn makes the test true.  
+
+## Check  
+C1 OK - the starting classification N0 is present.  
+C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
+C3 OK - the chain reaches the midpoint N5 and still carries both side-label branches.  
+C4 OK - the final taxonomy step from N9 to N10 was completed.  
+C5 OK - once N10 is reached, the terminal class A2 is derived.  
+C6 OK - the success flag is raised only after the terminal class A2 is present.  

package/examples/output/deep-taxonomy-100.md

@@ -0,0 +1,21 @@
+# deep-taxonomy-100  
+
+## Source files  
+
+- [N3 rules](../deep-taxonomy-100.n3)  
+
+Deep Taxonomy - deep classification benchmark  
+
+## Answer  
+The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100 and then as A2.  
+
+## Reason Why  
+Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N100, the final rule deriving A2 fires, and that in turn makes the test true.  
+
+## Check  
+C1 OK - the starting classification N0 is present.  
+C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
+C3 OK - the chain reaches the midpoint N50 and still carries both side-label branches.  
+C4 OK - the final taxonomy step from N99 to N100 was completed.  
+C5 OK - once N100 is reached, the terminal class A2 is derived.  
+C6 OK - the success flag is raised only after the terminal class A2 is present.  

package/examples/output/{deep-taxonomy-1000.txt → deep-taxonomy-1000.md}

@@ -1,15 +1,21 @@
-Deep Taxonomy - deep classification benchmark
+# deep-taxonomy-1000  
 
-Answer
-The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N1000 and then as A2.
+## Source files  
 
-Reason Why
-Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N1000, the final rule deriving A2 fires, and that in turn makes the test true.
+- [N3 rules](../deep-taxonomy-1000.n3)  
 
-Check
-C1 OK - the starting classification N0 is present.
-C2 OK - the first expansion produced N1 together with side labels I1 and J1.
-C3 OK - the chain reaches the midpoint N500 and still carries both side-label branches.
-C4 OK - the final taxonomy step from N999 to N1000 was completed.
-C5 OK - once N1000 is reached, the terminal class A2 is derived.
-C6 OK - the success flag is raised only after the terminal class A2 is present.
+Deep Taxonomy - deep classification benchmark  
+
+## Answer  
+The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N1000 and then as A2.  
+
+## Reason Why  
+Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N1000, the final rule deriving A2 fires, and that in turn makes the test true.  
+
+## Check  
+C1 OK - the starting classification N0 is present.  
+C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
+C3 OK - the chain reaches the midpoint N500 and still carries both side-label branches.  
+C4 OK - the final taxonomy step from N999 to N1000 was completed.  
+C5 OK - once N1000 is reached, the terminal class A2 is derived.  
+C6 OK - the success flag is raised only after the terminal class A2 is present.  

package/examples/output/{deep-taxonomy-10000.txt → deep-taxonomy-10000.md}

@@ -1,15 +1,21 @@
-Deep Taxonomy - deep classification benchmark
+# deep-taxonomy-10000  
 
-Answer
-The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10000 and then as A2.
+## Source files  
 
-Reason Why
-Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N10000, the final rule deriving A2 fires, and that in turn makes the test true.
+- [N3 rules](../deep-taxonomy-10000.n3)  
 
-Check
-C1 OK - the starting classification N0 is present.
-C2 OK - the first expansion produced N1 together with side labels I1 and J1.
-C3 OK - the chain reaches the midpoint N5000 and still carries both side-label branches.
-C4 OK - the final taxonomy step from N9999 to N10000 was completed.
-C5 OK - once N10000 is reached, the terminal class A2 is derived.
-C6 OK - the success flag is raised only after the terminal class A2 is present.
+Deep Taxonomy - deep classification benchmark  
+
+## Answer  
+The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10000 and then as A2.  
+
+## Reason Why  
+Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N10000, the final rule deriving A2 fires, and that in turn makes the test true.  
+
+## Check  
+C1 OK - the starting classification N0 is present.  
+C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
+C3 OK - the chain reaches the midpoint N5000 and still carries both side-label branches.  
+C4 OK - the final taxonomy step from N9999 to N10000 was completed.  
+C5 OK - once N10000 is reached, the terminal class A2 is derived.  
+C6 OK - the success flag is raised only after the terminal class A2 is present.  

package/examples/output/{deep-taxonomy-100000.txt → deep-taxonomy-100000.md}

@@ -1,15 +1,21 @@
-Deep Taxonomy - very deep classification benchmark
+# deep-taxonomy-100000  
 
-Answer
-The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100000 and then as A2.
+## Source files  
 
-Reason Why
-Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N100000, the final rule deriving A2 fires, and that in turn makes the test true.
+- [N3 rules](../deep-taxonomy-100000.n3)  
 
-Check
-C1 OK - the starting classification N0 is present.
-C2 OK - the first expansion produced N1 together with side labels I1 and J1.
-C3 OK - the chain reaches the midpoint N50000 and still carries both side-label branches.
-C4 OK - the final taxonomy step from N99999 to N100000 was completed.
-C5 OK - once N100000 is reached, the terminal class A2 is derived.
-C6 OK - the success flag is raised only after the terminal class A2 is present.
+Deep Taxonomy - very deep classification benchmark  
+
+## Answer  
+The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100000 and then as A2.  
+
+## Reason Why  
+Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N100000, the final rule deriving A2 fires, and that in turn makes the test true.  
+
+## Check  
+C1 OK - the starting classification N0 is present.  
+C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
+C3 OK - the chain reaches the midpoint N50000 and still carries both side-label branches.  
+C4 OK - the final taxonomy step from N99999 to N100000 was completed.  
+C5 OK - once N100000 is reached, the terminal class A2 is derived.  
+C6 OK - the success flag is raised only after the terminal class A2 is present.  

package/examples/output/delfour.md

@@ -0,0 +1,36 @@
+# delfour  
+
+## Source files  
+
+- [N3 rules](../delfour.n3)  
+
+## 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,7 @@
+# digital-product-passport  
+
+## Source files  
+
+- [N3 rules](../digital-product-passport.n3)  
+
+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,16 @@
+# dijkstra-risk-path  
+
+## Source files  
+
+- [N3 rules](../dijkstra-risk-path.n3)  
+- [Input TriG](../input/dijkstra-risk-path.trig)  
+
+## 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.