@lmzhen/dsh-evolution-feedback 0.3.66 → 0.3.68

package/lib/index.js

@@ -48,11 +48,16 @@ var EvolutionFeedback = class EvolutionFeedback {
 	durableNote = /* @__PURE__ */ new Map();
 	/** P2-32 (v11): process-level bound — every feedbacked session would
 	* otherwise keep one entry for the whole process lifetime (a name + note
-	* string per session); cap both maps and drop the oldest on overflow. */
+	* string per session); cap this map and drop the earliest-INSERTED entry on
+	* overflow (Map iteration order is insertion order, and re-setting an
+	* existing key does not refresh its position, so the eviction is FIFO rather
+	* than least-recently-used). `warnedMessages` carries the same bound through
+	* `WARNED_CAP` below. */
 	static NOTE_CAP = 512;
 	/** V5-32 (0.3.31): fire-and-forget append failures are warn-once per unique
 	* message — a persistent refusal (e.g. a future-version log) must not spam
-	* the log on every user feedback entry (family posture: process-level once). */
+	* the log on every user feedback entry (family posture: process-level once).
+	* Bounded like `durableNote`, with the same FIFO eviction. */
 	warnedMessages = /* @__PURE__ */ new Set();
 	WARNED_CAP = 512;
 	/** V5-29 (0.3.31): invoked after a FAILED append rolled back, so a caller
@@ -86,7 +91,7 @@ var EvolutionFeedback = class EvolutionFeedback {
 			const rawEvents = await io.readText(eventsPath);
 			const archiveNames = await listEventArchives(io, eventsPath);
 			if ((rawEvents === null || rawEvents.trim() === "") && archiveNames.length === 0) {
-				const aggregate = parseAggregate(await io.readText(path));
+				const aggregate = parseAggregate(await io.readText(path), this.warn);
 				if (aggregate) try {
 					await migrateFeedbackEvents(io, eventsPath, aggregate);
 				} catch {}
@@ -293,13 +298,34 @@ async function migrateFeedbackEvents(io, eventsPath, aggregate) {
 		}, null, 2));
 	});
 }
-/** Parse a legacy aggregate (v1) or a v2 cache into a plain aggregate state. */
-function parseAggregate(raw) {
+/** Parse a legacy aggregate (v1) or a v2 cache into a plain aggregate state.
+* V24-05 (v24): every record passes the shared per-record sanitizer (same
+* validation as `parseCache` — S6.4), and migrated counts are clamped so one
+* corrupted field cannot expand into an unbounded event array at boot. */
+const MAX_MIGRATED_EVENTS_PER_RECORD = 1e4;
+function parseAggregate(raw, warn = () => {}) {
 	if (raw === null) return null;
 	try {
 		const parsed = JSON.parse(raw);
-		const skills = isRecord(parsed.skills) ? parsed.skills : void 0;
-		const sessions = isRecord(parsed.sessions) ? parsed.sessions : void 0;
+		const clamp = (count, target, field) => {
+			if (count > MAX_MIGRATED_EVENTS_PER_RECORD) {
+				warn(`evolution-feedback: migration clamps ${field}=${count} for "${target}" to ${MAX_MIGRATED_EVENTS_PER_RECORD} — the on-disk aggregate is not trustworthy at that scale`);
+				return MAX_MIGRATED_EVENTS_PER_RECORD;
+			}
+			return count;
+		};
+		const sanitizeSection = (section, kind) => {
+			if (!isRecord(section)) return void 0;
+			const cleaned = sanitizeCacheRecords(section, kind, warn);
+			for (const [target, record] of Object.entries(cleaned)) if (record.positive > MAX_MIGRATED_EVENTS_PER_RECORD || record.negative > MAX_MIGRATED_EVENTS_PER_RECORD) cleaned[target] = {
+				...record,
+				positive: clamp(record.positive, target, "positive"),
+				negative: clamp(record.negative, target, "negative")
+			};
+			return cleaned;
+		};
+		const skills = sanitizeSection(parsed.skills, "skill");
+		const sessions = sanitizeSection(parsed.sessions, "session");
 		if (!skills && !sessions) return null;
 		return {
 			skills: skills ?? {},

package/lib/types/index.d.ts

@@ -52,11 +52,16 @@ export declare class EvolutionFeedback {
     private readonly durableNote;
     /** P2-32 (v11): process-level bound — every feedbacked session would
      * otherwise keep one entry for the whole process lifetime (a name + note
-     * string per session); cap both maps and drop the oldest on overflow. */
+     * string per session); cap this map and drop the earliest-INSERTED entry on
+     * overflow (Map iteration order is insertion order, and re-setting an
+     * existing key does not refresh its position, so the eviction is FIFO rather
+     * than least-recently-used). `warnedMessages` carries the same bound through
+     * `WARNED_CAP` below. */
     private static readonly NOTE_CAP;
     /** V5-32 (0.3.31): fire-and-forget append failures are warn-once per unique
      * message — a persistent refusal (e.g. a future-version log) must not spam
-     * the log on every user feedback entry (family posture: process-level once). */
+     * the log on every user feedback entry (family posture: process-level once).
+     * Bounded like `durableNote`, with the same FIFO eviction. */
     private readonly warnedMessages;
     private readonly WARNED_CAP;
     /** V5-29 (0.3.31): invoked after a FAILED append rolled back, so a caller

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@lmzhen/dsh-evolution-feedback",
   "description": "Feedback-to-quality scoring for self-evolution (community build)",
-  "version": "0.3.66",
+  "version": "0.3.68",
   "publishConfig": {
     "access": "public"
   },
@@ -31,18 +31,18 @@
   "license": "MIT",
   "dependencies": {
     "@deepseek-ai/schemastery": "^3.18.1",
-    "@lmzhen/dsh-evolution-core": "^0.3.66"
+    "@lmzhen/dsh-evolution-core": "^0.3.68"
   },
   "peerDependencies": {
     "@deepseek-ai/dsh-invariants": "^0.1.1-rc.2",
     "@deepseek-ai/cordis": "^4.0.1",
-    "@lmzhen/dsh-evolution-io": "^0.3.66",
-    "@lmzhen/dsh-skill-usage": "^0.3.66"
+    "@lmzhen/dsh-evolution-io": "^0.3.68",
+    "@lmzhen/dsh-skill-usage": "^0.3.68"
   },
   "devDependencies": {
     "@deepseek-ai/dsh-invariants": "^0.1.1-rc.2",
-    "@lmzhen/dsh-evolution-io": "^0.3.66",
-    "@lmzhen/dsh-evolution-io-node": "^0.3.66",
-    "@lmzhen/dsh-skill-usage": "^0.3.66"
+    "@lmzhen/dsh-evolution-io": "^0.3.68",
+    "@lmzhen/dsh-evolution-io-node": "^0.3.68",
+    "@lmzhen/dsh-skill-usage": "^0.3.68"
   }
 }