523c072818
Phase 3 — vault exact recall index: - Replace O(N) np.array_equal scan with hash-based exact-match index - Add optional max_entries with deterministic FIFO eviction - Index rebuilds on reproject for consistency Phase 4 — Rust versor_apply parity: - Fix CGA metric signature (+,+,+,+,-) and blade ordering to match Python - Implement versor_apply_closed with null-vector preservation, f64 unitize, and construction seed fallback matching Python closure semantics - Gate Rust dispatch behind CORE_BACKEND=rust; Python remains default - Add f64 geometric product for closure-path precision Phase 5 — cognitive quality pack expansion: - Expand lexicon from 55 to 70 entries (evidence, inference, procedure, verification, distinction, relation, thought, understanding, judgment, principle, order, connectives) - Improve semantic templates for cause, procedure, comparison, recall, verification intents - Expand eval cases from 20 to 45 across all categories Validation: 491 tests pass, 45 eval cases at 100% all metrics.
87 lines
2.6 KiB
Python
87 lines
2.6 KiB
Python
"""
|
|
Backend dispatch: use Rust extension (core_rs) when available,
|
|
fall back to pure Python (algebra/cl41.py etc.) transparently.
|
|
|
|
This module is the single switch. All algebra modules import from here
|
|
for performance-critical ops. Pure Python is always the fallback —
|
|
the system is never broken by a missing Rust build.
|
|
|
|
Usage:
|
|
from algebra.backend import geometric_product, versor_apply, cga_inner, vault_recall
|
|
"""
|
|
|
|
import os
|
|
|
|
import numpy as np
|
|
|
|
_REQUESTED_BACKEND = os.environ.get("CORE_BACKEND", "").strip().lower()
|
|
_ALLOW_RUST = _REQUESTED_BACKEND not in {"numpy", "python", "py"}
|
|
|
|
try:
|
|
import core_rs as _rs
|
|
_RUST = _ALLOW_RUST
|
|
except ImportError:
|
|
_RUST = False
|
|
|
|
|
|
def geometric_product(A: np.ndarray, B: np.ndarray) -> np.ndarray:
|
|
if _RUST:
|
|
return np.asarray(_rs.geometric_product(A, B), dtype=np.float32)
|
|
from algebra.cl41 import geometric_product as _gp
|
|
return _gp(A, B)
|
|
|
|
|
|
def versor_apply(V: np.ndarray, F: np.ndarray) -> np.ndarray:
|
|
"""Apply a versor through the canonical algebra closure boundary.
|
|
|
|
When CORE_BACKEND=rust is set and the Rust extension exposes
|
|
versor_apply_with_closure, Rust handles the full closure path
|
|
(null-vector preservation, unitize, seed fallback). Otherwise
|
|
falls back to pure Python algebra.versor.
|
|
"""
|
|
if _RUST and _REQUESTED_BACKEND == "rust":
|
|
try:
|
|
return np.asarray(
|
|
_rs.versor_apply_with_closure(V, F), dtype=np.float32
|
|
)
|
|
except (AttributeError, Exception):
|
|
pass
|
|
from algebra.versor import versor_apply as _va
|
|
return _va(V, F)
|
|
|
|
|
|
def versor_condition(F: np.ndarray) -> float:
|
|
if _RUST:
|
|
return float(_rs.versor_condition(F))
|
|
from algebra.versor import versor_condition as _vc
|
|
return _vc(F)
|
|
|
|
|
|
def cga_inner(X: np.ndarray, Y: np.ndarray) -> float:
|
|
if _RUST:
|
|
return float(_rs.cga_inner(X, Y))
|
|
from algebra.cga import cga_inner as _ci
|
|
return _ci(X, Y)
|
|
|
|
|
|
def vault_recall(versors: list, query: np.ndarray, top_k: int = 5) -> list:
|
|
"""
|
|
Top-k CGA inner product recall.
|
|
Rust path: parallel Rayon scan (releases GIL, true multithreaded).
|
|
Python path: sequential list comprehension.
|
|
"""
|
|
if _RUST:
|
|
try:
|
|
results = _rs.vault_recall(versors, query, top_k)
|
|
return results
|
|
except Exception:
|
|
pass
|
|
q = np.asarray(query)
|
|
scores = [(i, float(cga_inner(q, np.asarray(v)))) for i, v in enumerate(versors)]
|
|
scores.sort(key=lambda x: -x[1])
|
|
return scores[:top_k]
|
|
|
|
|
|
def using_rust() -> bool:
|
|
"""Returns True if the Rust extension is loaded."""
|
|
return _RUST
|