eyeling 1.16.3 → 1.16.5

package/examples/output/parcellocker.n3

@@ -0,0 +1,15 @@
+@prefix : <https://example.org/parcellocker#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+
+:case :checkC8 :Passed .
+:case :checkC6 :Passed .
+:case :checkC7 :Passed .
+:case :checkC9 :Passed .
+:case :checkC10 :Passed .
+:case :checkC1 :Passed .
+:case :checkC2 :Passed .
+:case :checkC3 :Passed .
+:case :checkC4 :Passed .
+:case :checkC5 :Passed .
+:case :decision :Permit .
+:out log:outputString "ParcelLocker — One-time parcel pickup by a friend\n\nAnswer\nPERMIT\nNoah may collect Maya's parcel from locker B17.\n\nReason Why\nMaya created a one-time authorization for Noah only, for this parcel only, at this locker only, and for pickup only. The token is active, the parcel is ready, and the same authorization does not reveal billing details or allow redirection.\n\nCheck\nC1  OK - requester matches the named delegate\nC2  OK - requested parcel matches the authorized parcel\nC3  OK - requested locker matches the authorized locker\nC4  OK - requested action is parcel collection\nC5  OK - requested purpose is pickup only\nC6  OK - authorization is active\nC7  OK - authorization is single-use\nC8  OK - parcel is ready for pickup\nC9  OK - billing details stay hidden\nC10 OK - parcel redirection is not allowed\n" .

package/examples/parcellocker.n3

@@ -0,0 +1,164 @@
+# ===========================================================================
+# ParcelLocker — One-time parcel pickup by a friend.
+#
+# This example shows how a person can let someone else collect a parcel without
+# handing over their full shopping account. A one-time authorization is limited
+# to one named person, one parcel, one locker, and one purpose: pickup. The
+# locker may release the parcel, but the same authorization cannot be used to
+# view billing details or redirect the parcel somewhere else.
+# ===========================================================================
+
+@prefix : <https://example.org/parcellocker#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+
+# -----
+# Facts
+# -----
+
+:maya a :Person; :name "Maya" .
+:noah a :Person; :name "Noah" .
+
+:parcel123 a :Parcel;
+    :owner :maya;
+    :status :ReadyForPickup .
+
+:lockerB17 a :Locker;
+    :site "Station West" .
+
+:pickupToken a :PickupAuthorization;
+    :issuedBy :maya;
+    :delegate :noah;
+    :parcel :parcel123;
+    :locker :lockerB17;
+    :action :CollectParcel;
+    :purpose :PickupOnly;
+    :state :Active;
+    :reuse :SingleUse;
+    :billingAccess :None;
+    :redirectAllowed :No .
+
+:pickupRequest a :Request;
+    :requester :noah;
+    :parcel :parcel123;
+    :locker :lockerB17;
+    :action :CollectParcel;
+    :purpose :PickupOnly .
+
+# -----
+# Logic
+# -----
+
+{ :pickupToken :delegate ?who .
+  :pickupRequest :requester ?who . }
+    => { :case :checkC1 :Passed . } .
+
+{ :pickupToken :parcel ?parcel .
+  :pickupRequest :parcel ?parcel . }
+    => { :case :checkC2 :Passed . } .
+
+{ :pickupToken :locker ?locker .
+  :pickupRequest :locker ?locker . }
+    => { :case :checkC3 :Passed . } .
+
+{ :pickupToken :action ?action .
+  :pickupRequest :action ?action . }
+    => { :case :checkC4 :Passed . } .
+
+{ :pickupToken :purpose ?purpose .
+  :pickupRequest :purpose ?purpose . }
+    => { :case :checkC5 :Passed . } .
+
+{ :pickupToken :state :Active . }
+    => { :case :checkC6 :Passed . } .
+
+{ :pickupToken :reuse :SingleUse . }
+    => { :case :checkC7 :Passed . } .
+
+{ :parcel123 :status :ReadyForPickup . }
+    => { :case :checkC8 :Passed . } .
+
+{ :pickupToken :billingAccess :None . }
+    => { :case :checkC9 :Passed . } .
+
+{ :pickupToken :redirectAllowed :No . }
+    => { :case :checkC10 :Passed . } .
+
+{ :case :checkC1 :Passed .
+  :case :checkC2 :Passed .
+  :case :checkC3 :Passed .
+  :case :checkC4 :Passed .
+  :case :checkC5 :Passed .
+  :case :checkC6 :Passed .
+  :case :checkC7 :Passed .
+  :case :checkC8 :Passed .
+  :case :checkC9 :Passed .
+  :case :checkC10 :Passed . }
+    => { :case :decision :Permit . } .
+
+# ------------------
+# Presentation (ARC)
+# ------------------
+
+{ :case :decision :Permit . }
+    => {
+        :out log:outputString "ParcelLocker — One-time parcel pickup by a friend\n\nAnswer\nPERMIT\nNoah may collect Maya's parcel from locker B17.\n\nReason Why\nMaya created a one-time authorization for Noah only, for this parcel only, at this locker only, and for pickup only. The token is active, the parcel is ready, and the same authorization does not reveal billing details or allow redirection.\n\nCheck\nC1  OK - requester matches the named delegate\nC2  OK - requested parcel matches the authorized parcel\nC3  OK - requested locker matches the authorized locker\nC4  OK - requested action is parcel collection\nC5  OK - requested purpose is pickup only\nC6  OK - authorization is active\nC7  OK - authorization is single-use\nC8  OK - parcel is ready for pickup\nC9  OK - billing details stay hidden\nC10 OK - parcel redirection is not allowed\n" .
+    } .
+
+# ----------------
+# Fail-loud checks
+# ----------------
+
+{ :case :decision :Permit .
+  :pickupRequest :requester ?r .
+  :pickupToken :delegate ?d .
+  ?r log:notEqualTo ?d . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupRequest :parcel ?requested .
+  :pickupToken :parcel ?authorized .
+  ?requested log:notEqualTo ?authorized . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupRequest :locker ?requested .
+  :pickupToken :locker ?authorized .
+  ?requested log:notEqualTo ?authorized . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupRequest :action ?requested .
+  :pickupToken :action ?authorized .
+  ?requested log:notEqualTo ?authorized . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupRequest :purpose ?requested .
+  :pickupToken :purpose ?authorized .
+  ?requested log:notEqualTo ?authorized . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupToken :state ?state .
+  ?state log:notEqualTo :Active . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupToken :reuse ?reuse .
+  ?reuse log:notEqualTo :SingleUse . }
+    => false .
+
+{ :case :decision :Permit .
+  :parcel123 :status ?status .
+  ?status log:notEqualTo :ReadyForPickup . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupToken :billingAccess ?access .
+  ?access log:notEqualTo :None . }
+    => false .
+
+{ :case :decision :Permit .
+  :pickupToken :redirectAllowed ?redirect .
+  ?redirect log:notEqualTo :No . }
+    => false .

