qlogicagent 2.18.3 → 2.18.5

package/dist/types/skills/memory/local-store.d.ts

@@ -12,7 +12,7 @@
  *   - memories_fts: FTS5 full-text index for keyword search
  *   - profiles: user profile KV (future)
  */
-import type { MemoryAtlasResult, MemoryClaimInput, MemoryClaimRecord, MemoryClaimStatus, MemoryConflictRecord, MemoryInsertInput, MemoryObservationInput, MemoryProposalInput, MemoryProposalStatus, MemoryRecord, MemorySearchHit, MemoryUpdateInput, SqliteDatabase } from "./local-store-records.js";
+import type { MemoryAtlasResult, MemoryClaimInput, MemoryClaimRecord, MemoryClaimStatus, MemoryConflictRecord, MemoryInsertInput, MemoryObservationInput, MemoryProposalInput, MemoryProposalRecord, MemoryProposalStatus, MemoryRecord, MemorySearchHit, MemoryUpdateInput, SqliteDatabase } from "./local-store-records.js";
 export { resolveMemoryDbPath } from "./memory-db-path.js";
 export type { MemoryAtlasBucket, MemoryAtlasCluster, MemoryAtlasResult, MemoryAtlasWindowCursor, MemoryAttachmentRef, MemoryClaimInput, MemoryClaimRecord, MemoryClaimStatus, MemoryConflictRecord, MemoryInsertInput, MemoryObservationInput, MemoryObservationRecord, MemoryProposalInput, MemoryProposalRecord, MemoryProposalStatus, MemoryRecord, MemorySearchHit, MemorySourceKind, MemoryUpdateInput, SqliteDatabase, SqliteStatement, } from "./local-store-records.js";
 /** Full attachment index row (DB-backed; file bytes live on disk under the attachments dir). */
