eyeling 1.24.7 → 1.24.9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (184) hide show
  1. package/HANDBOOK.md +35 -35
  2. package/dist/browser/eyeling.browser.js +14 -1
  3. package/examples/act-alarm-bit-interoperability.n3 +5 -3
  4. package/examples/act-barley-seed-lineage.n3 +5 -3
  5. package/examples/act-docking-abort.n3 +5 -3
  6. package/examples/act-gravity-mediator-witness.n3 +5 -3
  7. package/examples/act-isolation-breach.n3 +5 -3
  8. package/examples/act-photosynthetic-exciton-transfer.n3 +5 -3
  9. package/examples/act-sensor-memory-reset.n3 +5 -3
  10. package/examples/act-tunnel-junction-wake-switch.n3 +5 -3
  11. package/examples/act-yeast-self-reproduction.n3 +5 -3
  12. package/examples/annotation.n3 +5 -0
  13. package/examples/auroracare.n3 +29 -29
  14. package/examples/backward-recursion.n3 +5 -0
  15. package/examples/barley-seed-becoming.n3 +5 -3
  16. package/examples/bmi.n3 +5 -3
  17. package/examples/builtin-coverage.n3 +5 -0
  18. package/examples/calidor.n3 +3 -3
  19. package/examples/collection.n3 +5 -0
  20. package/examples/complex-matrix-stability.n3 +5 -3
  21. package/examples/context-association.n3 +1 -9
  22. package/examples/control-system.n3 +5 -3
  23. package/examples/deep-taxonomy-10.n3 +5 -3
  24. package/examples/deep-taxonomy-100.n3 +5 -3
  25. package/examples/deep-taxonomy-1000.n3 +5 -3
  26. package/examples/deep-taxonomy-10000.n3 +5 -3
  27. package/examples/deep-taxonomy-100000.n3 +3 -1
  28. package/examples/delfour.n3 +3 -3
  29. package/examples/digital-product-passport.n3 +2 -0
  30. package/examples/dijkstra-risk-path.n3 +1 -2
  31. package/examples/easter.n3 +6 -4
  32. package/examples/eco-route-insight.n3 +1 -2
  33. package/examples/flandor.n3 +3 -3
  34. package/examples/french-cities.n3 +5 -3
  35. package/examples/fundamental-theorem-arithmetic.n3 +5 -3
  36. package/examples/genetic-algorithm-knapsack.n3 +1 -1
  37. package/examples/genetic-algorithm.n3 +1 -1
  38. package/examples/genetic-knapsack-selection.n3 +1 -2
  39. package/examples/gps.n3 +5 -3
  40. package/examples/harborsmr.n3 +5 -3
  41. package/examples/input/ontology-question-generation.trig +79 -0
  42. package/examples/input/rdf-message-flow.trig +10 -10
  43. package/examples/input/rdf-messages.trig +6 -6
  44. package/examples/interop-demo.n3 +3 -1
  45. package/examples/matrix-mechanics.n3 +3 -3
  46. package/examples/medior.n3 +3 -3
  47. package/examples/n3-speaks-for-itself.n3 +5 -0
  48. package/examples/odrl-dpv-ehds-risk-ranked.n3 +1 -1
  49. package/examples/odrl-dpv-healthcare-risk-ranked.n3 +1 -1
  50. package/examples/odrl-dpv-risk-ranked.n3 +1 -1
  51. package/examples/odrl-risk-mitigation.n3 +1 -1
  52. package/examples/odrl-risk.n3 +1 -1
  53. package/examples/ontology-question-generation.n3 +409 -0
  54. package/examples/output/{act-alarm-bit-interoperability.txt → act-alarm-bit-interoperability.md} +23 -17
  55. package/examples/output/act-barley-seed-lineage.md +31 -0
  56. package/examples/output/{act-docking-abort.txt → act-docking-abort.md} +25 -19
  57. package/examples/output/{act-gravity-mediator-witness.txt → act-gravity-mediator-witness.md} +27 -21
  58. package/examples/output/{act-isolation-breach.txt → act-isolation-breach.md} +30 -24
  59. package/examples/output/{act-photosynthetic-exciton-transfer.txt → act-photosynthetic-exciton-transfer.md} +23 -17
  60. package/examples/output/{act-sensor-memory-reset.txt → act-sensor-memory-reset.md} +23 -17
  61. package/examples/output/{act-tunnel-junction-wake-switch.txt → act-tunnel-junction-wake-switch.md} +24 -18
  62. package/examples/output/{act-yeast-self-reproduction.txt → act-yeast-self-reproduction.md} +26 -20
  63. package/examples/output/annotation.md +7 -0
  64. package/examples/output/auroracare.md +154 -0
  65. package/examples/output/backward-recursion.md +11 -0
  66. package/examples/output/barley-seed-becoming.md +31 -0
  67. package/examples/output/bmi.md +26 -0
  68. package/examples/output/builtin-coverage.md +7 -0
  69. package/examples/output/calidor.md +35 -0
  70. package/examples/output/collection.md +7 -0
  71. package/examples/output/{complex-matrix-stability.txt → complex-matrix-stability.md} +17 -11
  72. package/examples/output/context-association.md +12 -0
  73. package/examples/output/{control-system.txt → control-system.md} +23 -17
  74. package/examples/output/deep-taxonomy-10.md +21 -0
  75. package/examples/output/deep-taxonomy-100.md +21 -0
  76. package/examples/output/{deep-taxonomy-1000.txt → deep-taxonomy-1000.md} +18 -12
  77. package/examples/output/{deep-taxonomy-10000.txt → deep-taxonomy-10000.md} +18 -12
  78. package/examples/output/{deep-taxonomy-100000.txt → deep-taxonomy-100000.md} +18 -12
  79. package/examples/output/delfour.md +36 -0
  80. package/examples/output/digital-product-passport.md +7 -0
  81. package/examples/output/dijkstra-risk-path.md +16 -0
  82. package/examples/output/{easter.txt → easter.md} +156 -150
  83. package/examples/output/eco-route-insight.md +25 -0
  84. package/examples/output/flandor.md +37 -0
  85. package/examples/output/{french-cities.txt → french-cities.md} +17 -11
  86. package/examples/output/{fundamental-theorem-arithmetic.txt → fundamental-theorem-arithmetic.md} +18 -12
  87. package/examples/output/genetic-algorithm-knapsack.md +7 -0
  88. package/examples/output/genetic-algorithm.md +7 -0
  89. package/examples/output/genetic-knapsack-selection.md +18 -0
  90. package/examples/output/{gps.txt → gps.md} +18 -12
  91. package/examples/output/harborsmr.md +26 -0
  92. package/examples/output/interop-demo.md +7 -0
  93. package/examples/output/matrix-mechanics.md +20 -0
  94. package/examples/output/medior.md +38 -0
  95. package/examples/output/n3-speaks-for-itself.md +58 -0
  96. package/examples/output/{odrl-dpv-ehds-risk-ranked.txt → odrl-dpv-ehds-risk-ranked.md} +20 -15
  97. package/examples/output/{odrl-dpv-healthcare-risk-ranked.txt → odrl-dpv-healthcare-risk-ranked.md} +17 -12
  98. package/examples/output/{odrl-dpv-risk-ranked.txt → odrl-dpv-risk-ranked.md} +21 -16
  99. package/examples/output/{odrl-risk-mitigation.txt → odrl-risk-mitigation.md} +21 -16
  100. package/examples/output/{odrl-risk.txt → odrl-risk.md} +10 -5
  101. package/examples/output/ontology-question-generation.md +31 -0
  102. package/examples/output/parcellocker.md +26 -0
  103. package/examples/output/pn-junction-tunneling.md +29 -0
  104. package/examples/output/queens.md +27 -0
  105. package/examples/output/rc-discharge-envelope.md +16 -0
  106. package/examples/output/rdf-dataset.md +12 -0
  107. package/examples/output/rdf-message-flow.md +12 -0
  108. package/examples/output/rdf-messages.md +12 -0
  109. package/examples/output/{resto.txt → resto.md} +23 -17
  110. package/examples/output/school-placement-audit.md +16 -0
  111. package/examples/output/smoke-arithmetic.md +12 -0
  112. package/examples/output/sqrt2-cauchy.md +19 -0
  113. package/examples/output/sqrt2-dedekind.md +37 -0
  114. package/examples/output/sudoku.md +49 -0
  115. package/examples/output/transcendental-numbers-stretched.md +266 -0
  116. package/examples/output/transistor-switch.md +30 -0
  117. package/examples/output/triple-terms.md +12 -0
  118. package/examples/output/{tunnel-junction-wake-switch-becoming.txt → tunnel-junction-wake-switch-becoming.md} +24 -18
  119. package/examples/output/{wind-turbine.txt → wind-turbine.md} +21 -15
  120. package/examples/parcellocker.n3 +3 -1
  121. package/examples/pn-junction-tunneling.n3 +3 -3
  122. package/examples/queens.n3 +1 -0
  123. package/examples/rc-discharge-envelope.n3 +1 -1
  124. package/examples/rdf-dataset.n3 +5 -0
  125. package/examples/rdf-message-flow.n3 +1 -2
  126. package/examples/rdf-messages.n3 +1 -2
  127. package/examples/resto.n3 +5 -3
  128. package/examples/school-placement-audit.n3 +1 -2
  129. package/examples/smoke-arithmetic.n3 +1 -1
  130. package/examples/sqrt2-cauchy.n3 +2 -0
  131. package/examples/sqrt2-dedekind.n3 +2 -0
  132. package/examples/sudoku.n3 +14 -14
  133. package/examples/transcendental-numbers-stretched.n3 +5 -0
  134. package/examples/transistor-switch.n3 +3 -3
  135. package/examples/triple-terms.n3 +5 -0
  136. package/examples/tunnel-junction-wake-switch-becoming.n3 +5 -3
  137. package/examples/wind-turbine.n3 +5 -3
  138. package/eyeling.js +14 -1
  139. package/lib/explain.js +14 -1
  140. package/package.json +1 -1
  141. package/test/examples.test.js +44 -13
  142. package/test/package.test.js +43 -7
  143. package/examples/output/act-barley-seed-lineage.txt +0 -25
  144. package/examples/output/annotation.n3 +0 -0
  145. package/examples/output/auroracare.txt +0 -149
  146. package/examples/output/backward-recursion.n3 +0 -4
  147. package/examples/output/barley-seed-becoming.txt +0 -25
  148. package/examples/output/bmi.txt +0 -20
  149. package/examples/output/builtin-coverage.n3 +0 -0
  150. package/examples/output/calidor.txt +0 -29
  151. package/examples/output/collection.n3 +0 -0
  152. package/examples/output/context-association.n3 +0 -9
  153. package/examples/output/deep-taxonomy-10.txt +0 -15
  154. package/examples/output/deep-taxonomy-100.txt +0 -15
  155. package/examples/output/delfour.txt +0 -30
  156. package/examples/output/digital-product-passport.txt +0 -1
  157. package/examples/output/dijkstra-risk-path.n3 +0 -3
  158. package/examples/output/eco-route-insight.n3 +0 -3
  159. package/examples/output/flandor.txt +0 -31
  160. package/examples/output/genetic-algorithm-knapsack.txt +0 -1
  161. package/examples/output/genetic-algorithm.txt +0 -1
  162. package/examples/output/genetic-knapsack-selection.n3 +0 -3
  163. package/examples/output/harborsmr.txt +0 -20
  164. package/examples/output/interop-demo.txt +0 -1
  165. package/examples/output/matrix-mechanics.txt +0 -14
  166. package/examples/output/medior.txt +0 -32
  167. package/examples/output/n3-speaks-for-itself.txt +0 -52
  168. package/examples/output/parcellocker.txt +0 -20
  169. package/examples/output/pn-junction-tunneling.txt +0 -23
  170. package/examples/output/queens.txt +0 -21
  171. package/examples/output/rc-discharge-envelope.n3 +0 -9
  172. package/examples/output/rc-discharge-envelope.txt +0 -9
  173. package/examples/output/rdf-dataset.n3 +0 -5
  174. package/examples/output/rdf-message-flow.n3 +0 -7
  175. package/examples/output/rdf-messages.n3 +0 -7
  176. package/examples/output/school-placement-audit.n3 +0 -3
  177. package/examples/output/smoke-arithmetic.n3 +0 -5
  178. package/examples/output/smoke-arithmetic.txt +0 -5
  179. package/examples/output/sqrt2-cauchy.txt +0 -13
  180. package/examples/output/sqrt2-dedekind.txt +0 -31
  181. package/examples/output/sudoku.txt +0 -43
  182. package/examples/output/transcendental-numbers-stretched.txt +0 -260
  183. package/examples/output/transistor-switch.txt +0 -24
  184. package/examples/output/triple-terms.n3 +0 -5
