sibyl-system 1.3.4 → 1.3.6

package/dist/index.js

@@ -31989,27 +31989,46 @@ var LINEAGE_CHUNK = 256;
 var LINEAGE_SAMPLES = 32;
 var LINEAGE_UNION_RATIO = 0.6;
 var LINEAGE_MIN_WINDOWS = 3;
+var LINEAGE_FLOOR_MIN = 8;
+var LINEAGE_FLOOR_RATIO = 0.3;
 function sampleWindows(text) {
   const total = Math.floor(text.length / LINEAGE_CHUNK);
   if (total < LINEAGE_MIN_WINDOWS) return [];
-  const step = Math.max(1, Math.floor(total / LINEAGE_SAMPLES));
+  const step = Math.max(1, Math.ceil(total / LINEAGE_SAMPLES));
   const out = [];
-  for (let i = 0; i < total; i += step) out.push(text.slice(i * LINEAGE_CHUNK, (i + 1) * LINEAGE_CHUNK));
-  return out.slice(0, LINEAGE_SAMPLES);
+  for (let i = 0; i < total && out.length < LINEAGE_SAMPLES; i += step)
+    out.push(text.slice(i * LINEAGE_CHUNK, (i + 1) * LINEAGE_CHUNK));
+  return out;
 }
 function beginLineage(artifact) {
   if (artifact.kind !== "path" || artifact.mtimeMs === void 0) return null;
-  const chunks = sampleWindows(artifact.text);
+  return lineageFrom(artifact.text, artifact.mtimeMs);
+}
+function lineageFrom(text, mtimeMs) {
+  const chunks = sampleWindows(text);
   if (chunks.length < LINEAGE_MIN_WINDOWS) return null;
+  const unique = new Set(chunks).size;
   return {
     chunks,
-    need: Math.max(2, Math.ceil(chunks.length * LINEAGE_UNION_RATIO)),
-    mtimeMs: artifact.mtimeMs,
+    unique,
+    need: Math.max(2, Math.ceil(unique * LINEAGE_UNION_RATIO)),
+    mtimeMs,
     matched: /* @__PURE__ */ new Map(),
     copiedAfterMtime: 0,
     timeless: 0
   };
 }
+function lineageConvinced(lg) {
+  const n = lg.matched.size;
+  return n >= lg.need || n >= LINEAGE_FLOOR_MIN && n >= Math.ceil(lg.unique * LINEAGE_FLOOR_RATIO);
+}
+function creditWindows(lg, cands, label) {
+  for (const cand of cands) {
+    for (const chunk of lg.chunks) {
+      if (!lg.matched.has(chunk) && cand.includes(chunk)) lg.matched.set(chunk, label);
+    }
+  }
+}
 function messageTime(m) {
   const t = m.info?.time?.created;
   return typeof t === "number" ? t : void 0;
@@ -32027,7 +32046,8 @@ function partCandidates(p) {
 }
 function lineageVerdict(lg, artifact) {
   const sources = [.../* @__PURE__ */ new Set([...lg.matched.values()])].slice(0, 3).join("; ");
-  return `content-lineage evidence: ${String(lg.matched.size)} of ${String(lg.chunks.length)} verbatim ${String(LINEAGE_CHUNK)}-byte windows of ${artifact.source} appear in convener-chain tool inputs that predate its mtime (${sources}) \u2014 the chain authored this artifact's bytes before/independently of this path`;
+  const majority = lg.matched.size >= lg.need;
+  return `content-lineage evidence: ${String(lg.matched.size)} of ${String(lg.unique)} DISTINCT verbatim ${String(LINEAGE_CHUNK)}-byte windows of ${artifact.source} appear in convener-chain tool inputs that predate its mtime (${sources}) \u2014 ${majority ? "majority" : "absolute floor"} of drafting; repeated identical windows counted once`;
 }
 function scanMessages(rows, convenerIndex, sid, artifact, lg) {
   for (const [mi, m] of rows.entries()) {
@@ -32054,14 +32074,13 @@ function scanMessages(rows, convenerIndex, sid, artifact, lg) {
           continue;
         }
         const label = `${p.tool ?? "tool"}@${sid}:${String(mi)}`;
-        for (const cand of partCandidates(p)) {
+        const cands = partCandidates(p);
+        for (const cand of cands) {
           if (artifact.kind === "path" && cand.includes(artifact.text.trim())) {
-            return `${lineageVerdict({ ...lg, matched: /* @__PURE__ */ new Map([[0, label]]) }, artifact)}; full-text containment in ${label}`;
-          }
-          for (const [wi, chunk] of lg.chunks.entries()) {
-            if (!lg.matched.has(wi) && cand.includes(chunk)) lg.matched.set(wi, label);
+            return `content-lineage evidence: the FULL text of ${artifact.source} appears verbatim in ${label} (convener-chain tool input, before the file's mtime) \u2014 the chain wrote these bytes elsewhere and moved them here; the chain cannot sit on both sides of this ballot`;
           }
         }
+        creditWindows(lg, cands, label);
       }
     }
   }
@@ -32116,7 +32135,7 @@ async function assessIndependence(client, directory, convenerSessionID, artifact
       return { status: "NOT-INDEPENDENT", convenerChain: chain, evidence: hit };
     }
   }
-  if (lg !== null && lg.matched.size >= lg.need) {
+  if (lg !== null && lineageConvinced(lg)) {
     return { status: "NOT-INDEPENDENT", convenerChain: chain, evidence: lineageVerdict(lg, artifact) };
   }
   if (scanFailed.length > 0 || walkIncomplete) {
@@ -32133,7 +32152,9 @@ async function assessIndependence(client, directory, convenerSessionID, artifact
 }
 function lineageFaceNote(lg) {
   if (lg === null) return "";
-  const parts = [`${String(lg.matched.size)}/${String(lg.chunks.length)} lineage windows matched (need ${String(lg.need)})`];
+  const parts = [
+    `${String(lg.matched.size)}/${String(lg.unique)} distinct lineage windows matched (majority need ${String(lg.need)}, floor ${String(LINEAGE_FLOOR_MIN)}@${String(LINEAGE_FLOOR_RATIO * 100)}%)`
+  ];
   if (lg.copiedAfterMtime > 0) parts.push(`${String(lg.copiedAfterMtime)} part(s) excluded as post-mtime copies`);
   if (lg.timeless > 0) parts.push(`${String(lg.timeless)} part(s) lacked timestamps`);
   return `; content-lineage: ${parts.join(", ")}`;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "sibyl-system",
-  "version": "1.3.4",
+  "version": "1.3.6",
   "license": "MIT",
   "type": "module",
   "description": "Sibyl-System: democratic-centralism review chamber (one conclusion, one voice) + fail-closed council voting + dynamic swarm plugin for OpenCode",