eyeling 1.32.0 → 1.33.0

package/lib/eyelang/hash.mjs

@@ -0,0 +1,294 @@
+// Small dependency-free hashing helpers shared by Node and browser builds.
+// They intentionally avoid node:crypto so src/index.js remains importable by the
+// browser playground when the N3 crypto builtins are registered.
+
+const textEncoder = new TextEncoder();
+
+export function hashHex(algorithm, text) {
+  const name = String(algorithm).toLowerCase().replace(/[^a-z0-9]/g, '');
+  const bytes = textEncoder.encode(String(text));
+  if (name === 'md5') return md5Hex(bytes);
+  if (name === 'sha' || name === 'sha1') return sha1Hex(bytes);
+  if (name === 'sha256') return sha256Hex(bytes);
+  if (name === 'sha512') return sha512Hex(bytes);
+  throw new Error(`Unsupported hash algorithm: ${algorithm}`);
+}
+
+function hex32(x) {
+  return (x >>> 0).toString(16).padStart(8, '0');
+}
+
+function rotr32(x, n) {
+  return (x >>> n) | (x << (32 - n));
+}
+
+function rotl32(x, n) {
+  return (x << n) | (x >>> (32 - n));
+}
+
+function bytesToHex(bytes) {
+  let out = '';
+  for (const b of bytes) out += b.toString(16).padStart(2, '0');
+  return out;
+}
+
+function paddedBytes(bytes, blockBytes, lengthBytes, littleLength = false) {
+  const bitLength = BigInt(bytes.length) * 8n;
+  const withOne = bytes.length + 1;
+  const zeroCount = (blockBytes - ((withOne + lengthBytes) % blockBytes)) % blockBytes;
+  const out = new Uint8Array(withOne + zeroCount + lengthBytes);
+  out.set(bytes, 0);
+  out[bytes.length] = 0x80;
+  for (let i = 0; i < lengthBytes; i++) {
+    const shift = BigInt(littleLength ? i * 8 : (lengthBytes - 1 - i) * 8);
+    out[out.length - lengthBytes + i] = Number((bitLength >> shift) & 0xffn);
+  }
+  return out;
+}
+
+function sha1Hex(bytes) {
+  const msg = paddedBytes(bytes, 64, 8);
+  let h0 = 0x67452301;
+  let h1 = 0xefcdab89;
+  let h2 = 0x98badcfe;
+  let h3 = 0x10325476;
+  let h4 = 0xc3d2e1f0;
+  const w = new Array(80);
+
+  for (let offset = 0; offset < msg.length; offset += 64) {
+    for (let i = 0; i < 16; i++) {
+      const j = offset + i * 4;
+      w[i] = ((msg[j] << 24) | (msg[j + 1] << 16) | (msg[j + 2] << 8) | msg[j + 3]) >>> 0;
+    }
+    for (let i = 16; i < 80; i++) w[i] = rotl32(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16], 1) >>> 0;
+
+    let a = h0, b = h1, c = h2, d = h3, e = h4;
+    for (let i = 0; i < 80; i++) {
+      let f, k;
+      if (i < 20) { f = (b & c) | (~b & d); k = 0x5a827999; }
+      else if (i < 40) { f = b ^ c ^ d; k = 0x6ed9eba1; }
+      else if (i < 60) { f = (b & c) | (b & d) | (c & d); k = 0x8f1bbcdc; }
+      else { f = b ^ c ^ d; k = 0xca62c1d6; }
+      const temp = (rotl32(a, 5) + f + e + k + w[i]) >>> 0;
+      e = d;
+      d = c;
+      c = rotl32(b, 30) >>> 0;
+      b = a;
+      a = temp;
+    }
+    h0 = (h0 + a) >>> 0;
+    h1 = (h1 + b) >>> 0;
+    h2 = (h2 + c) >>> 0;
+    h3 = (h3 + d) >>> 0;
+    h4 = (h4 + e) >>> 0;
+  }
+
+  return [h0, h1, h2, h3, h4].map(hex32).join('');
+}
+
+const SHA256_K = [
+  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
+];
+
+function sha256Hex(bytes) {
+  const msg = paddedBytes(bytes, 64, 8);
+  let h0 = 0x6a09e667;
+  let h1 = 0xbb67ae85;
+  let h2 = 0x3c6ef372;
+  let h3 = 0xa54ff53a;
+  let h4 = 0x510e527f;
+  let h5 = 0x9b05688c;
+  let h6 = 0x1f83d9ab;
+  let h7 = 0x5be0cd19;
+  const w = new Array(64);
+
+  for (let offset = 0; offset < msg.length; offset += 64) {
+    for (let i = 0; i < 16; i++) {
+      const j = offset + i * 4;
+      w[i] = ((msg[j] << 24) | (msg[j + 1] << 16) | (msg[j + 2] << 8) | msg[j + 3]) >>> 0;
+    }
+    for (let i = 16; i < 64; i++) {
+      const s0 = (rotr32(w[i - 15], 7) ^ rotr32(w[i - 15], 18) ^ (w[i - 15] >>> 3)) >>> 0;
+      const s1 = (rotr32(w[i - 2], 17) ^ rotr32(w[i - 2], 19) ^ (w[i - 2] >>> 10)) >>> 0;
+      w[i] = (w[i - 16] + s0 + w[i - 7] + s1) >>> 0;
+    }
+
+    let a = h0, b = h1, c = h2, d = h3, e = h4, f = h5, g = h6, h = h7;
+    for (let i = 0; i < 64; i++) {
+      const S1 = (rotr32(e, 6) ^ rotr32(e, 11) ^ rotr32(e, 25)) >>> 0;
+      const ch = ((e & f) ^ (~e & g)) >>> 0;
+      const temp1 = (h + S1 + ch + SHA256_K[i] + w[i]) >>> 0;
+      const S0 = (rotr32(a, 2) ^ rotr32(a, 13) ^ rotr32(a, 22)) >>> 0;
+      const maj = ((a & b) ^ (a & c) ^ (b & c)) >>> 0;
+      const temp2 = (S0 + maj) >>> 0;
+      h = g;
+      g = f;
+      f = e;
+      e = (d + temp1) >>> 0;
+      d = c;
+      c = b;
+      b = a;
+      a = (temp1 + temp2) >>> 0;
+    }
+
+    h0 = (h0 + a) >>> 0;
+    h1 = (h1 + b) >>> 0;
+    h2 = (h2 + c) >>> 0;
+    h3 = (h3 + d) >>> 0;
+    h4 = (h4 + e) >>> 0;
+    h5 = (h5 + f) >>> 0;
+    h6 = (h6 + g) >>> 0;
+    h7 = (h7 + h) >>> 0;
+  }
+
+  return [h0, h1, h2, h3, h4, h5, h6, h7].map(hex32).join('');
+}
+
+const MD5_S = [
+  7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
+  5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
+  4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
+  6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,
+];
+const MD5_K = Array.from({ length: 64 }, (_, i) => Math.floor(Math.abs(Math.sin(i + 1)) * 2 ** 32) >>> 0);
+
+function md5Hex(bytes) {
+  const msg = paddedBytes(bytes, 64, 8, true);
+  let a0 = 0x67452301;
+  let b0 = 0xefcdab89;
+  let c0 = 0x98badcfe;
+  let d0 = 0x10325476;
+  const m = new Array(16);
+
+  for (let offset = 0; offset < msg.length; offset += 64) {
+    for (let i = 0; i < 16; i++) {
+      const j = offset + i * 4;
+      m[i] = (msg[j] | (msg[j + 1] << 8) | (msg[j + 2] << 16) | (msg[j + 3] << 24)) >>> 0;
+    }
+    let a = a0, b = b0, c = c0, d = d0;
+
+    for (let i = 0; i < 64; i++) {
+      let f, g;
+      if (i < 16) { f = (b & c) | (~b & d); g = i; }
+      else if (i < 32) { f = (d & b) | (~d & c); g = (5 * i + 1) % 16; }
+      else if (i < 48) { f = b ^ c ^ d; g = (3 * i + 5) % 16; }
+      else { f = c ^ (b | ~d); g = (7 * i) % 16; }
+      f = (f + a + MD5_K[i] + m[g]) >>> 0;
+      a = d;
+      d = c;
+      c = b;
+      b = (b + rotl32(f, MD5_S[i])) >>> 0;
+    }
+
+    a0 = (a0 + a) >>> 0;
+    b0 = (b0 + b) >>> 0;
+    c0 = (c0 + c) >>> 0;
+    d0 = (d0 + d) >>> 0;
+  }
+
+  const out = new Uint8Array(16);
+  for (const [i, word] of [a0, b0, c0, d0].entries()) {
+    out[i * 4] = word & 0xff;
+    out[i * 4 + 1] = (word >>> 8) & 0xff;
+    out[i * 4 + 2] = (word >>> 16) & 0xff;
+    out[i * 4 + 3] = (word >>> 24) & 0xff;
+  }
+  return bytesToHex(out);
+}
+
+const MASK64 = (1n << 64n) - 1n;
+const SHA512_H0 = [
+  0x6a09e667f3bcc908n, 0xbb67ae8584caa73bn, 0x3c6ef372fe94f82bn, 0xa54ff53a5f1d36f1n,
+  0x510e527fade682d1n, 0x9b05688c2b3e6c1fn, 0x1f83d9abfb41bd6bn, 0x5be0cd19137e2179n,
+];
+const SHA512_K = [
+  0x428a2f98d728ae22n, 0x7137449123ef65cdn, 0xb5c0fbcfec4d3b2fn, 0xe9b5dba58189dbbcn,
+  0x3956c25bf348b538n, 0x59f111f1b605d019n, 0x923f82a4af194f9bn, 0xab1c5ed5da6d8118n,
+  0xd807aa98a3030242n, 0x12835b0145706fben, 0x243185be4ee4b28cn, 0x550c7dc3d5ffb4e2n,
+  0x72be5d74f27b896fn, 0x80deb1fe3b1696b1n, 0x9bdc06a725c71235n, 0xc19bf174cf692694n,
+  0xe49b69c19ef14ad2n, 0xefbe4786384f25e3n, 0x0fc19dc68b8cd5b5n, 0x240ca1cc77ac9c65n,
+  0x2de92c6f592b0275n, 0x4a7484aa6ea6e483n, 0x5cb0a9dcbd41fbd4n, 0x76f988da831153b5n,
+  0x983e5152ee66dfabn, 0xa831c66d2db43210n, 0xb00327c898fb213fn, 0xbf597fc7beef0ee4n,
+  0xc6e00bf33da88fc2n, 0xd5a79147930aa725n, 0x06ca6351e003826fn, 0x142929670a0e6e70n,
+  0x27b70a8546d22ffcn, 0x2e1b21385c26c926n, 0x4d2c6dfc5ac42aedn, 0x53380d139d95b3dfn,
+  0x650a73548baf63den, 0x766a0abb3c77b2a8n, 0x81c2c92e47edaee6n, 0x92722c851482353bn,
+  0xa2bfe8a14cf10364n, 0xa81a664bbc423001n, 0xc24b8b70d0f89791n, 0xc76c51a30654be30n,
+  0xd192e819d6ef5218n, 0xd69906245565a910n, 0xf40e35855771202an, 0x106aa07032bbd1b8n,
+  0x19a4c116b8d2d0c8n, 0x1e376c085141ab53n, 0x2748774cdf8eeb99n, 0x34b0bcb5e19b48a8n,
+  0x391c0cb3c5c95a63n, 0x4ed8aa4ae3418acbn, 0x5b9cca4f7763e373n, 0x682e6ff3d6b2b8a3n,
+  0x748f82ee5defb2fcn, 0x78a5636f43172f60n, 0x84c87814a1f0ab72n, 0x8cc702081a6439ecn,
+  0x90befffa23631e28n, 0xa4506cebde82bde9n, 0xbef9a3f7b2c67915n, 0xc67178f2e372532bn,
+  0xca273eceea26619cn, 0xd186b8c721c0c207n, 0xeada7dd6cde0eb1en, 0xf57d4f7fee6ed178n,
+  0x06f067aa72176fban, 0x0a637dc5a2c898a6n, 0x113f9804bef90daen, 0x1b710b35131c471bn,
+  0x28db77f523047d84n, 0x32caab7b40c72493n, 0x3c9ebe0a15c9bebcn, 0x431d67c49c100d4cn,
+  0x4cc5d4becb3e42b6n, 0x597f299cfc657e2an, 0x5fcb6fab3ad6faecn, 0x6c44198c4a475817n,
+];
+
+function rotr64(x, n) {
+  return ((x >> BigInt(n)) | (x << BigInt(64 - n))) & MASK64;
+}
+
+function shr64(x, n) {
+  return x >> BigInt(n);
+}
+
+function add64(...xs) {
+  let out = 0n;
+  for (const x of xs) out = (out + x) & MASK64;
+  return out;
+}
+
+function sha512Hex(bytes) {
+  const msg = paddedBytes(bytes, 128, 16);
+  const h = [...SHA512_H0];
+  const w = new Array(80).fill(0n);
+
+  for (let offset = 0; offset < msg.length; offset += 128) {
+    for (let i = 0; i < 16; i++) {
+      let word = 0n;
+      for (let j = 0; j < 8; j++) word = (word << 8n) | BigInt(msg[offset + i * 8 + j]);
+      w[i] = word;
+    }
+    for (let i = 16; i < 80; i++) {
+      const s0 = rotr64(w[i - 15], 1) ^ rotr64(w[i - 15], 8) ^ shr64(w[i - 15], 7);
+      const s1 = rotr64(w[i - 2], 19) ^ rotr64(w[i - 2], 61) ^ shr64(w[i - 2], 6);
+      w[i] = add64(w[i - 16], s0, w[i - 7], s1);
+    }
+
+    let [a, b, c, d, e, f, g, hh] = h;
+    for (let i = 0; i < 80; i++) {
+      const S1 = rotr64(e, 14) ^ rotr64(e, 18) ^ rotr64(e, 41);
+      const ch = (e & f) ^ (~e & g);
+      const temp1 = add64(hh, S1, ch, SHA512_K[i], w[i]);
+      const S0 = rotr64(a, 28) ^ rotr64(a, 34) ^ rotr64(a, 39);
+      const maj = (a & b) ^ (a & c) ^ (b & c);
+      const temp2 = add64(S0, maj);
+      hh = g;
+      g = f;
+      f = e;
+      e = add64(d, temp1);
+      d = c;
+      c = b;
+      b = a;
+      a = add64(temp1, temp2);
+    }
+
+    h[0] = add64(h[0], a);
+    h[1] = add64(h[1], b);
+    h[2] = add64(h[2], c);
+    h[3] = add64(h[3], d);
+    h[4] = add64(h[4], e);
+    h[5] = add64(h[5], f);
+    h[6] = add64(h[6], g);
+    h[7] = add64(h[7], hh);
+  }
+
+  return h.map((x) => x.toString(16).padStart(16, '0')).join('');
+}