package/eyeling.js

@@ -4719,6 +4719,8 @@ const {
   MATH_NS,
   LOG_NS,
   SKOLEM_NS,
+  MAX_LITERAL_TID_LEN,
+  normalizeLiteralForTid,
   Literal,
   Iri,
   Var,
@@ -5627,7 +5629,18 @@ function __internCompoundTid(key) {
 
 function termFastKey(t) {
   // Atomic terms that already have a stable id.
-  if (t instanceof Iri || t instanceof Blank || t instanceof Literal) return t.__tid;
+  if (t instanceof Iri || t instanceof Blank) return t.__tid;
+
+  if (t instanceof Literal) {
+    // Very large literals intentionally skip global interning in prelude.js to
+    // avoid retaining huge strings forever. Their per-object __tid is therefore
+    // not value-stable, so using it here breaks duplicate detection for facts
+    // such as long log:outputString blocks that are re-derived during forward
+    // chaining. Fall back to a value-based key in that case.
+    const norm = normalizeLiteralForTid(t.value);
+    if (typeof norm === 'string' && norm.length > MAX_LITERAL_TID_LEN) return 'L:' + norm;
+    return t.__tid;
+  }
 
   // Structural fast key for strict-ground list terms.
   // We only index when every element has a fast key; otherwise return null.
@@ -10389,6 +10402,8 @@ module.exports = {
   RDF_JSON_DT,
   resolveIriRef,
   literalParts,
+  normalizeLiteralForTid,
+  MAX_LITERAL_TID_LEN,
   Term,
   Iri,
   Literal,

package/lib/engine.js

@@ -13,6 +13,8 @@ const {
   MATH_NS,
   LOG_NS,
   SKOLEM_NS,
+  MAX_LITERAL_TID_LEN,
+  normalizeLiteralForTid,
   Literal,
   Iri,
   Var,
@@ -921,7 +923,18 @@ function __internCompoundTid(key) {
 
 function termFastKey(t) {
   // Atomic terms that already have a stable id.
-  if (t instanceof Iri || t instanceof Blank || t instanceof Literal) return t.__tid;
+  if (t instanceof Iri || t instanceof Blank) return t.__tid;
+
+  if (t instanceof Literal) {
+    // Very large literals intentionally skip global interning in prelude.js to
+    // avoid retaining huge strings forever. Their per-object __tid is therefore
+    // not value-stable, so using it here breaks duplicate detection for facts
+    // such as long log:outputString blocks that are re-derived during forward
+    // chaining. Fall back to a value-based key in that case.
+    const norm = normalizeLiteralForTid(t.value);
+    if (typeof norm === 'string' && norm.length > MAX_LITERAL_TID_LEN) return 'L:' + norm;
+    return t.__tid;
+  }
 
   // Structural fast key for strict-ground list terms.
   // We only index when every element has a fast key; otherwise return null.

package/lib/prelude.js

@@ -515,6 +515,8 @@ module.exports = {
   RDF_JSON_DT,
   resolveIriRef,
   literalParts,
+  normalizeLiteralForTid,
+  MAX_LITERAL_TID_LEN,
   Term,
   Iri,
   Literal,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.16.3",
+  "version": "1.16.5",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [
@@ -30,8 +30,7 @@
     "lib",
     "test",
     "tools",
-    "examples",
-    "arctifacts"
+    "examples"
   ],
   "engines": {
     "node": ">=18"

package/arctifacts/README.md

@@ -1,59 +0,0 @@
-# ARCtifacts
-
-ARCtifacts are trustworthy programs telling a concise story in three parts. First comes the **Answer** to a specific question. This is followed by the **Reason Why** that answer is correct, articulated in everyday language and supported by the relevant identities, rules, or ideas. Finally, every case includes a **Check**—a concrete test designed to fail loudly if an assumption doesn't hold or an edge case bites. The result is a computation with a complete, auditable trail: you can see precisely what was done, why it was valid, and how the page verifies its own work.
-
-At the core of this approach are three familiar ingredients: **Data**, **Logic**, and a **Question**. We summarize the workflow as **P3 — Prompt → Program → Proof**: the prompt supplies the task and materials, the program turns them into a concrete, repeatable procedure, and the proof is practical rather than ceremonial, consisting of the **Reason Why** together with the **Check**. This is what makes each ARCtifact not just a result, but a portable, auditable, and trustworthy computational artifact.
-
-## Science
-
-- [**Body Mass Index**](https://eyereasoner.github.io/eyeling/arctifacts/bmi.html) — Compute BMI categories with explainable thresholds and sanity checks.
-- [**Earthquake Epicenter**](https://eyereasoner.github.io/eyeling/arctifacts/earthquake-epicenter.html) — Infer an earthquake’s epicenter from P- and S-wave arrivals and verify with distance and timing checks.
-- [**Exoplanet Transit**](https://eyereasoner.github.io/eyeling/arctifacts/exoplanet-transit.html) — Infer a planet’s size and orbit from a transit light curve, with explainable formulas and consistency checks.
-- [**Grass Seed Germination**](https://eyereasoner.github.io/eyeling/arctifacts/grass-molecular.html) — Model germination states and transitions with rule checks.
-- [**Leg Length Discrepancy Measurement**](https://eyereasoner.github.io/eyeling/arctifacts/lldm.html) — Leg Length Discrepancy Measurement from four landmarks.
-
-## Technology
-
-- [**Auroracare**](https://eyereasoner.github.io/eyeling/arctifacts/auroracare.html) — Purpose-based Medical Data Exchange.
-- [**Clinical Care Planning**](https://eyereasoner.github.io/eyeling/arctifacts/clinical-care.html) — Derive care plans from observations, guidelines, and policy constraints.
-- [**Delfour**](https://eyereasoner.github.io/eyeling/arctifacts/delfour.html) — Ruben Verborgh's "Inside the Insight Economy" case.
-- [**GPS Clinical Bench**](https://eyereasoner.github.io/eyeling/arctifacts/gps-clinical-bench.html) — Benchmark clinical decisions with transparent rules and audit trails.
-- [**Graph of French Cities**](https://eyereasoner.github.io/eyeling/arctifacts/graph-french.html) — Shortest paths and connectivity over a city graph with proofs.
-- [**Health Information Processing**](https://eyereasoner.github.io/eyeling/arctifacts/health-info.html) — Transform clinical payloads with typed rules and validation.
-- [**Linked Lists**](https://eyereasoner.github.io/eyeling/arctifacts/linked-lists.html) — Term logic example proved using Resolution.
-- [**REST-Path**](https://eyereasoner.github.io/eyeling/arctifacts/rest-path.html) — Explain link-following over REST resources; verify pre/post conditions.
-- [**Turing Machine**](https://eyereasoner.github.io/eyeling/arctifacts/turing.html) — Run tapes with explicit transitions; verify halting and tape contents.
-
-## Engineering
-
-- [**Bike Trip Planning**](https://eyereasoner.github.io/eyeling/arctifacts/bike-trip.html) — Route priorities from hazards, preferences, and declarative JSON rules.
-- [**Building Performance**](https://eyereasoner.github.io/eyeling/arctifacts/building-performance.html) — Reason about energy/comfort metrics and verify rule-based outcomes.
-- [**Control System**](https://eyereasoner.github.io/eyeling/arctifacts/control-system.html) — Model simple feedback loops and verify stability/response conditions.
-- [**Eco-Route**](https://eyereasoner.github.io/eyeling/arctifacts/eco-route.html) — Pick lower-emission routes by fusing traffic, grade, and policy goals.
-- [**GPS Bike**](https://eyereasoner.github.io/eyeling/arctifacts/gps-bike.html) — GPS for bike trip Gent → Maasmechelen.
-- [**Lee**](https://eyereasoner.github.io/eyeling/arctifacts/lee.html) — Maze routing with Lee’s algorithm; trace optimal wavefront paths.
-- [**Wind-Turbine Maintenance**](https://eyereasoner.github.io/eyeling/arctifacts/wind-turbines.html) — Plan maintenance from telemetry and policies with auditable outcomes.
-
-## Mathematics
-
-- [**Ackermann**](https://eyereasoner.github.io/eyeling/arctifacts/ackermann.html) — Compute A₂ with exact hyper-ops; print small, expand huge safely.
-- [**Binomial Theorem**](https://eyereasoner.github.io/eyeling/arctifacts/binomial-theorem.html) — Sum of all binomial coefficients.
-- [**Collatz**](https://eyereasoner.github.io/eyeling/arctifacts/collatz.html) — Generate trajectories and check invariants for the Collatz map.
-- [**Complex Identities**](https://eyereasoner.github.io/eyeling/arctifacts/complex.html) — Symbolic steps for complex-number equalities with auditable reasoning.
-- [**Euclid’s Infinitude of Primes**](https://eyereasoner.github.io/eyeling/arctifacts/euclid-infinitude.html) — Restate the theorem, explain Euclid’s one-line proof, and run computational checks.
-- [**Euler’s Identity**](https://eyereasoner.github.io/eyeling/arctifacts/euler-identity.html) — The most beautiful equation in mathematics.
-- [**Faltings' Theorem**](https://eyereasoner.github.io/eyeling/arctifacts/faltings-theorem.html) — Explore genus 0, 1, and 2 curves, and see why genus ≥ 2 leads to only finitely many rational points.
-- [**Fibonacci**](https://eyereasoner.github.io/eyeling/arctifacts/fibonacci.html) — Compute big Fₙ with fast-doubling recurrences and proof-style checks.
-- [**Fundamental Theorem of Arithmetic**](https://eyereasoner.github.io/eyeling/arctifacts/fundamental-theorem-arithmetic.html) — Every integer factors as a product of primes.
-- [**Gödel Numbering**](https://eyereasoner.github.io/eyeling/arctifacts/godel-numbering.html) — A classic Gödel numbering demonstrator.
-- [**Group Theory**](https://eyereasoner.github.io/eyeling/arctifacts/group-theory.html) — Verify closure, identity, inverses, and associativity on examples.
-- [**Kaprekar’s Constant**](https://eyereasoner.github.io/eyeling/arctifacts/kaprekar-constant.html) — Exhaustive sweep of every 4-digit state in Kaprekar’s routine.
-- [**Matrix Basics**](https://eyereasoner.github.io/eyeling/arctifacts/matrix.html) — Add/multiply/invert with dimension/property checks.
-- [**Matrix Multiplication**](https://eyereasoner.github.io/eyeling/arctifacts/matrix-multiplication.html) — Not commutative (AB ≠ BA).
-- [**Newton–Raphson**](https://eyereasoner.github.io/eyeling/arctifacts/newton-raphson.html) — Newton–Raphson method for root-finding.
-- [**Peano Factorial**](https://eyereasoner.github.io/eyeling/arctifacts/peano-factorial.html) — 5! = 120 proved via Resolution.
-- [**Pi**](https://eyereasoner.github.io/eyeling/arctifacts/pi.html) — High-precision π via Chudnovsky series with error-bound checks.
-- [**Polynomial Roots**](https://eyereasoner.github.io/eyeling/arctifacts/polynomial.html) — Find all roots simultaneously; prove convergence on typical cases.
-- [**Primes**](https://eyereasoner.github.io/eyeling/arctifacts/prime.html) — Generate/test primes; log certs (trial factors or proofs) as checks.
-- [**Pythagorean Theorem**](https://eyereasoner.github.io/eyeling/arctifacts/pythagorean-theorem.html) — Compute legs/hypotenuse and confirm with algebraic or area proofs.
-- [**Roots of Unity**](https://eyereasoner.github.io/eyeling/arctifacts/roots-of-unity.html) — Place complex n-th roots on the unit circle; check spacing and sums/products.