a2a-memory 0.8.1 → 0.9.0

package/dist/proficiency/actr-engine.d.ts

@@ -0,0 +1,55 @@
+/**
+ * ACT-R Activation Engine
+ *
+ * Backend src/core/actr/engine.py 의 TypeScript 포트.
+ * Power Law of Practice + Forgetting Curve 기반 활성화 계산.
+ *
+ * 공식:
+ *   B_i = ln(sum(t_j^(-d))) + B      // Base-level (시간 감쇠)
+ *   S_i = sum(W_j * S_ji)            // Spreading (컨텍스트 연관)
+ *   P_i = -P * (1 - similarity)      // Partial Match (유사도 보정)
+ *   A_i = B_i + S_i + P_i            // Total Activation
+ */
+import type { ACTRConfig, ActivationResult } from './types.js';
+export declare class ACTREngine {
+    private config;
+    constructor(config: ACTRConfig);
+    /**
+     * 전체 활성화 계산
+     *
+     * @param accessTimes - 접근 시간 배열 (현재 시점에서의 경과 초, 양수)
+     * @param associations - [{ source, strength }] 연관 소스와 강도
+     * @param context - 현재 활성 컨텍스트 소스 집합
+     * @param similarity - 유사도 (0.0-1.0, 1.0=완벽 일치)
+     * @param memoryId - 식별용 ID
+     */
+    computeActivation(accessTimes: number[], associations: Array<{
+        source: string;
+        strength: number;
+    }>, context: Set<string>, similarity: number, memoryId?: string): ActivationResult;
+    /**
+     * Base-level Activation: B_i = ln(sum(t_j^(-d))) + B
+     * Power Law of Practice + Forgetting Curve
+     */
+    computeBaseLevel(accessTimes: number[]): number;
+    /**
+     * Spreading Activation: S_i = sum(W_j * S_ji)
+     * Fan Effect: W_j = Smax / fan(j)
+     */
+    computeSpreading(associations: Array<{
+        source: string;
+        strength: number;
+    }>, context: Set<string>): number;
+    /**
+     * Partial Matching: P_i = -P * (1 - similarity)
+     */
+    computePartialMatch(similarity: number): number;
+    /**
+     * Activation을 1-maxLevel 레벨로 변환
+     *
+     * 정규화: activation [-2, 5] -> [0, 1]
+     * 레벨: ceil(normalized * maxLevel), clamp [1, maxLevel]
+     */
+    computeLevel(activation: number, maxLevel: number): number;
+}
+//# sourceMappingURL=actr-engine.d.ts.map

package/dist/proficiency/actr-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"actr-engine.d.ts","sourceRoot":"","sources":["../../src/proficiency/actr-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAK/D,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAa;gBAEf,MAAM,EAAE,UAAU;IAI9B;;;;;;;;OAQG;IACH,iBAAiB,CACf,WAAW,EAAE,MAAM,EAAE,EACrB,YAAY,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,EACzD,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EACpB,UAAU,EAAE,MAAM,EAClB,QAAQ,GAAE,MAAW,GACpB,gBAAgB;IAgBnB;;;OAGG;IACH,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,MAAM;IAqB/C;;;OAGG;IACH,gBAAgB,CACd,YAAY,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,EACzD,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,GACnB,MAAM;IAwBT;;OAEG;IACH,mBAAmB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAK/C;;;;;OAKG;IACH,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;CAM3D"}

package/dist/proficiency/actr-engine.js