package/HANDBOOK.md CHANGED
@@ -3310,54 +3310,54 @@ The following examples are especially useful if you want to see Eyeling files th
3310
3310
 
3311
3311
  #### Insight Economy and governed-data cases
3312
3312
 
3313
- - [`examples/auroracare.n3`](examples/auroracare.n3) · [`examples/output/auroracare.txt`](examples/output/auroracare.txt) — purpose-based medical data exchange with explicit allow/deny reasoning and checks around role, purpose, and conditions.
3314
- - [`examples/calidor.n3`](examples/calidor.n3) · [`examples/output/calidor.txt`](examples/output/calidor.txt) — heatwave-response case where private household signals become a narrow, expiring cooling-support insight.
3315
- - [`examples/delfour.n3`](examples/delfour.n3) · [`examples/output/delfour.txt`](examples/output/delfour.txt) — shopping-assistance case where a private condition becomes a bounded “prefer lower-sugar products” insight.
3316
- - [`examples/flandor.n3`](examples/flandor.n3) · [`examples/output/flandor.txt`](examples/output/flandor.txt) — macro-economic coordination case for Flanders that turns sensitive local signals into a regional retooling insight.
3317
- - [`examples/medior.n3`](examples/medior.n3) · [`examples/output/medior.txt`](examples/output/medior.txt) — post-discharge care-coordination case that derives a minimal continuity-bundle insight without sharing the full record.
3318
- - [`examples/parcellocker.n3`](examples/parcellocker.n3) · [`examples/output/parcellocker.txt`](examples/output/parcellocker.txt) — one-time parcel pickup authorization with a clear permit decision, justification, and misuse checks.
3319
- - [`examples/harborsmr.n3`](examples/harborsmr.n3) · [`examples/output/harborsmr.txt`](examples/output/harborsmr.txt) — SMR flexibility case where private plant telemetry becomes a narrow, expiring electrolysis-dispatch insight with policy and safety checks.
3313
+ - [`examples/auroracare.n3`](examples/auroracare.n3) · [`examples/output/auroracare.md`](examples/output/auroracare.md) — purpose-based medical data exchange with explicit allow/deny reasoning and checks around role, purpose, and conditions.
3314
+ - [`examples/calidor.n3`](examples/calidor.n3) · [`examples/output/calidor.md`](examples/output/calidor.md) — heatwave-response case where private household signals become a narrow, expiring cooling-support insight.
3315
+ - [`examples/delfour.n3`](examples/delfour.n3) · [`examples/output/delfour.md`](examples/output/delfour.md) — shopping-assistance case where a private condition becomes a bounded “prefer lower-sugar products” insight.
3316
+ - [`examples/flandor.n3`](examples/flandor.n3) · [`examples/output/flandor.md`](examples/output/flandor.md) — macro-economic coordination case for Flanders that turns sensitive local signals into a regional retooling insight.
3317
+ - [`examples/medior.n3`](examples/medior.n3) · [`examples/output/medior.md`](examples/output/medior.md) — post-discharge care-coordination case that derives a minimal continuity-bundle insight without sharing the full record.
3318
+ - [`examples/parcellocker.n3`](examples/parcellocker.n3) · [`examples/output/parcellocker.md`](examples/output/parcellocker.md) — one-time parcel pickup authorization with a clear permit decision, justification, and misuse checks.
3319
+ - [`examples/harborsmr.n3`](examples/harborsmr.n3) · [`examples/output/harborsmr.md`](examples/output/harborsmr.md) — SMR flexibility case where private plant telemetry becomes a narrow, expiring electrolysis-dispatch insight with policy and safety checks.
3320
3320
 
