@mnemom/agent-alignment-protocol 0.1.4 → 0.1.6

package/dist/index.d.mts

@@ -457,14 +457,19 @@ declare function checkCoherence(myCard: AlignmentCard, theirCard: AlignmentCard,
 /**
  * Detect behavioral drift from declared alignment.
  *
- * Analyzes traces chronologically, computing similarity between each
- * trace's behavior and the declared alignment. Alerts when sustained
- * low similarity is detected (consecutive traces below threshold).
+ * Computes a baseline centroid from the first N traces, then compares
+ * subsequent traces against this centroid using cosine similarity.
+ * Trace-to-trace comparison provides symmetric feature spaces, yielding
+ * meaningful similarity scores (unlike trace-to-card which is structurally
+ * depressed due to asymmetric features).
+ *
+ * Alerts when sustained low similarity is detected (consecutive traces
+ * below threshold).
  *
  * @see SPEC Section 8 and Appendix B.2 for algorithm specification.
  *
- * @param card - Alignment Card to compare against
- * @param traces - List of AP-Traces in chronological order
+ * @param card - Alignment Card (used for card_id and direction inference)
+ * @param traces - List of AP-Traces (sorted chronologically internally)
  * @param similarityThreshold - Alert when similarity drops below (default: 0.30)
  * @param sustainedThreshold - Alert after N consecutive low-similarity traces (default: 3)
  * @returns List of DriftAlert objects for detected drift events
@@ -646,6 +651,16 @@ declare function extractCardFeatures(card: AlignmentCard): FeatureVector;
  * Extract features from an AP-Trace.
  */
 declare function extractTraceFeatures(trace: APTrace): FeatureVector;
+/**
+ * Compute the centroid (element-wise mean) of multiple feature vectors.
+ *
+ * Used by drift detection to build a baseline from the first N traces,
+ * enabling trace-to-trace comparison instead of trace-to-card comparison.
+ *
+ * @param vectors - Array of feature vectors to average
+ * @returns Centroid feature vector
+ */
+declare function computeCentroid(vectors: FeatureVector[]): FeatureVector;
 /**
  * Compute cosine similarity between two feature vectors.
  *
@@ -678,6 +693,6 @@ declare const CONFLICT_PENALTY_MULTIPLIER = 0.5;
 declare const MIN_WORD_LENGTH = 3;
 /** Maximum features to extract from TF-IDF vectorization */
 declare const MAX_TFIDF_FEATURES = 500;
-declare const ALGORITHM_VERSION = "1.1.0";
+declare const ALGORITHM_VERSION = "1.2.0";
 
-export { ALGORITHM_VERSION, type APTrace, type Action, type ActionCategory, type ActionTarget, type ActionType, type AlignmentCard, type AlignmentCardRequest, type AlignmentCardResponse, type Alternative, type AuditCommitment, type AuditStorage, type AutonomyEnvelope, type AutonomyScope, CONFLICT_PENALTY_MULTIPLIER, type Coherence, type CoherenceResult, type CoherenceResultMessage, DEFAULT_SIMILARITY_THRESHOLD, DEFAULT_SUSTAINED_TURNS_THRESHOLD, type DataSharing, type Decision, type DriftAlert, type DriftAnalysis, type DriftDirection, type DriftIndicator, type Escalation, type EscalationStatus, type EscalationTrigger, type HierarchyType, MAX_TFIDF_FEATURES, MIN_COHERENCE_FOR_PROCEED, MIN_WORD_LENGTH, type MonetaryValue, NEAR_BOUNDARY_THRESHOLD, type Principal, type PrincipalResponse, type PrincipalType, type ProposedCollaboration, type ProposedResolution, type RelationshipType, type RequesterInfo, type Severity, type Signature, type StorageType, type TamperEvidence, type TaskContext, type TraceContext, type TriggerAction, type TriggerCheck, VIOLATION_SEVERITY, type ValueAlignment, type ValueAlignmentDetail, type ValueCoherenceCheck, type ValueCoherenceMessage, type ValueConflict, type ValueConflictResult, type ValueDefinition, type Values, type VerificationMetadata, type VerificationResult, type Violation, type ViolationType, type Warning, checkCoherence, cosineSimilarity, createViolation, detectDrift, extractCardFeatures, extractTraceFeatures, getSelectedAlternative, hadViolations, hasValue, isActionBounded, isActionForbidden, isCardExpired, verifyTrace, wasEscalated };
+export { ALGORITHM_VERSION, type APTrace, type Action, type ActionCategory, type ActionTarget, type ActionType, type AlignmentCard, type AlignmentCardRequest, type AlignmentCardResponse, type Alternative, type AuditCommitment, type AuditStorage, type AutonomyEnvelope, type AutonomyScope, CONFLICT_PENALTY_MULTIPLIER, type Coherence, type CoherenceResult, type CoherenceResultMessage, DEFAULT_SIMILARITY_THRESHOLD, DEFAULT_SUSTAINED_TURNS_THRESHOLD, type DataSharing, type Decision, type DriftAlert, type DriftAnalysis, type DriftDirection, type DriftIndicator, type Escalation, type EscalationStatus, type EscalationTrigger, type HierarchyType, MAX_TFIDF_FEATURES, MIN_COHERENCE_FOR_PROCEED, MIN_WORD_LENGTH, type MonetaryValue, NEAR_BOUNDARY_THRESHOLD, type Principal, type PrincipalResponse, type PrincipalType, type ProposedCollaboration, type ProposedResolution, type RelationshipType, type RequesterInfo, type Severity, type Signature, type StorageType, type TamperEvidence, type TaskContext, type TraceContext, type TriggerAction, type TriggerCheck, VIOLATION_SEVERITY, type ValueAlignment, type ValueAlignmentDetail, type ValueCoherenceCheck, type ValueCoherenceMessage, type ValueConflict, type ValueConflictResult, type ValueDefinition, type Values, type VerificationMetadata, type VerificationResult, type Violation, type ViolationType, type Warning, checkCoherence, computeCentroid, cosineSimilarity, createViolation, detectDrift, extractCardFeatures, extractTraceFeatures, getSelectedAlternative, hadViolations, hasValue, isActionBounded, isActionForbidden, isCardExpired, verifyTrace, wasEscalated };

package/dist/index.d.ts

@@ -457,14 +457,19 @@ declare function checkCoherence(myCard: AlignmentCard, theirCard: AlignmentCard,
 /**
  * Detect behavioral drift from declared alignment.
  *
- * Analyzes traces chronologically, computing similarity between each
- * trace's behavior and the declared alignment. Alerts when sustained
- * low similarity is detected (consecutive traces below threshold).
+ * Computes a baseline centroid from the first N traces, then compares
+ * subsequent traces against this centroid using cosine similarity.
+ * Trace-to-trace comparison provides symmetric feature spaces, yielding
+ * meaningful similarity scores (unlike trace-to-card which is structurally
+ * depressed due to asymmetric features).
+ *
+ * Alerts when sustained low similarity is detected (consecutive traces
+ * below threshold).
  *
  * @see SPEC Section 8 and Appendix B.2 for algorithm specification.
  *
- * @param card - Alignment Card to compare against
- * @param traces - List of AP-Traces in chronological order
+ * @param card - Alignment Card (used for card_id and direction inference)
+ * @param traces - List of AP-Traces (sorted chronologically internally)
  * @param similarityThreshold - Alert when similarity drops below (default: 0.30)
  * @param sustainedThreshold - Alert after N consecutive low-similarity traces (default: 3)
  * @returns List of DriftAlert objects for detected drift events
@@ -646,6 +651,16 @@ declare function extractCardFeatures(card: AlignmentCard): FeatureVector;
  * Extract features from an AP-Trace.
  */
 declare function extractTraceFeatures(trace: APTrace): FeatureVector;
+/**
+ * Compute the centroid (element-wise mean) of multiple feature vectors.
+ *
+ * Used by drift detection to build a baseline from the first N traces,
+ * enabling trace-to-trace comparison instead of trace-to-card comparison.
+ *
+ * @param vectors - Array of feature vectors to average
+ * @returns Centroid feature vector
+ */
+declare function computeCentroid(vectors: FeatureVector[]): FeatureVector;
 /**
  * Compute cosine similarity between two feature vectors.
  *
@@ -678,6 +693,6 @@ declare const CONFLICT_PENALTY_MULTIPLIER = 0.5;
 declare const MIN_WORD_LENGTH = 3;
 /** Maximum features to extract from TF-IDF vectorization */
 declare const MAX_TFIDF_FEATURES = 500;
-declare const ALGORITHM_VERSION = "1.1.0";
+declare const ALGORITHM_VERSION = "1.2.0";
 
-export { ALGORITHM_VERSION, type APTrace, type Action, type ActionCategory, type ActionTarget, type ActionType, type AlignmentCard, type AlignmentCardRequest, type AlignmentCardResponse, type Alternative, type AuditCommitment, type AuditStorage, type AutonomyEnvelope, type AutonomyScope, CONFLICT_PENALTY_MULTIPLIER, type Coherence, type CoherenceResult, type CoherenceResultMessage, DEFAULT_SIMILARITY_THRESHOLD, DEFAULT_SUSTAINED_TURNS_THRESHOLD, type DataSharing, type Decision, type DriftAlert, type DriftAnalysis, type DriftDirection, type DriftIndicator, type Escalation, type EscalationStatus, type EscalationTrigger, type HierarchyType, MAX_TFIDF_FEATURES, MIN_COHERENCE_FOR_PROCEED, MIN_WORD_LENGTH, type MonetaryValue, NEAR_BOUNDARY_THRESHOLD, type Principal, type PrincipalResponse, type PrincipalType, type ProposedCollaboration, type ProposedResolution, type RelationshipType, type RequesterInfo, type Severity, type Signature, type StorageType, type TamperEvidence, type TaskContext, type TraceContext, type TriggerAction, type TriggerCheck, VIOLATION_SEVERITY, type ValueAlignment, type ValueAlignmentDetail, type ValueCoherenceCheck, type ValueCoherenceMessage, type ValueConflict, type ValueConflictResult, type ValueDefinition, type Values, type VerificationMetadata, type VerificationResult, type Violation, type ViolationType, type Warning, checkCoherence, cosineSimilarity, createViolation, detectDrift, extractCardFeatures, extractTraceFeatures, getSelectedAlternative, hadViolations, hasValue, isActionBounded, isActionForbidden, isCardExpired, verifyTrace, wasEscalated };
+export { ALGORITHM_VERSION, type APTrace, type Action, type ActionCategory, type ActionTarget, type ActionType, type AlignmentCard, type AlignmentCardRequest, type AlignmentCardResponse, type Alternative, type AuditCommitment, type AuditStorage, type AutonomyEnvelope, type AutonomyScope, CONFLICT_PENALTY_MULTIPLIER, type Coherence, type CoherenceResult, type CoherenceResultMessage, DEFAULT_SIMILARITY_THRESHOLD, DEFAULT_SUSTAINED_TURNS_THRESHOLD, type DataSharing, type Decision, type DriftAlert, type DriftAnalysis, type DriftDirection, type DriftIndicator, type Escalation, type EscalationStatus, type EscalationTrigger, type HierarchyType, MAX_TFIDF_FEATURES, MIN_COHERENCE_FOR_PROCEED, MIN_WORD_LENGTH, type MonetaryValue, NEAR_BOUNDARY_THRESHOLD, type Principal, type PrincipalResponse, type PrincipalType, type ProposedCollaboration, type ProposedResolution, type RelationshipType, type RequesterInfo, type Severity, type Signature, type StorageType, type TamperEvidence, type TaskContext, type TraceContext, type TriggerAction, type TriggerCheck, VIOLATION_SEVERITY, type ValueAlignment, type ValueAlignmentDetail, type ValueCoherenceCheck, type ValueCoherenceMessage, type ValueConflict, type ValueConflictResult, type ValueDefinition, type Values, type VerificationMetadata, type VerificationResult, type Violation, type ViolationType, type Warning, checkCoherence, computeCentroid, cosineSimilarity, createViolation, detectDrift, extractCardFeatures, extractTraceFeatures, getSelectedAlternative, hadViolations, hasValue, isActionBounded, isActionForbidden, isCardExpired, verifyTrace, wasEscalated };

package/dist/index.js

@@ -30,6 +30,7 @@ __export(index_exports, {
   NEAR_BOUNDARY_THRESHOLD: () => NEAR_BOUNDARY_THRESHOLD,
   VIOLATION_SEVERITY: () => VIOLATION_SEVERITY,
   checkCoherence: () => checkCoherence,
+  computeCentroid: () => computeCentroid,
   cosineSimilarity: () => cosineSimilarity,
   createViolation: () => createViolation,
   detectDrift: () => detectDrift,
@@ -54,7 +55,7 @@ var MIN_COHERENCE_FOR_PROCEED = 0.7;
 var CONFLICT_PENALTY_MULTIPLIER = 0.5;
 var MIN_WORD_LENGTH = 3;
 var MAX_TFIDF_FEATURES = 500;
-var ALGORITHM_VERSION = "1.1.0";
+var ALGORITHM_VERSION = "1.2.0";
 
 // src/verification/features.ts
 var STOPWORDS = /* @__PURE__ */ new Set([
@@ -157,6 +158,20 @@ function extractTraceFeatures(trace) {
   }
   return features;
 }
+function computeCentroid(vectors) {
+  if (vectors.length === 0) return {};
+  const centroid = {};
+  for (const vec of vectors) {
+    for (const [key, value] of Object.entries(vec)) {
+      centroid[key] = (centroid[key] ?? 0) + value;
+    }
+  }
+  const n = vectors.length;
+  for (const key of Object.keys(centroid)) {
+    centroid[key] /= n;
+  }
+  return centroid;
+}
 function cosineSimilarity(a, b) {
   const keysA = Object.keys(a);
   const keysB = new Set(Object.keys(b));
@@ -400,17 +415,33 @@ function checkCoherence(myCard, theirCard, taskValues) {
   };
 }
 function detectDrift(card, traces, similarityThreshold = DEFAULT_SIMILARITY_THRESHOLD, sustainedThreshold = DEFAULT_SUSTAINED_TURNS_THRESHOLD) {
-  if (traces.length < sustainedThreshold) {
+  const sorted = [...traces].sort(
+    (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()
+  );
+  const baselineSize = Math.max(
+    sustainedThreshold,
+    Math.min(10, Math.floor(sorted.length / 4))
+  );
+  if (sorted.length < baselineSize + sustainedThreshold) {
     return [];
   }
-  const cardFeatures = extractCardFeatures(card);
+  const baselineFeatures = sorted.slice(0, baselineSize).map((t) => extractTraceFeatures(t));
+  const baselineCentroid = computeCentroid(baselineFeatures);
   const alerts = [];
   let lowSimilarityStreak = [];
   const escalationRates = [];
   const valueUsage = {};
-  for (const trace of traces) {
+  for (const trace of sorted.slice(0, baselineSize)) {
+    const escalation = trace.escalation;
+    escalationRates.push(escalation?.required ? 1 : 0);
+    for (const value of trace.decision.values_applied ?? []) {
+      valueUsage[value] = (valueUsage[value] ?? 0) + 1;
+    }
+  }
+  for (let i = baselineSize; i < sorted.length; i++) {
+    const trace = sorted[i];
     const traceFeatures = extractTraceFeatures(trace);
-    const similarity = cosineSimilarity(traceFeatures, cardFeatures);
+    const similarity = cosineSimilarity(traceFeatures, baselineCentroid);
     const escalation = trace.escalation;
     escalationRates.push(escalation?.required ? 1 : 0);
     for (const value of trace.decision.values_applied ?? []) {
@@ -601,6 +632,7 @@ function hadViolations(trace) {
   NEAR_BOUNDARY_THRESHOLD,
   VIOLATION_SEVERITY,
   checkCoherence,
+  computeCentroid,
   cosineSimilarity,
   createViolation,
   detectDrift,

package/dist/index.mjs

@@ -6,7 +6,7 @@ var MIN_COHERENCE_FOR_PROCEED = 0.7;
 var CONFLICT_PENALTY_MULTIPLIER = 0.5;
 var MIN_WORD_LENGTH = 3;
 var MAX_TFIDF_FEATURES = 500;
-var ALGORITHM_VERSION = "1.1.0";
+var ALGORITHM_VERSION = "1.2.0";
 
 // src/verification/features.ts
 var STOPWORDS = /* @__PURE__ */ new Set([
@@ -109,6 +109,20 @@ function extractTraceFeatures(trace) {
   }
   return features;
 }
+function computeCentroid(vectors) {
+  if (vectors.length === 0) return {};
+  const centroid = {};
+  for (const vec of vectors) {
+    for (const [key, value] of Object.entries(vec)) {
+      centroid[key] = (centroid[key] ?? 0) + value;
+    }
+  }
+  const n = vectors.length;
+  for (const key of Object.keys(centroid)) {
+    centroid[key] /= n;
+  }
+  return centroid;
+}
 function cosineSimilarity(a, b) {
   const keysA = Object.keys(a);
   const keysB = new Set(Object.keys(b));
@@ -352,17 +366,33 @@ function checkCoherence(myCard, theirCard, taskValues) {
   };
 }
 function detectDrift(card, traces, similarityThreshold = DEFAULT_SIMILARITY_THRESHOLD, sustainedThreshold = DEFAULT_SUSTAINED_TURNS_THRESHOLD) {
-  if (traces.length < sustainedThreshold) {
+  const sorted = [...traces].sort(
+    (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()
+  );
+  const baselineSize = Math.max(
+    sustainedThreshold,
+    Math.min(10, Math.floor(sorted.length / 4))
+  );
+  if (sorted.length < baselineSize + sustainedThreshold) {
     return [];
   }
-  const cardFeatures = extractCardFeatures(card);
+  const baselineFeatures = sorted.slice(0, baselineSize).map((t) => extractTraceFeatures(t));
+  const baselineCentroid = computeCentroid(baselineFeatures);
   const alerts = [];
   let lowSimilarityStreak = [];
   const escalationRates = [];
   const valueUsage = {};
-  for (const trace of traces) {
+  for (const trace of sorted.slice(0, baselineSize)) {
+    const escalation = trace.escalation;
+    escalationRates.push(escalation?.required ? 1 : 0);
+    for (const value of trace.decision.values_applied ?? []) {
+      valueUsage[value] = (valueUsage[value] ?? 0) + 1;
+    }
+  }
+  for (let i = baselineSize; i < sorted.length; i++) {
+    const trace = sorted[i];
     const traceFeatures = extractTraceFeatures(trace);
-    const similarity = cosineSimilarity(traceFeatures, cardFeatures);
+    const similarity = cosineSimilarity(traceFeatures, baselineCentroid);
     const escalation = trace.escalation;
     escalationRates.push(escalation?.required ? 1 : 0);
     for (const value of trace.decision.values_applied ?? []) {
@@ -552,6 +582,7 @@ export {
   NEAR_BOUNDARY_THRESHOLD,
   VIOLATION_SEVERITY,
   checkCoherence,
+  computeCentroid,
   cosineSimilarity,
   createViolation,
   detectDrift,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mnemom/agent-alignment-protocol",
-  "version": "0.1.4",
+  "version": "0.1.6",
   "description": "Agent Alignment Protocol (AAP) - Verification and drift detection for AI agents",
   "main": "dist/index.js",
   "module": "dist/index.mjs",

package/src/constants.ts

@@ -41,4 +41,4 @@ export const MAX_TFIDF_FEATURES = 500;
 
 // Version
 // -------
-export const ALGORITHM_VERSION = "1.1.0";
+export const ALGORITHM_VERSION = "1.2.0";

package/src/index.ts

@@ -124,6 +124,7 @@ export {
 } from "./schemas/ap-trace";
 
 export {
+  computeCentroid,
   extractCardFeatures,
   extractTraceFeatures,
   cosineSimilarity,

package/src/verification/api.ts

@@ -20,8 +20,8 @@ import {
 import type { AlignmentCard } from "../schemas/alignment-card";
 import type { APTrace } from "../schemas/ap-trace";
 import {
+  computeCentroid,
   cosineSimilarity,
-  extractCardFeatures,
   extractTraceFeatures,
 } from "./features";
 import {
@@ -319,14 +319,19 @@ export function checkCoherence(
 /**
  * Detect behavioral drift from declared alignment.
  *
- * Analyzes traces chronologically, computing similarity between each
- * trace's behavior and the declared alignment. Alerts when sustained
- * low similarity is detected (consecutive traces below threshold).
+ * Computes a baseline centroid from the first N traces, then compares
+ * subsequent traces against this centroid using cosine similarity.
+ * Trace-to-trace comparison provides symmetric feature spaces, yielding
+ * meaningful similarity scores (unlike trace-to-card which is structurally
+ * depressed due to asymmetric features).
+ *
+ * Alerts when sustained low similarity is detected (consecutive traces
+ * below threshold).
  *
  * @see SPEC Section 8 and Appendix B.2 for algorithm specification.
  *
- * @param card - Alignment Card to compare against
- * @param traces - List of AP-Traces in chronological order
+ * @param card - Alignment Card (used for card_id and direction inference)
+ * @param traces - List of AP-Traces (sorted chronologically internally)
  * @param similarityThreshold - Alert when similarity drops below (default: 0.30)
  * @param sustainedThreshold - Alert after N consecutive low-similarity traces (default: 3)
  * @returns List of DriftAlert objects for detected drift events
@@ -337,11 +342,27 @@ export function detectDrift(
   similarityThreshold = DEFAULT_SIMILARITY_THRESHOLD,
   sustainedThreshold = DEFAULT_SUSTAINED_TURNS_THRESHOLD
 ): DriftAlert[] {
-  if (traces.length < sustainedThreshold) {
+  // Sort traces chronologically
+  const sorted = [...traces].sort(
+    (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()
+  );
+
+  // Compute baseline window size
+  const baselineSize = Math.max(
+    sustainedThreshold,
+    Math.min(10, Math.floor(sorted.length / 4))
+  );
+
+  // Need enough traces for baseline + sustained threshold
+  if (sorted.length < baselineSize + sustainedThreshold) {
     return [];
   }
 
-  const cardFeatures = extractCardFeatures(card);
+  // Extract features for baseline traces and compute centroid
+  const baselineFeatures = sorted
+    .slice(0, baselineSize)
+    .map((t) => extractTraceFeatures(t));
+  const baselineCentroid = computeCentroid(baselineFeatures);
 
   const alerts: DriftAlert[] = [];
   let lowSimilarityStreak: Array<{ trace: APTrace; similarity: number }> = [];
@@ -350,9 +371,20 @@ export function detectDrift(
   const escalationRates: number[] = [];
   const valueUsage: Record<string, number> = {};
 
-  for (const trace of traces) {
+  // Include baseline traces in escalation/value tracking
+  for (const trace of sorted.slice(0, baselineSize)) {
+    const escalation = trace.escalation;
+    escalationRates.push(escalation?.required ? 1.0 : 0.0);
+    for (const value of trace.decision.values_applied ?? []) {
+      valueUsage[value] = (valueUsage[value] ?? 0) + 1;
+    }
+  }
+
+  // Iterate from after baseline to end
+  for (let i = baselineSize; i < sorted.length; i++) {
+    const trace = sorted[i];
     const traceFeatures = extractTraceFeatures(trace);
-    const similarity = cosineSimilarity(traceFeatures, cardFeatures);
+    const similarity = cosineSimilarity(traceFeatures, baselineCentroid);
 
     // Track escalation rate
     const escalation = trace.escalation;

package/src/verification/features.ts

@@ -67,7 +67,7 @@ export function extractCardFeatures(card: AlignmentCard): FeatureVector {
     }
   }
 
-  // Principal features (distinct namespace from trace action categories)
+  // Principal features (matching Python SDK naming)
   features[`principal_type:${card.principal.type}`] = 1.0;
   features[`relationship:${card.principal.relationship}`] = 1.0;
 
@@ -114,6 +114,30 @@ export function extractTraceFeatures(trace: APTrace): FeatureVector {
   return features;
 }
 
+/**
+ * Compute the centroid (element-wise mean) of multiple feature vectors.
+ *
+ * Used by drift detection to build a baseline from the first N traces,
+ * enabling trace-to-trace comparison instead of trace-to-card comparison.
+ *
+ * @param vectors - Array of feature vectors to average
+ * @returns Centroid feature vector
+ */
+export function computeCentroid(vectors: FeatureVector[]): FeatureVector {
+  if (vectors.length === 0) return {};
+  const centroid: FeatureVector = {};
+  for (const vec of vectors) {
+    for (const [key, value] of Object.entries(vec)) {
+      centroid[key] = (centroid[key] ?? 0) + value;
+    }
+  }
+  const n = vectors.length;
+  for (const key of Object.keys(centroid)) {
+    centroid[key] /= n;
+  }
+  return centroid;
+}
+
 /**
  * Compute cosine similarity between two feature vectors.
  *