@@ -0,0 +1,106 @@
+/**
+ * ACT-R Activation Engine
+ *
+ * Backend src/core/actr/engine.py 의 TypeScript 포트.
+ * Power Law of Practice + Forgetting Curve 기반 활성화 계산.
+ *
+ * 공식:
+ *   B_i = ln(sum(t_j^(-d))) + B      // Base-level (시간 감쇠)
+ *   S_i = sum(W_j * S_ji)            // Spreading (컨텍스트 연관)
+ *   P_i = -P * (1 - similarity)      // Partial Match (유사도 보정)
+ *   A_i = B_i + S_i + P_i            // Total Activation
+ */
+const CLAMP_MIN = 1e-10;
+const CLAMP_MAX = 1e10;
+export class ACTREngine {
+    config;
+    constructor(config) {
+        this.config = config;
+    }
+    /**
+     * 전체 활성화 계산
+     *
+     * @param accessTimes - 접근 시간 배열 (현재 시점에서의 경과 초, 양수)
+     * @param associations - [{ source, strength }] 연관 소스와 강도
+     * @param context - 현재 활성 컨텍스트 소스 집합
+     * @param similarity - 유사도 (0.0-1.0, 1.0=완벽 일치)
+     * @param memoryId - 식별용 ID
+     */
+    computeActivation(accessTimes, associations, context, similarity, memoryId = '') {
+        const baseLevel = this.computeBaseLevel(accessTimes);
+        const spreading = this.computeSpreading(associations, context);
+        const partialMatch = this.computePartialMatch(similarity);
+        const total = baseLevel + spreading + partialMatch;
+        return {
+            memoryId,
+            baseLevel,
+            spreading,
+            partialMatch,
+            total,
+            shouldRetrieve: total >= this.config.retrievalThreshold,
+        };
+    }
+    /**
+     * Base-level Activation: B_i = ln(sum(t_j^(-d))) + B
+     * Power Law of Practice + Forgetting Curve
+     */
+    computeBaseLevel(accessTimes) {
+        if (accessTimes.length === 0) {
+            return this.config.baseLevelConstant;
+        }
+        const d = this.config.decayRate;
+        let sum = 0;
+        for (const t of accessTimes) {
+            // 경과 시간이 0 이하이면 최소값 사용
+            const safeT = Math.max(t, CLAMP_MIN);
+            sum += Math.pow(safeT, -d);
+        }
+        // clamp sum to avoid log(0) or extreme values
+        sum = Math.max(sum, CLAMP_MIN);
+        sum = Math.min(sum, CLAMP_MAX);
+        return Math.log(sum) + this.config.baseLevelConstant;
+    }
+    /**
+     * Spreading Activation: S_i = sum(W_j * S_ji)
+     * Fan Effect: W_j = Smax / fan(j)
+     */
+    computeSpreading(associations, context) {
+        if (associations.length === 0 || context.size === 0) {
+            return 0;
+        }
+        // Fan 계산: 각 source가 연관된 총 수
+        const fanCounts = new Map();
+        for (const assoc of associations) {
+            fanCounts.set(assoc.source, (fanCounts.get(assoc.source) ?? 0) + 1);
+        }
+        let totalSpreading = 0;
+        for (const assoc of associations) {
+            if (!context.has(assoc.source))
+                continue;
+            const fan = fanCounts.get(assoc.source) ?? 1;
+            const W_j = this.config.maxAssociativeStrength / (fan * this.config.fanEffectFactor);
+            totalSpreading += W_j * assoc.strength;
+        }
+        return totalSpreading;
+    }
+    /**
+     * Partial Matching: P_i = -P * (1 - similarity)
+     */
+    computePartialMatch(similarity) {
+        const clampedSim = Math.max(0, Math.min(1, similarity));
+        return -this.config.mismatchPenalty * (1 - clampedSim);
+    }
+    /**
+     * Activation을 1-maxLevel 레벨로 변환
+     *
+     * 정규화: activation [-2, 5] -> [0, 1]
+     * 레벨: ceil(normalized * maxLevel), clamp [1, maxLevel]
+     */
+    computeLevel(activation, maxLevel) {
+        // 정규화: [-2, 5] 범위를 [0, 1]로
+        const normalized = Math.max(0, Math.min(1, (activation + 2) / 7));
+        const level = Math.ceil(normalized * maxLevel);
+        return Math.min(maxLevel, Math.max(1, level));
+    }
+}
+//# sourceMappingURL=actr-engine.js.map

package/dist/proficiency/actr-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"actr-engine.js","sourceRoot":"","sources":["../../src/proficiency/actr-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,MAAM,SAAS,GAAG,KAAK,CAAC;AACxB,MAAM,SAAS,GAAG,IAAI,CAAC;AAEvB,MAAM,OAAO,UAAU;IACb,MAAM,CAAa;IAE3B,YAAY,MAAkB;QAC5B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;;;;;;;OAQG;IACH,iBAAiB,CACf,WAAqB,EACrB,YAAyD,EACzD,OAAoB,EACpB,UAAkB,EAClB,WAAmB,EAAE;QAErB,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAC/D,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC1D,MAAM,KAAK,GAAG,SAAS,GAAG,SAAS,GAAG,YAAY,CAAC;QAEnD,OAAO;YACL,QAAQ;YACR,SAAS;YACT,SAAS;YACT,YAAY;YACZ,KAAK;YACL,cAAc,EAAE,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB;SACxD,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,WAAqB;QACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;QACvC,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;QAChC,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,uBAAuB;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YACrC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,8CAA8C;QAC9C,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC/B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAE/B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,gBAAgB,CACd,YAAyD,EACzD,OAAoB;QAEpB,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACpD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,4BAA4B;QAC5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,CAAC;QAED,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;gBAAE,SAAS;YAEzC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,sBAAsB,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;YACrF,cAAc,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC;QACzC,CAAC;QAED,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,UAAkB;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QACxD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IACzD,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,UAAkB,EAAE,QAAgB;QAC/C,2BAA2B;QAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAChD,CAAC;CACF"}