3321
- - [`examples/transistor-switch.n3`](examples/transistor-switch.n3) · [`examples/output/transistor-switch.txt`](examples/output/transistor-switch.txt) — NPN low-side switch model with exact arithmetic and cutoff-versus-saturation checks.
3321
+ - [`examples/transistor-switch.n3`](examples/transistor-switch.n3) · [`examples/output/transistor-switch.md`](examples/output/transistor-switch.md) — NPN low-side switch model with exact arithmetic and cutoff-versus-saturation checks.
3322
3322
 
3323
3323
  #### Core ARC-style walkthroughs
3324
3324
 
3325
- - [`examples/bmi.n3`](examples/bmi.n3) · [`examples/output/bmi.txt`](examples/output/bmi.txt) — Body Mass Index calculation with normalization, WHO category assignment, and boundary checks.
3326
- - [`examples/control-system.n3`](examples/control-system.n3) · [`examples/output/control-system.txt`](examples/output/control-system.txt) — small control-system example that derives actuator commands and explains feedforward and feedback contributions.
3327
- - [`examples/easter.n3`](examples/easter.n3) · [`examples/output/easter.txt`](examples/output/easter.txt) — Gregorian Easter computus with a readable explanation and date-window checks.
3328
- - [`examples/french-cities.n3`](examples/french-cities.n3) · [`examples/output/french-cities.txt`](examples/output/french-cities.txt) — graph reachability over French cities with explicit path reasoning.
3329
- - [`examples/gps.n3`](examples/gps.n3) · [`examples/output/gps.txt`](examples/output/gps.txt) — tiny route-planning example for western Belgium with route comparison and metric checks.
3330
- - [`examples/resto.n3`](examples/resto.n3) · [`examples/output/resto.txt`](examples/output/resto.txt) — RESTdesc-style service composition from person and date to a concrete restaurant reservation.
3331
- - [`examples/sudoku.n3`](examples/sudoku.n3) · [`examples/output/sudoku.txt`](examples/output/sudoku.txt) — Sudoku solver and report generator with consistency checks over the solved grid.
3332
- - [`examples/wind-turbine.n3`](examples/wind-turbine.n3) · [`examples/output/wind-turbine.txt`](examples/output/wind-turbine.txt) — predictive-maintenance example that turns sensor readings into an auditable inspection decision.
3325
+ - [`examples/bmi.n3`](examples/bmi.n3) · [`examples/output/bmi.md`](examples/output/bmi.md) — Body Mass Index calculation with normalization, WHO category assignment, and boundary checks.
3326
+ - [`examples/control-system.n3`](examples/control-system.n3) · [`examples/output/control-system.md`](examples/output/control-system.md) — small control-system example that derives actuator commands and explains feedforward and feedback contributions.
3327
+ - [`examples/easter.n3`](examples/easter.n3) · [`examples/output/easter.md`](examples/output/easter.md) — Gregorian Easter computus with a readable explanation and date-window checks.
3328
+ - [`examples/french-cities.n3`](examples/french-cities.n3) · [`examples/output/french-cities.md`](examples/output/french-cities.md) — graph reachability over French cities with explicit path reasoning.
3329
+ - [`examples/gps.n3`](examples/gps.n3) · [`examples/output/gps.md`](examples/output/gps.md) — tiny route-planning example for western Belgium with route comparison and metric checks.
3330
+ - [`examples/resto.n3`](examples/resto.n3) · [`examples/output/resto.md`](examples/output/resto.md) — RESTdesc-style service composition from person and date to a concrete restaurant reservation.
3331
+ - [`examples/sudoku.n3`](examples/sudoku.n3) · [`examples/output/sudoku.md`](examples/output/sudoku.md) — Sudoku solver and report generator with consistency checks over the solved grid.
3332
+ - [`examples/wind-turbine.n3`](examples/wind-turbine.n3) · [`examples/output/wind-turbine.md`](examples/output/wind-turbine.md) — predictive-maintenance example that turns sensor readings into an auditable inspection decision.
3333
3333
 
3334
3334
  #### Technical and scientific ARC demos
3335
3335
 
3336
- - [`examples/fundamental-theorem-arithmetic.n3`](examples/fundamental-theorem-arithmetic.n3) · [`examples/output/fundamental-theorem-arithmetic.txt`](examples/output/fundamental-theorem-arithmetic.txt) — smallest-divisor prime factorization of 202692987 with ARC-style existence, uniqueness-up-to-order, and primality checks.
3337
- - [`examples/complex-matrix-stability.n3`](examples/complex-matrix-stability.n3) · [`examples/output/complex-matrix-stability.txt`](examples/output/complex-matrix-stability.txt) — discrete-time stability classification for three diagonal complex 2×2 matrices via spectral radius and ARC-style checks.
3338
- - [`examples/matrix-mechanics.n3`](examples/matrix-mechanics.n3) · [`examples/output/matrix-mechanics.txt`](examples/output/matrix-mechanics.txt) — small 2×2 matrix example deriving trace, determinant, products, and a non-zero commutator.
3339
- - [`examples/pn-junction-tunneling.n3`](examples/pn-junction-tunneling.n3) · [`examples/output/pn-junction-tunneling.txt`](examples/output/pn-junction-tunneling.txt) — semiconductor toy model that explains current-proxy behavior across bias points.
3340
- - [`examples/transistor-switch.n3`](examples/transistor-switch.n3) · [`examples/output/transistor-switch.txt`](examples/output/transistor-switch.txt) — NPN low-side switch model with exact arithmetic and cutoff-versus-saturation checks.
3336
+ - [`examples/fundamental-theorem-arithmetic.n3`](examples/fundamental-theorem-arithmetic.n3) · [`examples/output/fundamental-theorem-arithmetic.md`](examples/output/fundamental-theorem-arithmetic.md) — smallest-divisor prime factorization of 202692987 with ARC-style existence, uniqueness-up-to-order, and primality checks.
3337
+ - [`examples/complex-matrix-stability.n3`](examples/complex-matrix-stability.n3) · [`examples/output/complex-matrix-stability.md`](examples/output/complex-matrix-stability.md) — discrete-time stability classification for three diagonal complex 2×2 matrices via spectral radius and ARC-style checks.
3338
+ - [`examples/matrix-mechanics.n3`](examples/matrix-mechanics.n3) · [`examples/output/matrix-mechanics.md`](examples/output/matrix-mechanics.md) — small 2×2 matrix example deriving trace, determinant, products, and a non-zero commutator.
3339
+ - [`examples/pn-junction-tunneling.n3`](examples/pn-junction-tunneling.n3) · [`examples/output/pn-junction-tunneling.md`](examples/output/pn-junction-tunneling.md) — semiconductor toy model that explains current-proxy behavior across bias points.
3340
+ - [`examples/transistor-switch.n3`](examples/transistor-switch.n3) · [`examples/output/transistor-switch.md`](examples/output/transistor-switch.md) — NPN low-side switch model with exact arithmetic and cutoff-versus-saturation checks.
3341
3341
 
