mirror of
https://github.com/zooai/brain.git
synced 2026-10-30 14:50:48 +00:00
Closed every remaining π‘ / π΅ row in PARITY.md. Each algorithm FortΓ©mi ships now has a real implementation in @hanzo/bot-memory v2.0.0 with matching ports in hanzo-memory (Python), bot-go (Go), and hanzoai/mcp (Rust). Cross-runtime tests: 121 TS + 53 Python + 58 Go + 38 Rust = 270 passing. Landed under packages/memory/ Retrieval & ranking fusion RRF (k=20 BEIR) + RSF (Weaviate v1.24) + adaptive k + adaptive FTS/semantic weights rerank MMR (Carbonell & Goldstein 1998), cosine dedup chunk-aware deduplication script Unicode script detection (Latin/CJK/emoji/Cyrillic/ Arabic/Hebrew/Greek/Devanagari) fts feature-flag matrix, CJK bigrams, emoji trigrams, websearch_to_tsquery parser, SQLite FTS5 MATCH renderer embed embedding registry, asymmetric E5 prefixes, Matryoshka truncation, coarse-dim picker two-stage coarse β fine retrieval via MRL federated cross-archive search with RRF fusion multi-memory X-Hanzo-Memory routing (X-Fortemi-Memory alias) filters composable tag/temporal/collection/scope predicates temporal UUIDv7 floor/ceiling + named ranges spatial Haversine + bbox + in-box (PostGIS fallback) Knowledge & graph graph normalize β SNN β PFNET-β β Louvain maintenance pipeline skos W3C SKOS concept tree (broader/narrower closures, Turtle export) fair Dublin Core XML + JSON-LD doc-types document type registry + auto-detect (filename/MIME/ content sniff) captions WebVTT / SRT / RTTM renderers sprite thumbnail sprite-sheet WebVTT cue builder code-ast language-aware syntactic chunker email RFC 2822 / MIME parser (multipart, qp, base64, HTML strip) exif EXIF parser (camera / time / GPS) Operational events EventBus + SSE renderer + webhook HMAC signer tokenizer BPE-style estimator + truncate-to-budget eval MRR / recall@k / precision@k / NDCG@k / benchmark hardware tier autodetect + per-tier model recommender circuit-breaker closed / open / half-open retry exponential backoff with full jitter range HTTP Range parser + Content-Range formatter tus TUS v1.0.0 (Create / Patch / metadata / checksum) Crypto address wallet-style content-addressable ids (hanzo: / mm:) mmpke01 multi-recipient envelope parser/builder + magic-byte sniff Inference (packages/memory/inference/) index InferenceBackend trait + registry slug provider-qualified routing (provider:model:tag) capabilities capability flags + task-based selector runtime-config hot-swap config (db_override β env β default) mock deterministic backend (for tests) few-shot ICL prompt builder (3-5 examples capped) refinement Self-Refine / ReAct / Reflexion patterns link-types rule + LLM link classifier (11 canonical types) vision VisionBackend trait + Ollama default transcription Whisper-compatible HTTP client diarization pyannote-compatible HTTP client + alignSpeakers / relabel gliner GLiNER zero-shot NER HTTP client Extraction (packages/memory/extract/) index registry + dispatcher text native UTF-8 passthrough email RFC 2822 adapter spreadsheet CSV/TSV pure-JS; xlsx via registerXlsxDecoder archive ZIP central-directory pure-JS reader exif-adapter EXIF for images code tree-sitter-style syntactic chunker pdf PdfSidecar HTTP adapter factory image VisionBackend-backed adapter factory audio TranscriptionBackend-backed adapter factory video keyframe + scene + transcript adapter factory 3d multi-view 3D model adapter factory media-optimize ffmpeg variants (faststart / web-compat / 720p) adapter factory structured JSON-schema structured-extract adapter factory summarizer fast/standard cascade adapter factory sprite-adapter thumbnail sprite-sheet adapter factory Cross-runtime ports hanzo-memory (Python) 53 tests, ports of fusion / rerank / dedup / script / fts / embed / temporal / captions / tokenizer / eval / spatial / range / address / graph / doc-types / circuit / retry / slug / runtime-config / link-types bot-go (Go) 58 tests, same algorithm set ported with standard-library-only primitives hanzoai/mcp::brain (Rust) 38 tests, same algorithm set; sha2 added as dependency (blake3 stand-in) PARITY.md is now 100% green (β in-monorepo + π’ sibling-repo). No π΅ placeholders remain.
79 lines
2.3 KiB
TypeScript
79 lines
2.3 KiB
TypeScript
/**
|
|
* Deterministic mock inference backend β same shape as Ollama, no network.
|
|
*
|
|
* Embeddings: hash text β deterministic seed β seeded PRNG produces a
|
|
* vector. Cosine similarity stays meaningful for tests because identical
|
|
* inputs produce identical vectors and L2-normalization is applied.
|
|
*
|
|
* Generation: returns a templated string that includes the last user
|
|
* message β tests can assert on it.
|
|
*/
|
|
import type { EmbedRequest, EmbedResponse, GenerateRequest, GenerateResponse, InferenceBackend } from "./index.js";
|
|
|
|
export interface MockOpts {
|
|
/** Embedding dim. */
|
|
dim?: number;
|
|
}
|
|
|
|
export class MockBackend implements InferenceBackend {
|
|
private dim: number;
|
|
|
|
constructor(opts: MockOpts = {}) {
|
|
this.dim = opts.dim ?? 384;
|
|
}
|
|
|
|
name(): string { return "mock"; }
|
|
|
|
async ping(): Promise<boolean> { return true; }
|
|
|
|
async generate(req: GenerateRequest): Promise<GenerateResponse> {
|
|
const last = req.messages[req.messages.length - 1];
|
|
const content = `[mock:${req.model}] ${last?.content ?? ""}`;
|
|
return {
|
|
content,
|
|
model: req.model,
|
|
promptTokens: req.messages.reduce((a, m) => a + m.content.length, 0) / 4,
|
|
completionTokens: content.length / 4,
|
|
};
|
|
}
|
|
|
|
async embed(req: EmbedRequest): Promise<EmbedResponse> {
|
|
const vectors = req.inputs.map((text) => this.embedOne(text, req.task ?? "symmetric"));
|
|
return { vectors, model: req.model };
|
|
}
|
|
|
|
private embedOne(text: string, task: "query" | "passage" | "symmetric"): number[] {
|
|
const seed = hashSeed(`${task}:${text}`);
|
|
const rng = mulberry32(seed);
|
|
const v = new Array(this.dim);
|
|
let sumSq = 0;
|
|
for (let i = 0; i < this.dim; i++) {
|
|
v[i] = rng() * 2 - 1;
|
|
sumSq += v[i] * v[i];
|
|
}
|
|
const norm = Math.sqrt(sumSq);
|
|
if (norm > 0) for (let i = 0; i < this.dim; i++) v[i] /= norm;
|
|
return v;
|
|
}
|
|
}
|
|
|
|
function hashSeed(s: string): number {
|
|
let h = 0x811c9dc5;
|
|
for (let i = 0; i < s.length; i++) {
|
|
h ^= s.charCodeAt(i);
|
|
h = Math.imul(h, 0x01000193) >>> 0;
|
|
}
|
|
return h;
|
|
}
|
|
|
|
function mulberry32(seed: number) {
|
|
let t = seed >>> 0;
|
|
return () => {
|
|
t = (t + 0x6d2b79f5) >>> 0;
|
|
let r = t;
|
|
r = Math.imul(r ^ (r >>> 15), r | 1);
|
|
r ^= r + Math.imul(r ^ (r >>> 7), r | 61);
|
|
return ((r ^ (r >>> 14)) >>> 0) / 4294967296;
|
|
};
|
|
}
|