package/dist/proficiency/detection.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Multi-signal skill practice detection.
+ */
+export interface DetectionResult {
+    skillMemoryId: string;
+    outcome: 'success' | 'partial' | 'failure';
+    difficulty: number;
+    contextTags: string[];
+}
+export interface SkillInfo {
+    id: string;
+    content: string;
+    tags: string[];
+    embedding?: number[];
+}
+export interface SessionMemory {
+    content: string;
+    tags: string[];
+    embedding?: number[];
+}
+/**
+ * Jaccard similarity between two tag sets
+ */
+export declare function jaccardSimilarity(setA: string[], setB: string[]): number;
+/**
+ * Keyword match ratio
+ */
+export declare function keywordMatchRatio(skillContent: string, sessionTexts: string[]): number;
+/**
+ * Cosine similarity between two vectors
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Multi-signal skill practice detection
+ * Weights: embedding 0.5 + tag overlap 0.3 + keyword 0.2
+ */
+export declare function detectSkillPractice(skill: SkillInfo, sessionMemories: SessionMemory[]): DetectionResult | null;
+//# sourceMappingURL=detection.d.ts.map

package/dist/proficiency/detection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detection.d.ts","sourceRoot":"","sources":["../../src/proficiency/detection.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,WAAW,eAAe;IAC9B,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAOxE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,MAAM,CAYtF;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CASjE;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,SAAS,EAChB,eAAe,EAAE,aAAa,EAAE,GAC/B,eAAe,GAAG,IAAI,CAiCxB"}

package/dist/proficiency/detection.js

@@ -0,0 +1,81 @@
+/**
+ * Multi-signal skill practice detection.
+ */
+/**
+ * Jaccard similarity between two tag sets
+ */
+export function jaccardSimilarity(setA, setB) {
+    if (setA.length === 0 && setB.length === 0)
+        return 0;
+    const a = new Set(setA.map(s => s.toLowerCase()));
+    const b = new Set(setB.map(s => s.toLowerCase()));
+    const intersection = new Set([...a].filter(x => b.has(x)));
+    const union = new Set([...a, ...b]);
+    return union.size > 0 ? intersection.size / union.size : 0;
+}
+/**
+ * Keyword match ratio
+ */
+export function keywordMatchRatio(skillContent, sessionTexts) {
+    if (!skillContent || sessionTexts.length === 0)
+        return 0;
+    const keywords = skillContent
+        .toLowerCase()
+        .split(/[\s,.;:!?\-_/\\]+/)
+        .filter(w => w.length > 3)
+        .slice(0, 10);
+    if (keywords.length === 0)
+        return 0;
+    const sessionText = sessionTexts.join(' ').toLowerCase();
+    const matches = keywords.filter(kw => sessionText.includes(kw));
+    return matches.length / keywords.length;
+}
+/**
+ * Cosine similarity between two vectors
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dot = 0, normA = 0, normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] ** 2;
+        normB += b[i] ** 2;
+    }
+    return normA > 0 && normB > 0 ? dot / (Math.sqrt(normA) * Math.sqrt(normB)) : 0;
+}
+/**
+ * Multi-signal skill practice detection
+ * Weights: embedding 0.5 + tag overlap 0.3 + keyword 0.2
+ */
+export function detectSkillPractice(skill, sessionMemories) {
+    if (sessionMemories.length === 0)
+        return null;
+    // Signal 1: Embedding similarity
+    let embeddingSim = 0;
+    if (skill.embedding && skill.embedding.length > 0) {
+        for (const mem of sessionMemories) {
+            if (mem.embedding && mem.embedding.length === skill.embedding.length) {
+                const sim = cosineSimilarity(skill.embedding, mem.embedding);
+                embeddingSim = Math.max(embeddingSim, sim);
+            }
+        }
+    }
+    // Signal 2: Tag overlap
+    const sessionTags = [...new Set(sessionMemories.flatMap(m => m.tags || []))];
+    const tagSim = jaccardSimilarity(skill.tags || [], sessionTags);
+    // Signal 3: Keyword matching
+    const sessionTexts = sessionMemories.map(m => m.content);
+    const keywordSim = keywordMatchRatio(skill.content, sessionTexts);
+    // Weighted sum
+    const score = embeddingSim * 0.5 + tagSim * 0.3 + keywordSim * 0.2;
+    if (score < 0.4)
+        return null;
+    return {
+        skillMemoryId: skill.id,
+        outcome: score >= 0.7 ? 'success' : score >= 0.5 ? 'partial' : 'failure',
+        difficulty: Math.round((1 - score) * 100) / 100,
+        contextTags: sessionTags.slice(0, 10),
+    };
+}
+//# sourceMappingURL=detection.js.map

