valentinus-v1.3.0

Valentinus v1.3.0 Release Notes

The Hexagonal Close Packing (HCP) Architecture Upgrade

We are thrilled to announce Valentinus v1.3.0. This release marks a fundamental shift in how Valentinus handles spatial indexing and high-dimensional vector search. By stepping away from computationally expensive floating-point algorithms (like KD-Trees) and migrating to a mathematically perfect geometric grid, we have drastically reduced CPU overhead while maintaining pinpoint semantic accuracy.

This makes Valentinus faster, leaner, and uniquely suited for local, edge, and off-grid deployments where computing resources and power are at a premium.

🚀 Major Features & Architectural Shifts

• O(1) Geometric Routing: We have completely bypassed iterative array scans and Euclidean distance calculations at query time. Valentinus now uses integer-based Hexagonal Cube Coordinates (q,r,s) to instantly bucket and retrieve vectors via O(1) Hash Map lookups.
• The vecpac Integration: Valentinus is now officially powered by the vecpac crate. This lightweight spatial indexer handles all fraction-to-integer quantization, ensuring every embedded vector snaps perfectly into the Seed of Life hexagonal grid.
• Dimensionality Reduction Pipeline: We implemented a deterministic, pseudo-random projection algorithm that gracefully compresses n-dimensional ONNX embeddings down to a 2D geometric "shadow" for indexing, entirely preserving local semantic neighborhoods without requiring heavy machine learning crates.
• IVF-Hex (Inverted File Hex-Indexing) & Fallback Routing: To combat the Curse of Dimensionality and sparse datasets, Valentinus now intelligently utilizes the Principle of Multiplicity. If a target hex bucket is empty, the engine instantly expands its search to the 6 equidistant neighboring buckets, falling back to a global cosine-similarity scan only when absolutely necessary.
• Zero-Overhead Serialization (The Tuple Trick): To maintain blazing-fast read/write speeds, the new geometric hash map is serialized using native (i32, i32, i32) tuples, entirely bypassing complex crate-to-crate trait inheritance while remaining fully compatible with wincode.

🛠 Improvements & Optimizations

• Insertion-Time Indexing: The heavy lifting has been shifted from query time to insertion time. Collections now pre-calculate and cache their geometric buckets natively, making nearest-neighbor queries near-instantaneous.
• Lower Power Footprint: By replacing floating-point iteration with pure integer math, the database requires significantly less active CPU time per query.

Full Changelog: v1.2.1...v1.3.0