Crate penrose_memory 

Penrose Memory

Aperiodic memory palace for AI agents.

Embeddings are projected to 2D Penrose coordinates using golden-ratio hashing. The Fibonacci word determines tile bits (thick:thin → 1/φ). Matching rules verify valid positions. Recall uses dead reckoning: walk from query toward stored memories. 3-coloring for sharding, golden hierarchy (φ^k) for deflation.

Quick Start

use penrose_memory::PenroseMemory;

let mut pm = PenroseMemory::new(4);

// Store an embedding with content
let id = pm.store(&[0.1, 0.2, 0.3, 0.4], 42);

// Recall by nearest embedding
let results = pm.recall(&[0.1, 0.2, 0.3, 0.39], 5);
assert!(!results.is_empty());
assert_eq!(results[0].content, 42);

Modules

compiler

High-level fleet tiling API.

cut_and_project

Generalized cut-and-project compiler.

tensor_tile

Tensor-valued Penrose tiling — reverse actualization through the lattice.

Structs

LamportClock

Lamport clock for causal ordering across agents.

MemoryPrediction

A prediction about where a memory will be found.

PenroseMemory

Aperiodic memory palace navigated by dead reckoning.

RecallResult

Result of a recall operation.

Enums

TileLifecycle

Tile lifecycle states — mirrors PLATO v3.