@@ -41,7 +41,11 @@ export interface MemoryAttachmentInsert {
 }
 export declare class LocalMemoryStore {
     private db;
+    /** Stamped onto rows whose embedding arrives without explicit provenance
+     * (the consolidation pipeline passes bare vectors). Set by the provider. */
+    private defaultEmbeddingModel;
     constructor(db: SqliteDatabase);
+    setDefaultEmbeddingModel(model: string): void;
     private initSchema;
     /**
      * Insert a new memory record. Returns the generated ID.
@@ -51,19 +55,50 @@ export declare class LocalMemoryStore {
      * Full-text search using FTS5. Returns ranked results.
      */
     searchFts(query: string, userId: string, limit?: number): MemorySearchHit[];
+    /** One-shot flag: embedding provenance mismatches are traced once per store instance. */
+    private embeddingMismatchLogged;
     /**
      * Vector similarity search using pre-computed embeddings.
      * Performs brute-force cosine similarity (efficient for <100k records per user).
+     *
+     * Rows whose embedding provenance (dims, and model when both sides are known)
+     * differs from the query's are SKIPPED, not scored: cosine between vectors of
+     * different models/dims is numeric noise, and truncated dot products silently
+     * corrupt ranking. Legacy rows (no provenance columns) are accepted when their
+     * dimension happens to match — dropping them all would blank historical recall.
      */
-    searchVector(queryEmbedding: Float32Array, userId: string, limit?: number, minScore?: number): MemorySearchHit[];
+    searchVector(queryEmbedding: Float32Array, userId: string, limit?: number, minScore?: number, expectedModel?: string): MemorySearchHit[];
     /**
-     * Hybrid search: FTS5 + vector similarity, de-duplicated and merged.
-     */
-    searchHybrid(query: string, queryEmbedding: Float32Array | null, userId: string, limit?: number): MemorySearchHit[];
+     * Hybrid search: FTS5 + vector similarity, fused by rank-tempered RRF.
+     *
+     * Two currencies, each carrying signal the other cannot:
+     *   - channel scores (0-1, isomorphic across FTS/vector) carry MAGNITUDE —
+     *     an exact lexical hit must beat weak-consensus noise, which pure rank
+     *     fusion cannot guarantee (rank ignores how strong a match is);
+     *   - reciprocal ranks carry CONSENSUS and are scale-invariant — as the
+     *     store grows, BM25 inflates until squashed top scores compress to
+     *     near-ties and the two channels' score distributions drift apart;
+     *     ranks keep differentiating where magnitudes saturate.
+     * fused = (1-w)*magnitude + w*rrfNorm keeps both properties. Magnitude of a
+     * dual hit is the stronger channel plus a fraction of the weaker (consensus
+     * also rewarded in score space); rrfNorm is the reciprocal-rank sum
+     * normalized so a dual #1 hit = 1.0. FTS ranks follow BM25 order, vector
+     * ranks follow the blended channel order — each channel's own relevance
+     * ordering. Rows found by FTS only (e.g. no embedding) compete in the same
+     * fused domain and remain reachable, not buried.
+     */
+    searchHybrid(query: string, queryEmbedding: Float32Array | null, userId: string, limit?: number, expectedModel?: string): MemorySearchHit[];
     /**
      * Get all memories for a user (paginated).
      */
     listByUser(userId: string, page?: number, pageSize?: number, activeOnly?: boolean): MemoryRecord[];
+    /**
+     * All active memories carrying a tag (LIKE match on the quoted JSON-array
+     * element). Tag consumers (resident refresh / onboarding replace-purge) need
+     * the COMPLETE tag set regardless of age — the windowed atlas read silently
+     * truncated them once history outgrew one page/time window.
+     */
+    listByTag(userId: string, tag: string, limit?: number): MemoryRecord[];
     /**
      * Return a windowed atlas payload for large-history visualization.
      *
@@ -89,7 +124,7 @@ export declare class LocalMemoryStore {
     /**
      * Update memory text and bump updatedAt.
      */
-    updateText(id: string, text: string, embedding?: Float32Array): boolean;
+    updateText(id: string, text: string, embedding?: Float32Array, embeddingModel?: string): boolean;
     /**
      * Update editable memory fields and bump updatedAt.
      */
@@ -120,6 +155,25 @@ export declare class LocalMemoryStore {
      * Memories written by the agent but never recalled are likely noise.
      */
     decayNoiseArchival(userId: string, minAgeDays?: number, maxImportance?: number): number;
+    /**
+     * Observation retention: memory_observations is an append-only audit trail
+     * (every propose/commit writes one) with NO reader of its own — without a
+     * retention window it grows forever, the same disease the proposals table
+     * had before the consumer existed. Delete rows older than the window that
+     * are NOT referenced by any claim's evidence_ids or proposal's
+     * observation_ids (referenced rows are live audit evidence and stay).
+     */
+    decayObservations(userId: string, retentionDays?: number): number;
+    /**
+     * Resolved-proposal retention: terminal rows (accepted/merged/rejected/
+     * expired) are processing history, not memory — past the window they only
+     * grow the table. Rows carrying an idempotency_key are KEPT FOREVER: they
+     * are the crash-safe ledger that stops feedback distillation from
+     * re-proposing the same evidence cluster (deleting them would re-open the
+     * exact duplicate-write hole the key exists to close). Pending rows are
+     * never touched here — the consumer owns their TTL (status=expired).
+     */
+    decayResolvedProposals(userId: string, retentionDays?: number): number;
     /**
      * Run all decay strategies. Returns total affected count.
      */
@@ -196,23 +250,34 @@ export declare class LocalMemoryStore {
             date: string;
         }>;
     };
-    /**
-     * Find memories related to a specific event date (±tolerance).
-     * Used for temporal context retrieval, such as finding memories around a requested date.
-     */
-    findByEventDate(userId: string, targetDate: string, toleranceDays?: number): MemorySearchHit[];
     /**
      * Record an access (for importance/relevance boosting).
      */
     recordAccess(id: string): void;
+    /** Total active memory rows across ALL users (health reporting). */
+    countAll(): number;
     /**
      * Get total memory count for a user.
      */
     count(userId: string, activeOnly?: boolean): number;
     /**
-     * Delete all memories for a user.
-     */
-    resetUser(userId: string): number;
+     * Delete ALL long-term memory state for a user — every table, not just
+     * `memories`. Claims carry entity/predicate/value facts in clear text and
+     * observations carry raw conversation excerpts; leaving them behind after a
+     * "clear my memory" is a broken privacy promise, not a smaller reset.
+     *
+     * Returns the attachment rel_paths so the caller can delete the on-disk
+     * files (the store only owns the index rows).
+     */
+    resetUser(userId: string): {
+        memories: number;
+        observations: number;
+        proposals: number;
+        claims: number;
+        conflicts: number;
+        profiles: number;
+        attachmentRelPaths: string[];
+    };
     /**
      * Run SQLite VACUUM to reclaim space after deletions/archival.
      * Should be called periodically (e.g. after decay cycles).
@@ -228,10 +293,13 @@ export declare class LocalMemoryStore {
         freePages: number;
     };
     /**
-     * Export archived memories as JSONL (for cold storage / backup).
-     * Deletes exported records from the database to reclaim space.
+     * List the oldest archived memories for cold-storage export. Read-only:
+     * purging is a SEPARATE step (purgeMemoriesByIds) the caller performs only
+     * after the export has durably landed on disk. The old fused
+     * export-then-delete shape destroyed data whenever the caller dropped the
+     * return value.
      */
-    exportAndPurgeArchived(userId: string, maxExport?: number): Array<{
+    listArchivedForExport(userId: string, maxExport?: number): Array<{
         id: string;
         text: string;
         category: string;
@@ -240,6 +308,8 @@ export declare class LocalMemoryStore {
         archivedAt: number;
         tags: string[];
     }>;
+    /** Physically delete memory rows by id (post-export purge step). */
+    purgeMemoriesByIds(ids: string[]): number;
     /**
      * Enforce capacity limit: if active memories exceed maxCount,
      * archive the oldest lowest-importance ones.
@@ -253,6 +323,15 @@ export declare class LocalMemoryStore {
      * a duplicate crash-safely (the key survives a worker restart mid-sweep).
      */
     findProposalByIdempotencyKey(userId: string, idempotencyKey: string): string | null;
+    /**
+     * List proposals by status (oldest first) — the read side of the proposal
+     * consumer. Pending proposals from implicit-extract / feedback / dream used
+     * to have NO reader at all: they accumulated forever and never became
+     * searchable memories.
+     */
+    listProposalsByStatus(userId: string, status: MemoryProposalStatus, limit?: number): MemoryProposalRecord[];
+    /** Bulk status transition for the proposal consumer (corroborated / expired). */
+    markProposalsStatus(ids: string[], status: MemoryProposalStatus): number;
     updateProposalStatus(id: string, status: MemoryProposalStatus, relatedClaimIds?: string[]): boolean;
     insertClaim(input: MemoryClaimInput): string;
     listClaims(userId: string, statuses?: MemoryClaimStatus[]): MemoryClaimRecord[];

package/dist/types/skills/memory/memdir.d.ts

@@ -1,4 +1,4 @@
-/** Max bytes (UTF-8) for INDEX.md to inject into system prompt (CC uses 25KB, we use 12KB). */
+/** Max bytes (UTF-8) for INDEX.md to inject into system prompt. */
 export declare const INDEX_MAX_CHARS = 12288;
 /** Max lines for INDEX.md injection. */
 export declare const INDEX_MAX_LINES = 200;
@@ -11,7 +11,7 @@ export declare function getIndexPath(projectRoot: string): string;
 /** Global-layer size budget: a cheat-sheet, not a memory store. */
 export declare const USER_INDEX_MAX_CHARS = 2048;
 export declare const USER_INDEX_MAX_LINES = 40;
-/** Full path to the user-level global INDEX.md (QLOGICAGENT_HOME aware). */
+/** Full path to the user-level global INDEX.md (owner profile scoped). */
 export declare function getUserIndexPath(): string;
 /** Read the global layer for prompt injection, capped by the cheat-sheet budget.
  * Returns null when absent/empty — the section simply doesn't render. */
@@ -33,10 +33,9 @@ export interface MemdirResult {
     /** Current INDEX.md char usage */
     indexUsage?: string;
 }
-export declare function isMemoryContentSafe(text: string): boolean;
+export { isMemoryContentSafe } from "./memory-tool.js";
 export declare class Memdir {
     private readonly root;
-    private indexCache;
     constructor(projectRoot: string);
     /** Get the root directory path of this MEMDIR. */
     getRootPath(): string;
@@ -88,7 +87,12 @@ export declare class Memdir {
     }>;
     /** Delete a topic file. INDEX.md cannot be deleted. */
     deleteFile(name: string): Promise<MemdirResult>;
-    /** Search all memory files for keyword matches. Returns matching snippets. */
+    /**
+     * Search all memory files for keyword matches. Returns matching snippets.
+     * Tokenization shares fts-segment (latin words + CJK bigrams) with the L2
+     * keyword index — the old whitespace split treated a whole Chinese sentence
+     * as one "word", so multi-term Chinese queries scored all-or-nothing.
+     */
     searchLocal(query: string): Promise<Array<{
         file: string;
         snippet: string;
@@ -97,6 +101,12 @@ export declare class Memdir {
     private writeIndex;
     private writeIndexUnlocked;
     private ensureDir;
-    /** Append an entry to the file listing section of INDEX.md (idempotent). */
+    /**
+     * Append an entry to the file listing section of INDEX.md (idempotent).
+     * Returns whether the entry is present afterwards. On overflow it first
+     * tries the same auto-compaction as addToIndex; a false return means the
+     * file exists but is INVISIBLE to recall — callers must surface that
+     * (the old behavior skipped silently and quietly orphaned topic files).
+     */
     private appendIndexEntry;
 }

package/dist/types/skills/memory/memory-consolidation.d.ts

@@ -54,4 +54,11 @@ export declare class MemoryConsolidator {
      */
     private findNearDuplicateMemory;
 }
+/** Containment threshold above which two texts count as the same memory.
+ * Exported: the proposal consumer uses the SAME bar to group same-fact proposals. */
+export declare const NEAR_DUPLICATE_CONTAINMENT = 0.82;
+/** Latin/digit words plus CJK character bigrams from normalized text. */
+export declare function dedupTokens(text: string): Set<string>;
+/** True when either side has a digit-bearing token the other side lacks. */
+export declare function digitTokensDiffer(a: Set<string>, b: Set<string>): boolean;
 export declare function sourcePriorityOf(source: string): number;

package/dist/types/skills/memory/proposal-consumer.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Proposal consumer (P0 — the factual-memory half of the promotion ladder).
+ *
+ * implicit-extract / feedback-distillation / dream all write PROPOSALS
+ * (status=pending). Before this module existed nothing ever read them back:
+ * the three automatic learning paths burned model calls writing dead rows.
+ *
+ * Trust ladder — evidence gates autonomy, mirroring the V3 skill-promotion
+ * doctrine (automatic only when the data says so; visible; revertible):
+ *   - CORROBORATED: the same fact proposed >=2 times from independent
+ *     contexts (different session, or different source) -> auto-commit as
+ *     source "corroborated" (priority 70, so it actually becomes an active
+ *     searchable memory — committing with the original implicit-extract
+ *     priority 40 would just create another pending claim, i.e. the black
+ *     hole one level deeper).
+ *   - feedback-distillation proposals commit ALONE: their >=2-evidence bar
+ *     was already enforced upstream (MIN_EVIDENCE + idempotency key, §10).
+ *   - dream-tier sources (priority <= 20) never commit alone; they only
+ *     corroborate facts seen elsewhere.
+ *   - Everything else waits, and past the TTL flips to status "expired" —
+ *     a visible terminal state, not a silent delete; the memory surface can
+ *     still show expired proposals for manual rescue.
+ *
+ * Pure planning logic — no I/O; the provider executes the plan.
+ */
+import type { MemoryProposalRecord } from "./local-store-records.js";
+import type { ExtractedMemoryItem } from "./memory-consolidation.js";
+/** Uncorroborated proposals older than this flip to "expired". */
+export declare const PROPOSAL_TTL_MS: number;
+/** Independent contexts required for auto-commit. */
+export declare const PROPOSAL_MIN_CORROBORATION = 2;
+/** Idle-pass work cap; the rest stays pending for the next pass. */
+export declare const PROPOSAL_MAX_COMMITS_PER_PASS = 20;
+/** Source stamped on corroborated commits — registered in sourcePriorityOf. */
+export declare const CORROBORATED_SOURCE = "corroborated";
+export interface ProposalCommitGroup {
+    proposalIds: string[];
+    item: ExtractedMemoryItem;
+    /** Source used for the commit (drives claim authority). */
+    source: string;
+}
+export interface ProposalConsumptionSummary {
+    commitGroups: ProposalCommitGroup[];
+    expiredIds: string[];
+}
+export interface ProposalConsumptionOptions {
+    now?: number;
+    ttlMs?: number;
+    maxCommitsPerPass?: number;
+}
+export declare function planProposalConsumption(pending: readonly MemoryProposalRecord[], opts?: ProposalConsumptionOptions): ProposalConsumptionSummary;

package/dist/types/skills/memory/sqlite-memory-mappers.d.ts

@@ -1,6 +1,7 @@
-import type { MemoryClaimRecord, MemoryConflictRecord, MemoryRecord } from "./local-store-records.js";
+import type { MemoryClaimRecord, MemoryConflictRecord, MemoryProposalRecord, MemoryRecord } from "./local-store-records.js";
 export declare function rowToRecord(row: unknown): MemoryRecord;
 export declare function rowToClaimRecord(row: unknown): MemoryClaimRecord;
+export declare function rowToProposalRecord(row: unknown): MemoryProposalRecord;
 export declare function rowToConflictRecord(row: unknown): MemoryConflictRecord;
 export declare function parseJsonObject(raw: unknown): Record<string, unknown>;
 export declare function parseJsonArray(raw: unknown): string[];

package/dist/types/skills/memory/sqlite-memory-schema.d.ts

@@ -1,3 +1,11 @@
 import type { SqliteDatabase } from "./local-store-records.js";
-export declare const MEMORY_SCHEMA_SQL = "\nCREATE TABLE IF NOT EXISTS memories (\n  id TEXT PRIMARY KEY,\n  text TEXT NOT NULL,\n  user_id TEXT NOT NULL,\n  category TEXT NOT NULL DEFAULT 'general',\n  importance REAL NOT NULL DEFAULT 0.5,\n  confidence REAL NOT NULL DEFAULT 1.0,\n  source TEXT NOT NULL DEFAULT 'agent',\n  session_id TEXT NOT NULL DEFAULT '',\n  event_date TEXT NOT NULL DEFAULT '',\n  tags TEXT NOT NULL DEFAULT '[]',\n  embedding BLOB,\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL,\n  access_count INTEGER NOT NULL DEFAULT 0,\n  last_accessed_at INTEGER NOT NULL DEFAULT 0,\n  is_archived INTEGER NOT NULL DEFAULT 0\n);\n\nCREATE INDEX IF NOT EXISTS idx_memories_user ON memories(user_id);\nCREATE INDEX IF NOT EXISTS idx_memories_user_category ON memories(user_id, category);\nCREATE INDEX IF NOT EXISTS idx_memories_user_importance ON memories(user_id, importance DESC);\nCREATE INDEX IF NOT EXISTS idx_memories_created ON memories(created_at DESC);\n\nCREATE TABLE IF NOT EXISTS memory_observations (\n  id TEXT PRIMARY KEY,\n  user_id TEXT NOT NULL,\n  text TEXT NOT NULL,\n  source TEXT NOT NULL,\n  source_priority INTEGER NOT NULL DEFAULT 0,\n  session_id TEXT NOT NULL DEFAULT '',\n  evidence_type TEXT NOT NULL DEFAULT 'text',\n  payload TEXT NOT NULL DEFAULT '{}',\n  created_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_observations_user_created ON memory_observations(user_id, created_at DESC);\nCREATE INDEX IF NOT EXISTS idx_memory_observations_source ON memory_observations(user_id, source);\n\nCREATE TABLE IF NOT EXISTS memory_proposals (\n  id TEXT PRIMARY KEY,\n  user_id TEXT NOT NULL,\n  observation_ids TEXT NOT NULL DEFAULT '[]',\n  text TEXT NOT NULL,\n  category TEXT NOT NULL DEFAULT 'general',\n  importance REAL NOT NULL DEFAULT 0.5,\n  confidence REAL NOT NULL DEFAULT 0.5,\n  source TEXT NOT NULL DEFAULT 'agent',\n  source_priority INTEGER NOT NULL DEFAULT 0,\n  entity TEXT NOT NULL DEFAULT '',\n  predicate TEXT NOT NULL DEFAULT '',\n  value_json TEXT NOT NULL DEFAULT '{}',\n  valid_time TEXT NOT NULL DEFAULT '',\n  tags TEXT NOT NULL DEFAULT '[]',\n  status TEXT NOT NULL DEFAULT 'pending',\n  related_claim_ids TEXT NOT NULL DEFAULT '[]',\n  idempotency_key TEXT,\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_proposals_user_status ON memory_proposals(user_id, status);\nCREATE INDEX IF NOT EXISTS idx_memory_proposals_fact ON memory_proposals(user_id, entity, predicate, valid_time);\n\nCREATE TABLE IF NOT EXISTS memory_claims (\n  id TEXT PRIMARY KEY,\n  memory_id TEXT NOT NULL DEFAULT '',\n  user_id TEXT NOT NULL,\n  entity TEXT NOT NULL DEFAULT '',\n  predicate TEXT NOT NULL DEFAULT '',\n  value_json TEXT NOT NULL DEFAULT '{}',\n  text TEXT NOT NULL,\n  category TEXT NOT NULL DEFAULT 'general',\n  importance REAL NOT NULL DEFAULT 0.5,\n  confidence REAL NOT NULL DEFAULT 0.5,\n  source TEXT NOT NULL DEFAULT 'agent',\n  source_priority INTEGER NOT NULL DEFAULT 0,\n  status TEXT NOT NULL DEFAULT 'active',\n  valid_time TEXT NOT NULL DEFAULT '',\n  evidence_ids TEXT NOT NULL DEFAULT '[]',\n  supersedes_claim_id TEXT NOT NULL DEFAULT '',\n  conflict_group_id TEXT NOT NULL DEFAULT '',\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_claims_user_status ON memory_claims(user_id, status);\nCREATE INDEX IF NOT EXISTS idx_memory_claims_memory ON memory_claims(memory_id);\nCREATE INDEX IF NOT EXISTS idx_memory_claims_fact ON memory_claims(user_id, entity, predicate, valid_time);\n\nCREATE TABLE IF NOT EXISTS memory_conflicts (\n  id TEXT PRIMARY KEY,\n  user_id TEXT NOT NULL,\n  claim_a_id TEXT NOT NULL,\n  claim_b_id TEXT NOT NULL,\n  reason TEXT NOT NULL,\n  status TEXT NOT NULL DEFAULT 'open',\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_conflicts_user_status ON memory_conflicts(user_id, status);\n\nCREATE TABLE IF NOT EXISTS memory_attachments (\n  id TEXT PRIMARY KEY,\n  memory_id TEXT NOT NULL DEFAULT '',\n  user_id TEXT NOT NULL,\n  kind TEXT NOT NULL DEFAULT 'file',\n  filename TEXT NOT NULL DEFAULT '',\n  mime_type TEXT NOT NULL DEFAULT '',\n  size INTEGER NOT NULL DEFAULT 0,\n  rel_path TEXT NOT NULL,\n  extracted_text TEXT NOT NULL DEFAULT '',\n  created_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_attachments_memory ON memory_attachments(memory_id);\nCREATE INDEX IF NOT EXISTS idx_memory_attachments_orphan ON memory_attachments(user_id, memory_id, created_at);\n\nCREATE VIRTUAL TABLE IF NOT EXISTS memories_fts USING fts5(\n  id UNINDEXED,\n  user_id UNINDEXED,\n  text,\n  category,\n  tags,\n  content=memories,\n  content_rowid=rowid,\n  tokenize='unicode61 remove_diacritics 2'\n);\n\nCREATE TRIGGER IF NOT EXISTS memories_ai AFTER INSERT ON memories BEGIN\n  INSERT INTO memories_fts(rowid, id, user_id, text, category, tags)\n  VALUES (new.rowid, new.id, new.user_id, new.text, new.category, new.tags);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_ad AFTER DELETE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, id, user_id, text, category, tags)\n  VALUES ('delete', old.rowid, old.id, old.user_id, old.text, old.category, old.tags);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_au AFTER UPDATE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, id, user_id, text, category, tags)\n  VALUES ('delete', old.rowid, old.id, old.user_id, old.text, old.category, old.tags);\n  INSERT INTO memories_fts(rowid, id, user_id, text, category, tags)\n  VALUES (new.rowid, new.id, new.user_id, new.text, new.category, new.tags);\nEND;\n";
+export declare const MEMORY_SCHEMA_SQL = "\nCREATE TABLE IF NOT EXISTS memories (\n  id TEXT PRIMARY KEY,\n  text TEXT NOT NULL,\n  user_id TEXT NOT NULL,\n  category TEXT NOT NULL DEFAULT 'general',\n  importance REAL NOT NULL DEFAULT 0.5,\n  confidence REAL NOT NULL DEFAULT 1.0,\n  source TEXT NOT NULL DEFAULT 'agent',\n  session_id TEXT NOT NULL DEFAULT '',\n  event_date TEXT NOT NULL DEFAULT '',\n  tags TEXT NOT NULL DEFAULT '[]',\n  embedding BLOB,\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL,\n  access_count INTEGER NOT NULL DEFAULT 0,\n  last_accessed_at INTEGER NOT NULL DEFAULT 0,\n  is_archived INTEGER NOT NULL DEFAULT 0,\n  text_seg TEXT NOT NULL DEFAULT '',\n  embedding_model TEXT NOT NULL DEFAULT '',\n  embedding_dims INTEGER NOT NULL DEFAULT 0\n);\n\nCREATE INDEX IF NOT EXISTS idx_memories_user ON memories(user_id);\nCREATE INDEX IF NOT EXISTS idx_memories_user_category ON memories(user_id, category);\nCREATE INDEX IF NOT EXISTS idx_memories_user_importance ON memories(user_id, importance DESC);\nCREATE INDEX IF NOT EXISTS idx_memories_created ON memories(created_at DESC);\n\nCREATE TABLE IF NOT EXISTS memory_observations (\n  id TEXT PRIMARY KEY,\n  user_id TEXT NOT NULL,\n  text TEXT NOT NULL,\n  source TEXT NOT NULL,\n  source_priority INTEGER NOT NULL DEFAULT 0,\n  session_id TEXT NOT NULL DEFAULT '',\n  evidence_type TEXT NOT NULL DEFAULT 'text',\n  payload TEXT NOT NULL DEFAULT '{}',\n  created_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_observations_user_created ON memory_observations(user_id, created_at DESC);\nCREATE INDEX IF NOT EXISTS idx_memory_observations_source ON memory_observations(user_id, source);\n\nCREATE TABLE IF NOT EXISTS memory_proposals (\n  id TEXT PRIMARY KEY,\n  user_id TEXT NOT NULL,\n  observation_ids TEXT NOT NULL DEFAULT '[]',\n  text TEXT NOT NULL,\n  category TEXT NOT NULL DEFAULT 'general',\n  importance REAL NOT NULL DEFAULT 0.5,\n  confidence REAL NOT NULL DEFAULT 0.5,\n  source TEXT NOT NULL DEFAULT 'agent',\n  source_priority INTEGER NOT NULL DEFAULT 0,\n  entity TEXT NOT NULL DEFAULT '',\n  predicate TEXT NOT NULL DEFAULT '',\n  value_json TEXT NOT NULL DEFAULT '{}',\n  valid_time TEXT NOT NULL DEFAULT '',\n  tags TEXT NOT NULL DEFAULT '[]',\n  status TEXT NOT NULL DEFAULT 'pending',\n  related_claim_ids TEXT NOT NULL DEFAULT '[]',\n  idempotency_key TEXT,\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_proposals_user_status ON memory_proposals(user_id, status);\nCREATE INDEX IF NOT EXISTS idx_memory_proposals_fact ON memory_proposals(user_id, entity, predicate, valid_time);\n\nCREATE TABLE IF NOT EXISTS memory_claims (\n  id TEXT PRIMARY KEY,\n  memory_id TEXT NOT NULL DEFAULT '',\n  user_id TEXT NOT NULL,\n  entity TEXT NOT NULL DEFAULT '',\n  predicate TEXT NOT NULL DEFAULT '',\n  value_json TEXT NOT NULL DEFAULT '{}',\n  text TEXT NOT NULL,\n  category TEXT NOT NULL DEFAULT 'general',\n  importance REAL NOT NULL DEFAULT 0.5,\n  confidence REAL NOT NULL DEFAULT 0.5,\n  source TEXT NOT NULL DEFAULT 'agent',\n  source_priority INTEGER NOT NULL DEFAULT 0,\n  status TEXT NOT NULL DEFAULT 'active',\n  valid_time TEXT NOT NULL DEFAULT '',\n  evidence_ids TEXT NOT NULL DEFAULT '[]',\n  supersedes_claim_id TEXT NOT NULL DEFAULT '',\n  conflict_group_id TEXT NOT NULL DEFAULT '',\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_claims_user_status ON memory_claims(user_id, status);\nCREATE INDEX IF NOT EXISTS idx_memory_claims_memory ON memory_claims(memory_id);\nCREATE INDEX IF NOT EXISTS idx_memory_claims_fact ON memory_claims(user_id, entity, predicate, valid_time);\n\nCREATE TABLE IF NOT EXISTS memory_conflicts (\n  id TEXT PRIMARY KEY,\n  user_id TEXT NOT NULL,\n  claim_a_id TEXT NOT NULL,\n  claim_b_id TEXT NOT NULL,\n  reason TEXT NOT NULL,\n  status TEXT NOT NULL DEFAULT 'open',\n  created_at INTEGER NOT NULL,\n  updated_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_conflicts_user_status ON memory_conflicts(user_id, status);\n\nCREATE TABLE IF NOT EXISTS memory_attachments (\n  id TEXT PRIMARY KEY,\n  memory_id TEXT NOT NULL DEFAULT '',\n  user_id TEXT NOT NULL,\n  kind TEXT NOT NULL DEFAULT 'file',\n  filename TEXT NOT NULL DEFAULT '',\n  mime_type TEXT NOT NULL DEFAULT '',\n  size INTEGER NOT NULL DEFAULT 0,\n  rel_path TEXT NOT NULL,\n  extracted_text TEXT NOT NULL DEFAULT '',\n  created_at INTEGER NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_memory_attachments_memory ON memory_attachments(memory_id);\nCREATE INDEX IF NOT EXISTS idx_memory_attachments_orphan ON memory_attachments(user_id, memory_id, created_at);\n\n";
+/**
+ * FTS index + sync triggers, kept as a separate DDL block because the CJK
+ * migration below must DROP and re-create exactly this set — a second copy
+ * would drift. The index covers the pre-segmented shadow column `text_seg`
+ * (see fts-segment.ts), NOT raw `text`: unicode61 cannot segment CJK, so raw
+ * Chinese text is unsearchable by keyword.
+ */
+export declare const MEMORY_FTS_SCHEMA_SQL = "\nCREATE VIRTUAL TABLE IF NOT EXISTS memories_fts USING fts5(\n  id UNINDEXED,\n  user_id UNINDEXED,\n  text_seg,\n  category,\n  tags,\n  content=memories,\n  content_rowid=rowid,\n  tokenize='unicode61 remove_diacritics 2'\n);\n\nCREATE TRIGGER IF NOT EXISTS memories_ai AFTER INSERT ON memories BEGIN\n  INSERT INTO memories_fts(rowid, id, user_id, text_seg, category, tags)\n  VALUES (new.rowid, new.id, new.user_id, new.text_seg, new.category, new.tags);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_ad AFTER DELETE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, id, user_id, text_seg, category, tags)\n  VALUES ('delete', old.rowid, old.id, old.user_id, old.text_seg, old.category, old.tags);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS memories_au AFTER UPDATE ON memories BEGIN\n  INSERT INTO memories_fts(memories_fts, rowid, id, user_id, text_seg, category, tags)\n  VALUES ('delete', old.rowid, old.id, old.user_id, old.text_seg, old.category, old.tags);\n  INSERT INTO memories_fts(rowid, id, user_id, text_seg, category, tags)\n  VALUES (new.rowid, new.id, new.user_id, new.text_seg, new.category, new.tags);\nEND;\n";
 export declare function initializeMemorySchema(db: SqliteDatabase): void;

package/dist/types/skills/tools/image-generate-tool.d.ts

@@ -29,7 +29,7 @@ export declare const IMAGE_GENERATE_TOOL_SCHEMA: {
         };
         readonly size: {
             readonly type: "string";
-            readonly description: "Dimensions: e.g. '1024x1792' (portrait), '1792x1024' (landscape), '1024x1024' (square). Default: '1024x1024'.";
+            readonly description: string;
         };
         readonly image_url: {
             readonly type: "string";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "qlogicagent",
-  "version": "2.18.3",
+  "version": "2.18.5",
   "description": "XiaozhiClaw Agent CLI — subprocess architecture (JSON-RPC over stdio)",
   "type": "module",
   "main": "dist/index.js",
@@ -70,12 +70,13 @@
     "start": "node dist/cli.js",
     "test": "vitest run",
     "test:replay": "vitest run benchmarks/transcript-replay",
-    "check": "pnpm run check:encoding-corruption && pnpm run check:mechanical-rules && tsc --noEmit && pnpm test && pnpm run check:architecture-boundaries && pnpm run check:provider-core-boundary && pnpm run check:provider-core-release-sync && pnpm run check:pet-core-boundary && pnpm run check:workspace-hygiene && pnpm run check:package-artifact",
+    "check": "pnpm run check:encoding-corruption && pnpm run check:mechanical-rules && pnpm run check:windows-hide && tsc --noEmit && pnpm test && pnpm run check:architecture-boundaries && pnpm run check:provider-core-boundary && pnpm run check:provider-core-release-sync && pnpm run check:pet-core-boundary && pnpm run check:workspace-hygiene && pnpm run check:package-artifact",
     "test:watch": "vitest",
     "benchmark:hermes-superiority": "tsx benchmarks/hermes-superiority/runner.ts",
     "lint": "oxlint .",
     "check:encoding-corruption": "node scripts/check-encoding-corruption.mjs",
     "check:mechanical-rules": "node scripts/check-mechanical-rules.mjs",
+    "check:windows-hide": "node scripts/check-windows-hide.mjs src",
     "check:architecture-boundaries": "node scripts/check-architecture-boundaries.mjs",
     "check:provider-core-boundary": "node scripts/check-provider-core-boundary.mjs",
     "check:provider-core-release-sync": "node scripts/check-provider-core-release-sync.mjs",

package/dist/types/cli/tool-bootstrap-community-registration.d.ts

@@ -1,9 +0,0 @@
-import type { PortableTool } from "../skills/portable-tool.js";
-import { type CommunityDiscoveryResult } from "../runtime/community/community-discovery-coordinator.js";
-export interface LocalCommunityToolRegistrationContext {
-    tools: PortableTool<any>[];
-    /** 测试可注入的发现实现;默认从 env consent client 构造协调器。 */
-    discover?: (intent: string) => Promise<CommunityDiscoveryResult>;
-}
-export declare const localCommunityToolRegistrationModule: import("../runtime/ports/tool-contracts.js").ToolRegistrationModule<LocalCommunityToolRegistrationContext>;
-export declare function registerLocalCommunityTools(context: LocalCommunityToolRegistrationContext): void;

package/dist/types/runtime/community/community-discovery-cache.d.ts

@@ -1,24 +0,0 @@
-import type { CommunityRegistryMatchResult } from "./community-consent-client.js";
-export interface CommunityDiscoveryCacheEntry {
-    intentKey: string;
-    resourceId: string;
-    type: string;
-    title: string;
-    summary: string;
-    sourceTier: string;
-    trustStage: string;
-    effectiveRiskTier: string;
-    latestVersion: string | null;
-    cachedAt: string;
-}
-export interface CommunityDiscoveryCacheOptions {
-    ownerUserId?: string;
-    filePath?: string;
-}
-export declare class CommunityDiscoveryCache {
-    private readonly filePath;
-    constructor(options?: CommunityDiscoveryCacheOptions);
-    readAll(): CommunityDiscoveryCacheEntry[];
-    find(intentKey: string): CommunityDiscoveryCacheEntry | undefined;
-    writeMatch(intentKey: string, match: CommunityRegistryMatchResult, now?: Date): CommunityDiscoveryCacheEntry;
-}

package/dist/types/runtime/community/community-discovery-coordinator.d.ts

@@ -1,33 +0,0 @@
-import type { CommunityConsentClient, CommunityRegistryMatchResult } from "./community-consent-client.js";
-import { CommunityDiscoveryCache, type CommunityDiscoveryCacheEntry } from "./community-discovery-cache.js";
-export interface LocalCommunityResourceIndex {
-    findInstalled(intentKey: string): CommunityRegistryMatchResult | undefined;
-}
-export type CommunityDiscoveryStatus = "matched" | "local" | "cached" | "miss" | "disabled" | "unavailable";
-export interface CommunityDiscoveryResult {
-    status: CommunityDiscoveryStatus;
-    intentKey: string;
-    match?: CommunityRegistryMatchResult;
-    cacheEntry?: CommunityDiscoveryCacheEntry;
-    error?: string;
-}
-export interface CommunityDiscoveryCoordinatorOptions {
-    client: Pick<CommunityConsentClient, "matchRegistry"> | null;
-    cache?: CommunityDiscoveryCache;
-    localIndex?: LocalCommunityResourceIndex;
-    topK?: number;
-    now?: () => Date;
-}
-export declare class CommunityDiscoveryCoordinator {
-    private readonly client;
-    private readonly cache;
-    private readonly localIndex?;
-    private readonly topK;
-    private readonly now;
-    private readonly inMemory;
-    constructor(options: CommunityDiscoveryCoordinatorOptions);
-    matchForTurn(intent: string): Promise<CommunityDiscoveryResult>;
-    prefetchIdle(intents: string[]): Promise<CommunityDiscoveryResult[]>;
-    private memo;
-}
-export declare function normalizeDiscoveryIntent(intent: string): string;

package/dist/types/runtime/hooks/community-discovery-hook.d.ts

@@ -1,18 +0,0 @@
-import type { HookRegistry } from "../../contracts/hooks.js";
-import type { CommunityDiscoveryCoordinator } from "../community/community-discovery-coordinator.js";
-export interface CommunityDiscoveryHookDeps {
-    /** Online community discovery coordinator (null disables discovery). */
-    communityDiscovery?: CommunityDiscoveryCoordinator | null;
-    /** Logger. */
-    log: {
-        debug(msg: string): void;
-        warn(msg: string): void;
-    };
-}
-/**
- * Register the community-discovery hook on `memory.before_recall`.
- * Runs at lower priority (60) than QMemory prefetch (50) so it supplements,
- * not replaces, the standard memory recall. When a Hub resource matches the
- * turn, its metadata is injected into recalledMemories as a suggestion.
- */
-export declare function registerCommunityDiscoveryHook(hooks: HookRegistry, deps: CommunityDiscoveryHookDeps): () => void;

package/dist/types/skills/tools/community-seek-tool.d.ts

@@ -1,49 +0,0 @@
-import type { PortableTool } from "../portable-tool.js";
-import type { CommunityDiscoveryResult, CommunityDiscoveryStatus } from "../../runtime/community/community-discovery-coordinator.js";
-import type { CommunityInstallRiskTier, CommunityInstallSourceTier, CommunityInstallTrustStage, CommunityRegistryMatchResult } from "../../runtime/community/community-consent-client.js";
-export declare const COMMUNITY_SEEK_TOOL_NAME: "community_seek";
-export interface CommunitySeekParams {
-    intent: string;
-}
-export interface CommunitySeekPackageCandidate {
-    kind: "package";
-    id: string;
-    title: string;
-    summary: string;
-    capabilityTags: string[];
-    sourceTier: CommunityInstallSourceTier;
-    trustStage: CommunityInstallTrustStage;
-    effectiveRiskTier: CommunityInstallRiskTier;
-    latestVersion: string | null;
-}
-/** 轻回执:落进对话的可折叠"去社区找了个 X"(展示侧由 UI 渲染)。 */
-export interface CommunitySeekReceipt {
-    intent: string;
-    status: CommunityDiscoveryStatus;
-    packageCount: number;
-    topTitle?: string;
-}
-export interface CommunitySeekResult {
-    status: CommunityDiscoveryStatus;
-    intent: string;
-    packages: CommunitySeekPackageCandidate[];
-}
-export interface CommunitySeekDeps {
-    /** 发现协调器:本地前置 + consent + 缓存 + ≤1 次 O(1) registry_match。 */
-    discover(intent: string): Promise<CommunityDiscoveryResult>;
-    /** 轻回执 sink(对话侧渲染);best-effort,抛错不影响工具结果。 */
-    onReceipt?(receipt: CommunitySeekReceipt): void;
-}
-export declare function toPackageCandidate(match: CommunityRegistryMatchResult): CommunitySeekPackageCandidate;
-export declare function runCommunitySeek(deps: CommunitySeekDeps, params: CommunitySeekParams): Promise<CommunitySeekResult>;
-export declare const COMMUNITY_SEEK_TOOL_SCHEMA: {
-    readonly type: "object";
-    readonly properties: {
-        readonly intent: {
-            readonly type: "string";
-            readonly description: string;
-        };
-    };
-    readonly required: readonly ["intent"];
-};
-export declare function createCommunitySeekTool(deps: CommunitySeekDeps): PortableTool<CommunitySeekParams>;