3342
3342
  #### Applied Constructor-Theory ARC examples
3343
3343
 
3344
- - [`examples/act-alarm-bit-interoperability.n3`](examples/act-alarm-bit-interoperability.n3) · [`examples/output/act-alarm-bit-interoperability.txt`](examples/output/act-alarm-bit-interoperability.txt) — applied constructor-theory information example showing interoperability of an alarm bit across unlike media together with a no-cloning contrast for a quantum token.
3345
- - [`examples/act-docking-abort.n3`](examples/act-docking-abort.n3) · [`examples/output/act-docking-abort.txt`](examples/output/act-docking-abort.txt) — applied constructor-theory ARC case for a spacecraft docking-abort token covering permutation, copying, measurement, serial and parallel composition, and the impossibility of cloning a quantum seal.
3346
- - [`examples/act-isolation-breach.n3`](examples/act-isolation-breach.n3) · [`examples/output/act-isolation-breach.txt`](examples/output/act-isolation-breach.txt) — applied constructor-theory ARC case for a biosafety isolation-breach token covering preparation, distinguishability, reversible permutation, copying, measurement, composition, and no-cloning.
3347
- - [`examples/act-gravity-mediator-witness.n3`](examples/act-gravity-mediator-witness.n3) · [`examples/output/act-gravity-mediator-witness.txt`](examples/output/act-gravity-mediator-witness.txt) — applied constructor-theory witness showing that, under locality and interoperability, entanglement mediated only by gravity implies a non-classical gravitational mediator.
3348
- - ['examples/act-yeast-self-reproduction.n3'](examples/act-yeast-self-reproduction.n3) · ['examples/output/act-yeast-self-reproduction.txt'](examples/output/act-yeast-self-reproduction.txt) — applied constructor-theory example of a yeast starter culture showing replicator, vehicle, self-reproduction, heritable variation, and natural selection under no-design laws.
3349
- - ['examples/act-barley-seed-lineage.n3'](examples/act-barley-seed-lineage.n3) · ['examples/output/act-barley-seed-lineage.txt'](examples/output/act-barley-seed-lineage.txt) — applied constructor-theory ARC case showing both possible and impossible lineage tasks under no-design laws, including blocked reproduction, dormancy, and evolvability when key ingredients are missing.
3350
- - ['examples/act-tunnel-junction-wake-switch.n3'](examples/act-tunnel-junction-wake-switch.n3) · ['examples/output/act-tunnel-junction-wake-switch.txt'](examples/output/act-tunnel-junction-wake-switch.txt) — applied constructor-theory ARC case comparing a tunnel-junction wake switch with a conventional PN junction via explicit can/cannot rules for tunneling, sub-threshold current, negative differential response, and low-bias switching.
3351
- - ['examples/act-photosynthetic-exciton-transfer.n3'](examples/act-photosynthetic-exciton-transfer.n3) · ['examples/output/act-photosynthetic-exciton-transfer.txt'](examples/output/act-photosynthetic-exciton-transfer.txt) — applied constructor-theory ARC case for quantum-assisted exciton transfer in a photosynthetic antenna, contrasting a tuned complex with a detuned one via explicit can/cannot rules.
3352
- - ['examples/act-sensor-memory-reset.n3'](examples/act-sensor-memory-reset.n3) · ['examples/output/act-sensor-memory-reset.txt'](examples/output/act-sensor-memory-reset.txt) — applied constructor-theory ARC case showing that a sensor memory reset is possible with a work medium but not with heat alone, highlighting work/heat distinction and irreversibility.
3344
+ - [`examples/act-alarm-bit-interoperability.n3`](examples/act-alarm-bit-interoperability.n3) · [`examples/output/act-alarm-bit-interoperability.md`](examples/output/act-alarm-bit-interoperability.md) — applied constructor-theory information example showing interoperability of an alarm bit across unlike media together with a no-cloning contrast for a quantum token.
3345
+ - [`examples/act-docking-abort.n3`](examples/act-docking-abort.n3) · [`examples/output/act-docking-abort.md`](examples/output/act-docking-abort.md) — applied constructor-theory ARC case for a spacecraft docking-abort token covering permutation, copying, measurement, serial and parallel composition, and the impossibility of cloning a quantum seal.
3346
+ - [`examples/act-isolation-breach.n3`](examples/act-isolation-breach.n3) · [`examples/output/act-isolation-breach.md`](examples/output/act-isolation-breach.md) — applied constructor-theory ARC case for a biosafety isolation-breach token covering preparation, distinguishability, reversible permutation, copying, measurement, composition, and no-cloning.
3347
+ - [`examples/act-gravity-mediator-witness.n3`](examples/act-gravity-mediator-witness.n3) · [`examples/output/act-gravity-mediator-witness.md`](examples/output/act-gravity-mediator-witness.md) — applied constructor-theory witness showing that, under locality and interoperability, entanglement mediated only by gravity implies a non-classical gravitational mediator.
3348
+ - ['examples/act-yeast-self-reproduction.n3'](examples/act-yeast-self-reproduction.n3) · ['examples/output/act-yeast-self-reproduction.md'](examples/output/act-yeast-self-reproduction.md) — applied constructor-theory example of a yeast starter culture showing replicator, vehicle, self-reproduction, heritable variation, and natural selection under no-design laws.
3349
+ - ['examples/act-barley-seed-lineage.n3'](examples/act-barley-seed-lineage.n3) · ['examples/output/act-barley-seed-lineage.md'](examples/output/act-barley-seed-lineage.md) — applied constructor-theory ARC case showing both possible and impossible lineage tasks under no-design laws, including blocked reproduction, dormancy, and evolvability when key ingredients are missing.
3350
+ - ['examples/act-tunnel-junction-wake-switch.n3'](examples/act-tunnel-junction-wake-switch.n3) · ['examples/output/act-tunnel-junction-wake-switch.md'](examples/output/act-tunnel-junction-wake-switch.md) — applied constructor-theory ARC case comparing a tunnel-junction wake switch with a conventional PN junction via explicit can/cannot rules for tunneling, sub-threshold current, negative differential response, and low-bias switching.
3351
+ - ['examples/act-photosynthetic-exciton-transfer.n3'](examples/act-photosynthetic-exciton-transfer.n3) · ['examples/output/act-photosynthetic-exciton-transfer.md'](examples/output/act-photosynthetic-exciton-transfer.md) — applied constructor-theory ARC case for quantum-assisted exciton transfer in a photosynthetic antenna, contrasting a tuned complex with a detuned one via explicit can/cannot rules.
3352
+ - ['examples/act-sensor-memory-reset.n3'](examples/act-sensor-memory-reset.n3) · ['examples/output/act-sensor-memory-reset.md'](examples/output/act-sensor-memory-reset.md) — applied constructor-theory ARC case showing that a sensor memory reset is possible with a work medium but not with heat alone, highlighting work/heat distinction and irreversibility.
3353
3353
 