package/dist/proficiency/detection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detection.js","sourceRoot":"","sources":["../../src/proficiency/detection.ts"],"names":[],"mappings":"AAAA;;GAEG;AAsBH;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAc,EAAE,IAAc;IAC9D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACrD,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,YAAoB,EAAE,YAAsB;IAC5E,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzD,MAAM,QAAQ,GAAG,YAAY;SAC1B,WAAW,EAAE;SACb,KAAK,CAAC,mBAAmB,CAAC;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SACzB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAChB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEpC,MAAM,WAAW,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IACzD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,OAAO,OAAO,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAgB,EAChB,eAAgC;IAEhC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE9C,iCAAiC;IACjC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClD,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,KAAK,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrE,MAAM,GAAG,GAAG,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC7D,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,EAAE,WAAW,CAAC,CAAC;IAEhE,6BAA6B;IAC7B,MAAM,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAElE,eAAe;IACf,MAAM,KAAK,GAAG,YAAY,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,UAAU,GAAG,GAAG,CAAC;IAEnE,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAE7B,OAAO;QACL,aAAa,EAAE,KAAK,CAAC,EAAE;QACvB,OAAO,EAAE,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;QACxE,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG;QAC/C,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;KACtC,CAAC;AACJ,CAAC"}

package/dist/proficiency/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Proficiency Module
+ *
+ * ACT-R 기반 스킬 숙련도 추적 시스템.
+ */
+export { ACTREngine } from './actr-engine.js';
+export { ProficiencyTracker, computePracticalLevel } from './tracker.js';
+export { jaccardSimilarity, keywordMatchRatio, cosineSimilarity, detectSkillPractice, } from './detection.js';
+export type { DetectionResult, SkillInfo, SessionMemory, } from './detection.js';
+export type { ACTRConfig, ActivationResult, ExperienceEvent, ProficiencyRecord, LevelUpdateResult, SimulationScenario, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/proficiency/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/proficiency/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,eAAe,EACf,SAAS,EACT,aAAa,GACd,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,UAAU,EACV,gBAAgB,EAChB,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,kBAAkB,GACnB,MAAM,YAAY,CAAC"}

package/dist/proficiency/index.js

@@ -0,0 +1,9 @@
+/**
+ * Proficiency Module
+ *
+ * ACT-R 기반 스킬 숙련도 추적 시스템.
+ */
+export { ACTREngine } from './actr-engine.js';
+export { ProficiencyTracker, computePracticalLevel } from './tracker.js';
+export { jaccardSimilarity, keywordMatchRatio, cosineSimilarity, detectSkillPractice, } from './detection.js';
+//# sourceMappingURL=index.js.map

package/dist/proficiency/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/proficiency/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC"}

package/dist/proficiency/tracker.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Proficiency Tracker
+ *
+ * 스킬 숙련도를 추적하고 레벨 계산을 수행하는 오케스트레이터.
+ *
+ * 레벨 공식 (Hybrid):
+ *   countScore = log2(1 + N) / log2(151)     // Power Law of Practice
+ *   successScore = 0.3 + successRate * 0.7    // 성공률 반영
+ *   recencyFactor = exp(-daysSince * 0.02)    // ACT-R Forgetting Curve
+ *   difficultyBonus = avgDifficulty * 0.1     // 난이도 보상
+ *   level = ceil(clamp(countScore * successScore * recencyFactor + difficultyBonus, 0, 1) * maxLevel)
+ *
+ * ACT-R 순수 활성화 값은 actrActivation 필드에 별도 저장 (분석용).
+ */
+import type { MemoryDatabase } from '../db/database.js';
+import type { ProficiencyConfig } from '../types/index.js';
+import type { ProficiencyRecord, LevelUpdateResult, SimulationScenario } from './types.js';
+export declare class ProficiencyTracker {
+    private db;
+    private config;
+    private engine;
+    constructor(db: MemoryDatabase, config: ProficiencyConfig);
+    /**
+     * 스킬 연습 기록 + 레벨 재계산
+     */
+    recordPractice(skillMemoryId: string, outcome: 'success' | 'partial' | 'failure', difficulty: number, contextTags?: string[], sessionId?: string): LevelUpdateResult;
+    /**
+     * 레벨 재계산 (Hybrid: Power Law + Forgetting Curve)
+     */
+    recalculateLevel(proficiencyId: string): LevelUpdateResult;
+    /**
+     * 숙련도 레코드 보장: 없으면 생성
+     */
+    ensureProficiency(skillMemoryId: string): ProficiencyRecord;
+    /**
+     * 숙련도 목록 조회
+     */
+    listProficiencies(projectPath?: string): ProficiencyRecord[];
+    /**
+     * 시뮬레이션: 이벤트 시퀀스 → 레벨 진행 반환
+     */
+    simulate(scenario: SimulationScenario): number[];
+}
+/**
+ * 실용적 레벨 공식
+ *
+ * Power Law of Practice (log 성장) + Forgetting Curve (지수 감쇠) + 난이도 보너스
+ */
+export declare function computePracticalLevel(experienceCount: number, successRate: number, daysSinceLastPractice: number, avgDifficulty: number, maxLevel: number): number;
+//# sourceMappingURL=tracker.d.ts.map

package/dist/proficiency/tracker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tracker.d.ts","sourceRoot":"","sources":["../../src/proficiency/tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAC3D,OAAO,KAAK,EACV,iBAAiB,EACjB,iBAAiB,EACjB,kBAAkB,EACnB,MAAM,YAAY,CAAC;AAMpB,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,MAAM,CAAa;gBAEf,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,iBAAiB;IAMzD;;OAEG;IACH,cAAc,CACZ,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,EAC1C,UAAU,EAAE,MAAM,EAClB,WAAW,GAAE,MAAM,EAAO,EAC1B,SAAS,CAAC,EAAE,MAAM,GACjB,iBAAiB;IAgBpB;;OAEG;IACH,gBAAgB,CAAC,aAAa,EAAE,MAAM,GAAG,iBAAiB;IAwE1D;;OAEG;IACH,iBAAiB,CAAC,aAAa,EAAE,MAAM,GAAG,iBAAiB;IAiB3D;;OAEG;IACH,iBAAiB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,iBAAiB,EAAE;IAI5D;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,kBAAkB,GAAG,MAAM,EAAE;CA2BjD;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,eAAe,EAAE,MAAM,EACvB,WAAW,EAAE,MAAM,EACnB,qBAAqB,EAAE,MAAM,EAC7B,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,GACf,MAAM,CAiBR"}

package/dist/proficiency/tracker.js

@@ -0,0 +1,170 @@
+/**
+ * Proficiency Tracker
+ *
+ * 스킬 숙련도를 추적하고 레벨 계산을 수행하는 오케스트레이터.
+ *
+ * 레벨 공식 (Hybrid):
+ *   countScore = log2(1 + N) / log2(151)     // Power Law of Practice
+ *   successScore = 0.3 + successRate * 0.7    // 성공률 반영
+ *   recencyFactor = exp(-daysSince * 0.02)    // ACT-R Forgetting Curve
+ *   difficultyBonus = avgDifficulty * 0.1     // 난이도 보상
+ *   level = ceil(clamp(countScore * successScore * recencyFactor + difficultyBonus, 0, 1) * maxLevel)
+ *
+ * ACT-R 순수 활성화 값은 actrActivation 필드에 별도 저장 (분석용).
+ */
+import { ACTREngine } from './actr-engine.js';
+// 150 이벤트에서 countScore ≈ 1.0 도달 (Power Law 스케일링)
+const COUNT_SCALE = Math.log2(151);
+export class ProficiencyTracker {
+    db;
+    config;
+    engine;
+    constructor(db, config) {
+        this.db = db;
+        this.config = config;
+        this.engine = new ACTREngine(config.actr);
+    }
+    /**
+     * 스킬 연습 기록 + 레벨 재계산
+     */
+    recordPractice(skillMemoryId, outcome, difficulty, contextTags = [], sessionId) {
+        const proficiency = this.ensureProficiency(skillMemoryId);
+        const now = Date.now() / 1000;
+        this.db.addExperienceEvent({
+            proficiencyId: proficiency.id,
+            timestamp: now,
+            outcome,
+            difficulty: Math.max(0, Math.min(1, difficulty)),
+            contextTags,
+            sessionId,
+        });
+        return this.recalculateLevel(proficiency.id);
+    }
+    /**
+     * 레벨 재계산 (Hybrid: Power Law + Forgetting Curve)
+     */
+    recalculateLevel(proficiencyId) {
+        const proficiency = this.db.getProficiency(proficiencyId);
+        if (!proficiency) {
+            return { previousLevel: 1, newLevel: 1, activation: 0, experienceCount: 0, levelChanged: false };
+        }
+        const events = this.db.getExperienceEvents(proficiencyId, { limit: 1000, order: 'desc' });
+        if (events.length === 0) {
+            return {
+                previousLevel: proficiency.level,
+                newLevel: 1,
+                activation: 0,
+                experienceCount: 0,
+                levelChanged: proficiency.level !== 1,
+            };
+        }
+        const now = Date.now() / 1000;
+        // 성공률
+        const successCount = events.filter((e) => e.outcome === 'success').length;
+        const partialCount = events.filter((e) => e.outcome === 'partial').length;
+        const successRate = (successCount + partialCount * 0.5) / events.length;
+        // 난이도
+        const avgDifficulty = events.reduce((sum, e) => sum + e.difficulty, 0) / events.length;
+        // 최근 연습 이후 경과일
+        const daysSinceLastPractice = (now - events[0].timestamp) / 86400;
+        // ACT-R 활성화 계산 (분석용 저장)
+        const accessTimes = events.map((e) => Math.max(now - e.timestamp, 1.0));
+        const tagCounts = new Map();
+        for (const event of events) {
+            for (const tag of event.contextTags) {
+                tagCounts.set(tag, (tagCounts.get(tag) ?? 0) + 1);
+            }
+        }
+        const associations = Array.from(tagCounts.entries()).map(([tag, count]) => ({
+            source: tag,
+            strength: Math.min(count / events.length, 1.0),
+        }));
+        const recentTags = events.slice(0, 5).flatMap((e) => e.contextTags);
+        const actrResult = this.engine.computeActivation(accessTimes, associations, new Set(recentTags), successRate, proficiencyId);
+        // 레벨 계산 (Hybrid)
+        const newLevel = computePracticalLevel(events.length, successRate, daysSinceLastPractice, avgDifficulty, this.config.maxLevel);
+        const previousLevel = proficiency.level;
+        const activation = actrResult.total + avgDifficulty * 0.2;
+        this.db.updateProficiency(proficiencyId, {
+            level: newLevel,
+            experienceCount: events.length,
+            successRate,
+            actrActivation: activation,
+            lastPracticedAt: new Date().toISOString(),
+        });
+        return {
+            previousLevel,
+            newLevel,
+            activation,
+            experienceCount: events.length,
+            levelChanged: previousLevel !== newLevel,
+        };
+    }
+    /**
+     * 숙련도 레코드 보장: 없으면 생성
+     */
+    ensureProficiency(skillMemoryId) {
+        const existing = this.db.getProficiencyBySkill(skillMemoryId);
+        if (existing)
+            return existing;
+        const skillMemory = this.db.getMemory(skillMemoryId);
+        const skillName = skillMemory
+            ? skillMemory.content.split('\n')[0].replace('[Skill] ', '').slice(0, 100)
+            : `skill-${skillMemoryId.slice(0, 8)}`;
+        const projectPath = skillMemory?.projectPath;
+        return this.db.createProficiency({
+            skillMemoryId,
+            skillName,
+            projectPath,
+        });
+    }
+    /**
+     * 숙련도 목록 조회
+     */
+    listProficiencies(projectPath) {
+        return this.db.listProficiencies({ projectPath });
+    }
+    /**
+     * 시뮬레이션: 이벤트 시퀀스 → 레벨 진행 반환
+     */
+    simulate(scenario) {
+        const levels = [];
+        let successCount = 0;
+        let totalDifficulty = 0;
+        for (let i = 0; i < scenario.eventCount; i++) {
+            const isSuccess = Math.random() < scenario.successRate;
+            if (isSuccess)
+                successCount++;
+            const totalCount = i + 1;
+            const successRate = successCount / totalCount;
+            const [minD, maxD] = scenario.difficultyRange;
+            const difficulty = minD + (maxD - minD) * (i / Math.max(scenario.eventCount - 1, 1));
+            totalDifficulty += difficulty;
+            const avgDifficulty = totalDifficulty / totalCount;
+            // 최근 연습 이후 경과일: 시뮬레이션에서는 0 (방금 연습)
+            const daysSinceLastPractice = 0;
+            const level = computePracticalLevel(totalCount, successRate, daysSinceLastPractice, avgDifficulty, this.config.maxLevel);
+            levels.push(level);
+        }
+        return levels;
+    }
+}
+/**
+ * 실용적 레벨 공식
+ *
+ * Power Law of Practice (log 성장) + Forgetting Curve (지수 감쇠) + 난이도 보너스
+ */
+export function computePracticalLevel(experienceCount, successRate, daysSinceLastPractice, avgDifficulty, maxLevel) {
+    // 1. 연습 횟수 (Power Law - 대수적 성장)
+    const countScore = Math.min(1.0, Math.log2(1 + experienceCount) / COUNT_SCALE);
+    // 2. 성공률 (0% → 0.3, 100% → 1.0)
+    const successScore = 0.3 + successRate * 0.7;
+    // 3. 망각 곡선 (ACT-R inspired exponential decay)
+    const recencyFactor = Math.exp(-Math.max(0, daysSinceLastPractice) * 0.02);
+    // 4. 난이도 보너스 (높은 난이도 연습에 보상)
+    const difficultyBonus = avgDifficulty * 0.1;
+    // 합산
+    const combined = Math.max(0, Math.min(1, countScore * successScore * recencyFactor + difficultyBonus));
+    return Math.min(maxLevel, Math.max(1, Math.ceil(combined * maxLevel)));
+}
+//# sourceMappingURL=tracker.js.map

package/dist/proficiency/tracker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tracker.js","sourceRoot":"","sources":["../../src/proficiency/tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AASH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C,iDAAiD;AACjD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAEnC,MAAM,OAAO,kBAAkB;IACrB,EAAE,CAAiB;IACnB,MAAM,CAAoB;IAC1B,MAAM,CAAa;IAE3B,YAAY,EAAkB,EAAE,MAAyB;QACvD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,cAAc,CACZ,aAAqB,EACrB,OAA0C,EAC1C,UAAkB,EAClB,cAAwB,EAAE,EAC1B,SAAkB;QAElB,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;QAE1D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC;YACzB,aAAa,EAAE,WAAW,CAAC,EAAE;YAC7B,SAAS,EAAE,GAAG;YACd,OAAO;YACP,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChD,WAAW;YACX,SAAS;SACV,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,aAAqB;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QAC1D,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,EAAE,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC;QACnG,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,mBAAmB,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1F,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO;gBACL,aAAa,EAAE,WAAW,CAAC,KAAK;gBAChC,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,CAAC;gBACb,eAAe,EAAE,CAAC;gBAClB,YAAY,EAAE,WAAW,CAAC,KAAK,KAAK,CAAC;aACtC,CAAC;QACJ,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAE9B,MAAM;QACN,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QAC1E,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QAC1E,MAAM,WAAW,GAAG,CAAC,YAAY,GAAG,YAAY,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAExE,MAAM;QACN,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAEvF,eAAe;QACf,MAAM,qBAAqB,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;QAElE,wBAAwB;QACxB,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QACxE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBACpC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QACD,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1E,MAAM,EAAE,GAAG;YACX,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;SAC/C,CAAC,CAAC,CAAC;QACJ,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACpE,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAC9C,WAAW,EAAE,YAAY,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,EAAE,WAAW,EAAE,aAAa,CAC3E,CAAC;QAEF,iBAAiB;QACjB,MAAM,QAAQ,GAAG,qBAAqB,CACpC,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,qBAAqB,EAAE,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CACvF,CAAC;QAEF,MAAM,aAAa,GAAG,WAAW,CAAC,KAAK,CAAC;QACxC,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,GAAG,aAAa,GAAG,GAAG,CAAC;QAE1D,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC,aAAa,EAAE;YACvC,KAAK,EAAE,QAAQ;YACf,eAAe,EAAE,MAAM,CAAC,MAAM;YAC9B,WAAW;YACX,cAAc,EAAE,UAAU;YAC1B,eAAe,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SAC1C,CAAC,CAAC;QAEH,OAAO;YACL,aAAa;YACb,QAAQ;YACR,UAAU;YACV,eAAe,EAAE,MAAM,CAAC,MAAM;YAC9B,YAAY,EAAE,aAAa,KAAK,QAAQ;SACzC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,aAAqB;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QAC9D,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAE9B,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,WAAW;YAC3B,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YAC1E,CAAC,CAAC,SAAS,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACzC,MAAM,WAAW,GAAG,WAAW,EAAE,WAAW,CAAC;QAE7C,OAAO,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC;YAC/B,aAAa;YACb,SAAS;YACT,WAAW;SACZ,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,WAAoB;QACpC,OAAO,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,QAA4B;QACnC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC;YACvD,IAAI,SAAS;gBAAE,YAAY,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,WAAW,GAAG,YAAY,GAAG,UAAU,CAAC;YAE9C,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,eAAe,CAAC;YAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrF,eAAe,IAAI,UAAU,CAAC;YAC9B,MAAM,aAAa,GAAG,eAAe,GAAG,UAAU,CAAC;YAEnD,mCAAmC;YACnC,MAAM,qBAAqB,GAAG,CAAC,CAAC;YAEhC,MAAM,KAAK,GAAG,qBAAqB,CACjC,UAAU,EAAE,WAAW,EAAE,qBAAqB,EAAE,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CACpF,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,eAAuB,EACvB,WAAmB,EACnB,qBAA6B,EAC7B,aAAqB,EACrB,QAAgB;IAEhB,gCAAgC;IAChC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,GAAG,WAAW,CAAC,CAAC;IAE/E,gCAAgC;IAChC,MAAM,YAAY,GAAG,GAAG,GAAG,WAAW,GAAG,GAAG,CAAC;IAE7C,8CAA8C;IAC9C,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,qBAAqB,CAAC,GAAG,IAAI,CAAC,CAAC;IAE3E,6BAA6B;IAC7B,MAAM,eAAe,GAAG,aAAa,GAAG,GAAG,CAAC;IAE5C,KAAK;IACL,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,YAAY,GAAG,aAAa,GAAG,eAAe,CAAC,CAAC,CAAC;IAEvG,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AACzE,CAAC"}

package/dist/proficiency/types.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Proficiency Types
+ *
+ * ACT-R 인지 아키텍처 기반 숙련도 추적 타입 정의.
+ * Power Law of Practice + Forgetting Curve를 활용한 레벨 1-10 자동 계산.
+ */
+export interface ACTRConfig {
+    decayRate: number;
+    baseLevelConstant: number;
+    maxAssociativeStrength: number;
+    fanEffectFactor: number;
+    mismatchPenalty: number;
+    retrievalThreshold: number;
+}
+export interface ActivationResult {
+    memoryId: string;
+    baseLevel: number;
+    spreading: number;
+    partialMatch: number;
+    total: number;
+    shouldRetrieve: boolean;
+}
+export interface ExperienceEvent {
+    id: string;
+    proficiencyId: string;
+    timestamp: number;
+    outcome: 'success' | 'partial' | 'failure';
+    difficulty: number;
+    contextTags: string[];
+    sessionId?: string;
+}
+export interface ProficiencyRecord {
+    id: string;
+    skillMemoryId: string;
+    skillName: string;
+    level: number;
+    experienceCount: number;
+    successRate: number;
+    actrActivation: number;
+    lastPracticedAt: string;
+    createdAt: string;
+    updatedAt: string;
+    projectPath?: string;
+}
+export interface LevelUpdateResult {
+    previousLevel: number;
+    newLevel: number;
+    activation: number;
+    experienceCount: number;
+    levelChanged: boolean;
+}
+export interface SimulationScenario {
+    eventCount: number;
+    successRate: number;
+    difficultyRange: [number, number];
+    timeSpanDays: number;
+    expectedMinLevel: number;
+    expectedMaxLevel: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/proficiency/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/proficiency/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE,OAAO,CAAC;CACzB;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,kBAAkB;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,EAAE,MAAM,CAAC;IACzB,gBAAgB,EAAE,MAAM,CAAC;CAC1B"}

package/dist/proficiency/types.js

@@ -0,0 +1,8 @@
+/**
+ * Proficiency Types
+ *
+ * ACT-R 인지 아키텍처 기반 숙련도 추적 타입 정의.
+ * Power Law of Practice + Forgetting Curve를 활용한 레벨 1-10 자동 계산.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/proficiency/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/proficiency/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}