package/lib/eyelang/index.mjs

@@ -0,0 +1,48 @@
+// Public JavaScript API surface for embedders and the browser playground.
+// The CLI imports the same parser, program, solver, and term primitives from here.
+export { Program, makeProgram } from './program.mjs';
+export { parseClauses, parseProgramText } from './parser.mjs';
+export { parseRdfClauses, rdfToEyelang, clausesToEyelang, rdfIri, rdfBlank, rdfLiteral, rdfTripleTerm, rdfGoal } from './rdf.mjs';
+export { Solver } from './solver.mjs';
+export * from './term.mjs';
+export { BuiltinRegistry, createDefaultRegistry, getDefaultRegistry } from './builtins/registry.mjs';
+
+import { Env, copyResolved, termIsGround, termToString } from './term.mjs';
+import { Program } from './program.mjs';
+import { Solver } from './solver.mjs';
+import { whyNoProof, whyProof } from './explain.mjs';
+import { getDefaultRegistry } from './builtins/registry.mjs';
+
+export function run(source, options = {}) {
+  const includeWhy = options.proof === true || options.why === true || options.explain === true;
+  const parseOptions = { ...options, sourceMetadata: includeWhy, markRecursive: includeWhy };
+  const program = source instanceof Program ? source : Program.parse(source, parseOptions);
+  const runOptions = options.registry ? options : { ...options, registry: getDefaultRegistry() };
+  const solver = new Solver(program, runOptions);
+  const output = [];
+  const goals = program.materializationGoals();
+  const materializedKeys = new Set(goals.map((goal) => `${goal.name}/${goal.arity}`));
+  const facts = program.sourceFactLines(materializedKeys);
+  const seen = new Set();
+  for (const goal of goals) {
+    solver.solutionsSeen = 0;
+    for (const env of solver.solve([goal], new Env(), 0)) {
+      const resolved = copyResolved(goal, env);
+      if (!termIsGround(resolved)) continue;
+      const line = `${termToString(resolved, new Env(), true)}.\n`;
+      if (facts.has(line) || seen.has(line)) continue;
+      seen.add(line);
+      output.push(line);
+      if (includeWhy) appendExplanation(output, program, resolved, runOptions.registry);
+    }
+  }
+  return { stdout: output.join(''), stats: solver.stats };
+}
+
+function appendExplanation(output, program, resolved, registry) {
+  const proof = whyProof(program, resolved, { registry });
+  output.push(proof.text);
+  if (!proof.ok) output.push(whyNoProof(resolved));
+}
+
+export * from './explain.mjs';