3354
3354
  #### Deep-classification stress tests
3355
3355
 
3356
- - [`examples/deep-taxonomy-10.n3`](examples/deep-taxonomy-10.n3) · [`examples/output/deep-taxonomy-10.txt`](examples/output/deep-taxonomy-10.txt) — ARC-style deep-taxonomy benchmark at depth 10.
3357
- - [`examples/deep-taxonomy-100.n3`](examples/deep-taxonomy-100.n3) · [`examples/output/deep-taxonomy-100.txt`](examples/output/deep-taxonomy-100.txt) — ARC-style deep-taxonomy benchmark at depth 100.
3358
- - [`examples/deep-taxonomy-1000.n3`](examples/deep-taxonomy-1000.n3) · [`examples/output/deep-taxonomy-1000.txt`](examples/output/deep-taxonomy-1000.txt) — ARC-style deep-taxonomy benchmark at depth 1000.
3359
- - [`examples/deep-taxonomy-10000.n3`](examples/deep-taxonomy-10000.n3) · [`examples/output/deep-taxonomy-10000.txt`](examples/output/deep-taxonomy-10000.txt) — ARC-style deep-taxonomy benchmark at depth 10000.
3360
- - [`examples/deep-taxonomy-100000.n3`](examples/deep-taxonomy-100000.n3) · [`examples/output/deep-taxonomy-100000.txt`](examples/output/deep-taxonomy-100000.txt) — ARC-style deep-taxonomy benchmark at depth 100000.
3356
+ - [`examples/deep-taxonomy-10.n3`](examples/deep-taxonomy-10.n3) · [`examples/output/deep-taxonomy-10.md`](examples/output/deep-taxonomy-10.md) — ARC-style deep-taxonomy benchmark at depth 10.
3357
+ - [`examples/deep-taxonomy-100.n3`](examples/deep-taxonomy-100.n3) · [`examples/output/deep-taxonomy-100.md`](examples/output/deep-taxonomy-100.md) — ARC-style deep-taxonomy benchmark at depth 100.
3358
+ - [`examples/deep-taxonomy-1000.n3`](examples/deep-taxonomy-1000.n3) · [`examples/output/deep-taxonomy-1000.md`](examples/output/deep-taxonomy-1000.md) — ARC-style deep-taxonomy benchmark at depth 1000.
3359
+ - [`examples/deep-taxonomy-10000.n3`](examples/deep-taxonomy-10000.n3) · [`examples/output/deep-taxonomy-10000.md`](examples/output/deep-taxonomy-10000.md) — ARC-style deep-taxonomy benchmark at depth 10000.
3360
+ - [`examples/deep-taxonomy-100000.n3`](examples/deep-taxonomy-100000.n3) · [`examples/output/deep-taxonomy-100000.md`](examples/output/deep-taxonomy-100000.md) — ARC-style deep-taxonomy benchmark at depth 100000.
3361
3361
 
3362
3362
  These files fit together because they all present reasoning in a recognizably ARC-like way: they derive an answer, make the reason visible in a compact report, and include checks that are meant to catch real mistakes. Some are classical logic or numeric examples; others show how Eyeling can express policy-aware, insight-oriented decision flows without collapsing everything into opaque application code.
3363
3363
 
@@ -9209,6 +9209,19 @@ function makeExplain(deps) {
9209
9209
  return 0;
9210
9210
  }
9211
9211
 
9212
+ function addMarkdownHardBreaks(text) {
9213
+ const normalized = String(text).replace(/\r\n/g, '\n').replace(/\r/g, '\n');
9214
+ if (!normalized.startsWith('# ')) return text;
9215
+
9216
+ return normalized
9217
+ .split('\n')
9218
+ .map((line) => {
9219
+ if (line.length === 0) return line;
9220
+ return line.replace(/[ \t]+$/g, '') + ' ';
9221
+ })
9222
+ .join('\n');
9223
+ }
9224
+
9212
9225
  function collectOutputStringsFromFacts(facts, prefixes) {
9213
9226
  // Gather all (key, string) pairs from the saturated fact store.
9214
9227
  const pairs = [];
@@ -9229,7 +9242,7 @@ function makeExplain(deps) {
9229
9242
  return a.idx - b.idx; // stable tie-breaker
9230
9243
  });
9231
9244
 
9232
- return pairs.map((p) => p.text).join('');
9245
+ return addMarkdownHardBreaks(pairs.map((p) => p.text).join(''));
9233
9246
  }
9234
9247
 
9235
9248
  return { printExplanation, collectOutputStringsFromFacts };
@@ -15,6 +15,8 @@
15
15
  @prefix arc: <https://example.org/arc#> .
16
16
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
17
17
 
18
+ :000_md_title log:outputString "# act-alarm-bit-interoperability\n\n## Source files\n\n- [N3 rules](../act-alarm-bit-interoperability.n3)\n\n" .
19
+
18
20
  :case a arc:Case ;
19
21
  arc:question "Can the harbor alarm bit be copied between an optical beacon and a relay register, and what exactly can't be done for a quantum-like token?" .
20
22
 
@@ -158,14 +160,14 @@
158
160
  {
159
161
  :out log:outputString """ACT harbor alarm bit interoperability
160
162
 
161
- Answer
163
+ ## Answer
162
164
  YES for the classical alarm bit.
163
165
  NO for universal cloning and unrestricted fan-out of the quantum-like token.
164
166
 
165
- Reason Why
167
+ ## Reason Why
166
168
  The alarm state is modeled as an abstract bit carried by two unlike classical substrates. Because both the optical beacon and the relay register are information media for the same variable, local permutation and copying in both directions are possible. By contrast, the quantum-like token is treated as a superinformation medium, so universal cloning of all of its states is impossible, and unrestricted classical-style fan-out is blocked as well.
167
169
 
168
- Check
170
+ ## Check
169
171
  C1 OK - the optical beacon is an information medium
170
172
  C2 OK - the relay register is an information medium
171
173
  C3 OK - both substrates encode the same abstract variable: AlarmBit
@@ -22,6 +22,8 @@
22
22
  @prefix arc: <https://example.org/arc#> .
23
23
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
24
24
 
25
+ :000_md_title log:outputString "# act-barley-seed-lineage\n\n## Source files\n\n- [N3 rules](../act-barley-seed-lineage.n3)\n\n" .
26
+
25
27
  :case a arc:Case ;
26
28
  arc:question "Can a barley seed lineage achieve accurate self-reproduction, dormancy, development, and adaptive persistence under no-design laws — and what exactly can't happen when key ingredients are missing?" .
27
29
 
@@ -538,14 +540,14 @@
538
540
  {
539
541
  :out log:outputString """ACT barley seed lineage — can and can't
540
542
 
541
- Answer
543
+ ## Answer
542
544
  YES for the viable barley lineage.
543
545
  NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.
544
546
 
545
- Reason Why
547
+ ## Reason Why
546
548
  The main lineage can achieve genome copying under no-design laws because its hereditary information is digitally instantiated. It can also pass through protected dormancy, germinate, produce propagules, reproduce accurately, close its life cycle, and adaptively persist under saline selection. But the contrast lineages show the "can't" side: non-digital heredity blocks accurate genome copying under no-design laws, lack of repair blocks accurate self-reproduction, lack of dormancy protection blocks lineage closure through a protected seed phase, and lack of heritable variation blocks adaptive evolution and thus blocks evolvability.
547
549
 
548
- Check
550
+ ## Check
549
551
  C1 OK - no-design laws are assumed
550
552
  C2 OK - the viable genome can be copied under no-design laws
551
553
  C3 OK - the viable seed can achieve protected dormancy
@@ -16,6 +16,8 @@
16
16
  @prefix arc: <https://example.org/arc#> .
17
17
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
18
18
 
19
+ :000_md_title log:outputString "# act-docking-abort\n\n## Source files\n\n- [N3 rules](../act-docking-abort.n3)\n\n" .
20
+
19
21
  :case a arc:Case ;
20
22
  arc:question "Can a docking-abort token be propagated, permuted, measured and audited across unlike classical media, and what exactly can't be done with the quantum authenticity seal?" .
21
23
 
@@ -261,14 +263,14 @@
261
263
  {
262
264
  :out log:outputString """ACT docking abort token — constructor-theory coverage case
263
265
 
264
- Answer
266
+ ## Answer
265
267
  YES for the classical abort token.
266
268
  NO for universal cloning and unrestricted audit fan-out of the quantum seal.
267
269
 
268
- Reason Why
270
+ ## Reason Why
269
271
  The docking-abort token is treated as an abstract information variable carried by unlike classical media: lamp state, PLC register, radio frame, and audit display. Because those substrates are information media for the same variable, the token can be permuted locally, cloned locally, copied across media, measured into an output record, and embedded in serial and parallel task networks. By contrast, the quantum authenticity seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted audit fan-out is blocked.
270
272
 
271
- Check
273
+ ## Check
272
274
  C1 OK - the abort lamp is a computation medium
273
275
  C2 OK - the abort lamp distinguishes the abort bit
274
276
  C3 OK - permutation of the abort bit is possible on the abort lamp
@@ -16,6 +16,8 @@
16
16
  @prefix arc: <https://example.org/arc#> .
17
17
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
18
18
 
19
+ :000_md_title log:outputString "# act-gravity-mediator-witness\n\n## Source files\n\n- [N3 rules](../act-gravity-mediator-witness.n3)\n\n" .
20
+
19
21
  :case a arc:Case ;
20
22
  arc:question "If two quantum sensors become entangled only through a gravitational mediator, while locality and interoperability hold, what can be concluded, and what can't a purely classical mediator model do?" .
21
23
 
@@ -209,14 +211,14 @@
209
211
  {
210
212
  :out log:outputString """ACT gravity mediator witness
211
213
 
212
- Answer
214
+ ## Answer
213
215
  YES for the mediator-only witness run.
214
216
  NO for a purely classical mediator model under the same mediator-only conditions.
215
217
 
216
- Reason Why
218
+ ## Reason Why
217
219
  The positive run assumes locality and interoperability, excludes direct coupling between the two quantum systems, and records an entanglement witness after interaction through the mediator alone. Under those constructor-theoretic conditions, the mediator must be non-classical, so the run rules out a purely classical mediator model. The contrast run keeps the same locality, interoperability, and mediator-only structure but assigns the mediator a purely classical model. In that case the mediator-only entanglement witness is blocked, so the run cannot support the same non-classicality conclusion.
218
220
 
219
- Check
221
+ ## Check
220
222
  C1 OK - locality is assumed in the positive run
221
223
  C2 OK - interoperability is assumed in the positive run
222
224
  C3 OK - direct coupling between the two quantum systems is excluded
@@ -17,6 +17,8 @@
17
17
  @prefix arc: <https://example.org/arc#> .
18
18
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
19
19
 
20
+ :000_md_title log:outputString "# act-isolation-breach\n\n## Source files\n\n- [N3 rules](../act-isolation-breach.n3)\n\n" .
21
+
20
22
  :case a arc:Case ;
21
23
  arc:question "Can an isolation-breach token be prepared, permuted, copied, measured, and audited across unlike classical media, and what exactly can't be done with the quantum provenance seal?" .
22
24
 
@@ -325,14 +327,14 @@
325
327
  {
326
328
  :out log:outputString """ACT isolation-breach token — broad constructor-theory coverage case
327
329
 
328
- Answer
330
+ ## Answer
329
331
  YES for the classical isolation-breach token.
330
332
  NO for universal cloning and unrestricted fan-out of the quantum provenance seal.
331
333
 
332
- Reason Why
334
+ ## Reason Why
333
335
  The isolation-breach token is treated as an abstract information variable carried by unlike classical media: a door beacon, a containment PLC, a nurse pager, and an incident board. Because those substrates are information media for the same variable, the token can be prepared, permuted, reversed, cloned locally, copied across media, measured into an output record, and composed into serial and parallel task networks. By contrast, the specimen seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted parallel fan-out is blocked.
334
336
 
335
- Check
337
+ ## Check
336
338
  C1 OK - the door beacon is an information medium
337
339
  C2 OK - the containment PLC is an information medium
338
340
  C3 OK - the nurse pager is an information medium
@@ -22,6 +22,8 @@
22
22
  @prefix arc: <https://example.org/arc#> .
23
23
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
24
24
 
25
+ :000_md_title log:outputString "# act-photosynthetic-exciton-transfer\n\n## Source files\n\n- [N3 rules](../act-photosynthetic-exciton-transfer.n3)\n\n" .
26
+
25
27
  :case a arc:Case ;
26
28
  arc:question "Can a tuned photosynthetic antenna deliver excitation efficiently to a reaction center by short-lived quantum-assisted transfer, while a detuned contrast complex cannot?" .
27
29
 
@@ -223,14 +225,14 @@
223
225
  {
224
226
  :out log:outputString """ACT photosynthetic exciton transfer
225
227
 
226
- Answer
228
+ ## Answer
227
229
  YES for the tuned antenna complex.
228
230
  NO for the detuned, strongly decohered contrast complex.
229
231
 
230
- Reason Why
232
+ ## Reason Why
231
233
  The tuned complex can sample exciton pathways coherently, use vibronically assisted transfer, and exploit short-lived quantum assistance along a downhill route to the reaction center. That makes efficient exciton transfer and reaction-center delivery possible in this case. The detuned contrast complex lacks the same alignment: coherent pathway sampling is blocked, vibronic assistance is unavailable, and the energy landscape is mismatched, so efficient reaction-center delivery is not possible in the same operating picture.
232
234
 
233
- Check
235
+ ## Check
234
236
  C1 OK - the tuned complex can sample exciton pathways coherently
235
237
  C2 OK - the tuned complex can use vibronically assisted transfer
236
238
  C3 OK - short-lived quantum assistance is enough in the tuned downhill regime
@@ -19,6 +19,8 @@
19
19
  @prefix arc: <https://example.org/arc#> .
20
20
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
21
21
 
22
+ :000_md_title log:outputString "# act-sensor-memory-reset\n\n## Source files\n\n- [N3 rules](../act-sensor-memory-reset.n3)\n\n" .
23
+
22
24
  :case a arc:Case ;
23
25
  arc:question "Can a radiation sensor's alarm memory be reliably reset with a battery pack, and can the same reset be done using only an ambient heat bath?" .
24
26
 
@@ -168,14 +170,14 @@
168
170
  {
169
171
  :out log:outputString """ACT sensor memory reset
170
172
 
171
- Answer
173
+ ## Answer
172
174
  YES with the battery pack.
173
175
  NO with the ambient heat bath alone.
174
176
 
175
- Reason Why
177
+ ## Reason Why
176
178
  The alarm latch is a one-bit memory that must be reset to its standard clear state before the radiation sensor can be reused. In this case, the charged battery pack is treated as a work medium, so it can drive a controlled reset and prepare the latch in its reusable standard state. The ambient bath is treated as a heat medium, so by itself it cannot perform the same reliable directed reset. The example also shows an irreversibility pattern: useful work can be degraded into dissipated heat during reset, but the ambient heat bath alone cannot reconstruct the charged work resource.
177
179
 
178
- Check
180
+ ## Check
179
181
  C1 OK - the battery pack can drive a controlled reset
180
182
  C2 OK - the alarm latch can be reliably reset from work
181
183
  C3 OK - the latch can be prepared in its standard reusable state
@@ -18,6 +18,8 @@
18
18
  @prefix arc: <https://example.org/arc#> .
19
19
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
20
20
 
21
+ :000_md_title log:outputString "# act-tunnel-junction-wake-switch\n\n## Source files\n\n- [N3 rules](../act-tunnel-junction-wake-switch.n3)\n\n" .
22
+
21
23
  :case a arc:Case ;
22
24
  arc:question "Can a tunnel-junction wake switch trigger a low-bias leak alarm in a regime where a conventional PN junction cannot?" .
23
25
 
@@ -202,14 +204,14 @@
202
204
  {
203
205
  :out log:outputString """ACT tunnel-junction wake switch
204
206
 
205
- Answer
207
+ ## Answer
206
208
  YES for the tunnel junction.
207
209
  NO for the conventional low-bias PN junction in the same wake-switch regime.
208
210
 
209
- Reason Why
211
+ ## Reason Why
210
212
  The tunnel junction is modeled as a heavily doped narrow PN junction with overlapping states, so quantum barrier transfer is possible. That makes sub-threshold current possible in the low-forward-bias regime, which in turn makes ultra-low-bias switching possible for the wake circuit. Because the device is also scanned through a peak-to-valley window, a negative differential response is possible as well. By contrast, the conventional junction lacks the structural conditions for the same transfer mode, so it cannot deliver the same low-bias switching task in this case.
211
213
 
212
- Check
214
+ ## Check
213
215
  C1 OK - the tunnel junction can support quantum barrier transfer
214
216
  C2 OK - the tunnel junction is classified as tunneling-dominant
215
217
  C3 OK - the tunnel junction can deliver sub-threshold current
@@ -19,6 +19,8 @@
19
19
  @prefix arc: <https://example.org/arc#> .
20
20
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
21
21
 
22
+ :000_md_title log:outputString "# act-yeast-self-reproduction\n\n## Source files\n\n- [N3 rules](../act-yeast-self-reproduction.n3)\n\n" .
23
+
22
24
  :case a arc:Case ;
23
25
  arc:question "Can a yeast starter culture self-reproduce accurately under no-design laws, and what exactly can't happen for a non-digital contrast lineage?" .
24
26
 
@@ -223,14 +225,14 @@
223
225
  {
224
226
  :out log:outputString """ACT yeast self-reproduction
225
227
 
226
- Answer
228
+ ## Answer
227
229
  YES for the viable starter culture.
228
230
  NO for accurate self-reproduction in the non-digital contrast lineage.
229
231
 
230
- Reason Why
232
+ ## Reason Why
231
233
  The starter genome is treated as a replicator storing digital hereditary information, while the cell machinery is treated as the vehicle that enables metabolism and copying support. Under no-design laws, digital information makes accurate genome copying possible. Because the replicator is accurate and paired with a vehicle, the whole starter cell qualifies as a self-reproducer. With a variation source and a selection environment, natural selection also becomes possible. By contrast, the non-digital lineage cannot support accurate genome copying under the same no-design-laws assumption, so it cannot sustain the same accurate self-reproduction or natural-selection story.
232
234
 
233
- Check
235
+ ## Check
234
236
  C1 OK - no-design laws are assumed
235
237
  C2 OK - digital information is physically instantiated for the viable lineage
236
238
  C3 OK - a viable replicator is present
@@ -5,3 +5,8 @@
5
5
  :t log:nameOf { :a :name "Alice" . } .
6
6
  :t :statedBy :bob .
7
7
  :t :recorded "2021-07-07"^^xsd:date .
8
+
9
+
10
+ # Markdown rendering via log:outputString.
11
+ :__md_output :text "# annotation\n\n## Source files\n\n- [N3 rules](../annotation.n3)\n- [Input TriG](../input/annotation.trig)\n\n" .
12
+ { :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
@@ -350,19 +350,19 @@
350
350
  # Emit one complete output block per scenario to avoid ordering issues between
351
351
  # separately derived log:outputString facts.
352
352
 
353
- :out_000_intro log:outputString "AuroraCare — Purpose-based Medical Data Exchange\n\n" .
353
+ :out_000_intro log:outputString "# auroracare\n\n## Source files\n\n- [N3 rules](../auroracare.n3)\n\nAuroraCare — Purpose-based Medical Data Exchange\n\n" .
354
354
 
355
355
  { :scenario_A :decision "PERMIT" . } => {
356
- :out_010_A log:outputString """=== A – Primary care visit ===
356
+ :out_010_A log:outputString """## A – Primary care visit
357
357
  Clinician in the patient's care team accessing the patient summary for primary care management.
358
358
 
359
- Answer
359
+ ## Answer
360
360
  PERMIT
361
361
 
362
- Reason Why
362
+ ## Reason Why
363
363
  Permitted: clinician in the patient's care team, and the primary-care policy matched.
364
364
 
365
- Check
365
+ ## Check
366
366
  C1 SKIPPED - not a prohibited purpose
367
367
  C2 OK - clinician
368
368
  C3 OK - care-team linked
@@ -378,16 +378,16 @@ C10 INFO - matched policy: urn:policy:primary-care-001
378
378
  } .
379
379
 
380
380
  { :scenario_B :decision "PERMIT" . } => {
381
- :out_020_B log:outputString """=== B – Quality improvement (in scope) ===
381
+ :out_020_B log:outputString """## B – Quality improvement (in scope)
382
382
  QI analyst using lab results + summary in a secure environment.
383
383
 
384
- Answer
384
+ ## Answer
385
385
  PERMIT
386
386
 
387
- Reason Why
387
+ ## Reason Why
388
388
  Permitted: ODRL/DPV policy matched for secondary use.
389
389
 
390
- Check
390
+ ## Check
391
391
  C1 SKIPPED - not a prohibited purpose
392
392
  C2 SKIPPED
393
393
  C3 SKIPPED
@@ -403,16 +403,16 @@ C10 INFO - matched policy: urn:policy:qi-2025-aurora
403
403
  } .
404
404
 
405
405
  { :scenario_C :decision "DENY" . } => {
406
- :out_030_C log:outputString """=== C – Quality improvement (out of scope) ===
406
+ :out_030_C log:outputString """## C – Quality improvement (out of scope)
407
407
  QI analyst with only lab results; policy expects labs + summary.
408
408
 
409
- Answer
409
+ ## Answer
410
410
  DENY
411
411
 
412
- Reason Why
412
+ ## Reason Why
413
413
  Denied: no policy matched (purpose, environment, TOMs, or categories out of scope).
414
414
 
415
- Check
415
+ ## Check
416
416
  C1 SKIPPED - not a prohibited purpose
417
417
  C2 SKIPPED
418
418
  C3 SKIPPED
@@ -428,16 +428,16 @@ C10 SKIPPED - no matched policy
428
428
  } .
429
429
 
430
430
  { :scenario_D :decision "DENY" . } => {
431
- :out_040_D log:outputString """=== D – Insurance management ===
431
+ :out_040_D log:outputString """## D – Insurance management
432
432
  Insurance bot attempting to use health data for insurance management (prohibited purpose).
433
433
 
434
- Answer
434
+ ## Answer
435
435
  DENY
436
436
 
437
- Reason Why
437
+ ## Reason Why
438
438
  Denied: the requested purpose (insurance management) is prohibited by policy.
439
439
 
440
- Check
440
+ ## Check
441
441
  C1 OK - denied prohibited purpose
442
442
  C2 SKIPPED
443
443
  C3 SKIPPED
@@ -453,16 +453,16 @@ C10 SKIPPED - no matched policy
453
453
  } .
454
454
 
455
455
  { :scenario_E :decision "PERMIT" . } => {
456
- :out_050_E log:outputString """=== E – GP checks labs ===
456
+ :out_050_E log:outputString """## E – GP checks labs
457
457
  GP for the same patient checking lab results via the API gateway.
458
458
 
459
- Answer
459
+ ## Answer
460
460
  PERMIT
461
461
 
462
- Reason Why
462
+ ## Reason Why
463
463
  Permitted: clinician in the patient's care team, and the primary-care policy matched.
464
464
 
465
- Check
465
+ ## Check
466
466
  C1 SKIPPED - not a prohibited purpose
467
467
  C2 OK - clinician
468
468
  C3 OK - care-team linked
@@ -478,16 +478,16 @@ C10 INFO - matched policy: urn:policy:primary-care-001
478
478
  } .
479
479
 
480
480
  { :scenario_F :decision "PERMIT" . } => {
481
- :out_060_F log:outputString """=== F – Research on anonymised dataset ===
481
+ :out_060_F log:outputString """## F – Research on anonymised dataset
482
482
  Researcher using anonymised labs + summary in a secure environment, with opt-in.
483
483
 
484
- Answer
484
+ ## Answer
485
485
  PERMIT
486
486
 
487
- Reason Why
487
+ ## Reason Why
488
488
  Permitted: subject opted in and an ODRL/DPV policy matched (anonymised dataset in secure environment).
489
489
 
490
- Check
490
+ ## Check
491
491
  C1 SKIPPED - not a prohibited purpose
492
492
  C2 SKIPPED
493
493
  C3 SKIPPED
@@ -503,16 +503,16 @@ C10 INFO - matched policy: urn:policy:research-aurora-diabetes
503
503
  } .
504
504
 
505
505
  { :scenario_G :decision "DENY" . } => {
506
- :out_070_G log:outputString """=== G – AI training (opt-out) ===
506
+ :out_070_G log:outputString """## G – AI training (opt-out)
507
507
  Data user wants to train AI, but the subject opted out of AI training.
508
508
 
509
- Answer
509
+ ## Answer
510
510
  DENY
511
511
 
512
- Reason Why
512
+ ## Reason Why
513
513
  Denied: you opted out of your data being used to train AI systems.
514
514
 
515
- Check
515
+ ## Check
516
516
  C1 SKIPPED - not a prohibited purpose
517
517
  C2 SKIPPED
518
518
  C3 SKIPPED
@@ -8,3 +8,8 @@
8
8
 
9
9
  { :a :ancestor ?who } => { :a :reaches ?who }.
10
10
  { :a :reaches ?who } log:query { :a :reaches ?who }.
11
+
12
+
13
+ # Markdown rendering via log:outputString.
14
+ :__md_output :text "# backward-recursion\n\n## Source files\n\n- [N3 rules](../backward-recursion.n3)\n- [Input TriG](../input/backward-recursion.trig)\n\n@prefix : <urn:example#> .\n\n:a :reaches :b .\n:a :reaches :c .\n" .
15
+ { :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
@@ -21,6 +21,8 @@
21
21
  @prefix arc: <https://example.org/arc#> .
22
22
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
23
23
 
24
+ :000_md_title log:outputString "# barley-seed-becoming\n\n## Source files\n\n- [N3 rules](../barley-seed-becoming.n3)\n\n" .
25
+
24
26
  :case a arc:Case ;
25
27
  arc:question "Can a barley seed lineage become a self-renewing and adaptively persistent cycle under no-design laws — and what blocks that becoming when digital heredity, repair, protected dormancy, or variation are missing?" .
26
28
 
@@ -470,14 +472,14 @@
470
472
  {
471
473
  :out log:outputString """Barley seed lineage — becoming
472
474
 
473
- Answer
475
+ ## Answer
474
476
  YES for the viable barley lineage.
475
477
  NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.
476
478
 
477
- Reason Why
479
+ ## Reason Why
478
480
  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.
479
481
 
480
- Check
482
+ ## Check
481
483
  B1 OK - no-design laws are assumed
482
484
  B2 OK - the viable genome can become accurately copied
483
485
  B3 OK - the viable seed can become a protected dormant phase
package/examples/bmi.n3 CHANGED
@@ -15,6 +15,8 @@
15
15
  @prefix math: <http://www.w3.org/2000/10/swap/math#> .
16
16
  @prefix string: <http://www.w3.org/2000/10/swap/string#> .
17
17
 
18
+ :000_md_title log:outputString "# bmi\n\n## Source files\n\n- [N3 rules](../bmi.n3)\n\n" .
19
+
18
20
  # --------------
19
21
  # Editable input
20
22
  # --------------
@@ -196,15 +198,15 @@
196
198
  :Check :c9 ?C9.
197
199
  (
198
200
  "BMI — ARC-style Body Mass Index example\n\n"
199
- "Answer\n"
201
+ "## Answer\n"
200
202
  "BMI = " ?BmiRounded "\n"
201
203
  "Category = " ?Category "\n"
202
204
  "At height " ?CmRounded " cm, a healthy-weight range is about " ?HealthyMinRounded "–" ?HealthyMaxRounded " kg (BMI 18.5–24.9).\n\n"
203
- "Reason Why\n"
205
+ "## Reason Why\n"
204
206
  "BMI is defined as weight in kilograms divided by height in meters squared. "
205
207
  "This program first normalizes the input to SI units, computes BMI, and then applies WHO adult categories as half-open intervals. "
206
208
  "The healthy-weight band is the weight range at the same height that corresponds to BMI 18.5 through 24.9.\n\n"
207
- "Check\n"
209
+ "## Check\n"
208
210
  "C1 " ?C1 "\n"
209
211
  "C2 " ?C2 "\n"
210
212
  "C3 " ?C3 "\n"
@@ -66,3 +66,8 @@
66
66
  }.
67
67
 
68
68
  { :assurance ?p ?o } log:query { :assurance ?p ?o }.
69
+
70
+
71
+ # Markdown rendering via log:outputString.
72
+ :__md_output :text "# builtin-coverage\n\n## Source files\n\n- [N3 rules](../builtin-coverage.n3)\n- [Input TriG](../input/builtin-coverage.trig)\n\n" .
73
+ { :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .