Struct PenroseMemory 

pub struct PenroseMemory { /* private fields */ }

Aperiodic memory palace navigated by dead reckoning.

Embeddings are projected to 2D Penrose coordinates using golden-ratio hashing. The Fibonacci word determines tile bits. Recall walks from query toward stored memories via dead reckoning.

Implementations

impl PenroseMemory

pub fn new(embedding_dim: usize) -> Self

Create a new PenroseMemory with the given embedding dimension.

pub fn store(&mut self, embedding: &[f64], content: u64) -> u64

Store an embedding with associated content.

Projects the embedding to 2D Penrose coordinates and stores it. Returns the tile_id.

pub fn recall(&self, query: &[f64], max_steps: usize) -> Vec<RecallResult>

Recall memories by dead reckoning from a query embedding.

Projects the query to 2D, then finds the closest stored tiles. Dead reckoning: we walk from the query point toward stored memories, measuring distance and confidence at each step.

max_steps controls how many intermediate waypoints to check along the path to each candidate.

pub fn navigate(&self, tile_id: u64, distance: f64, heading: f64) -> Vec<u64>

Navigate from a tile by distance and heading.

Dead reckoning navigation: start from the given tile, walk the specified distance at the given heading, and find tiles near the destination. Returns tile IDs of tiles found within the arrival radius.

pub fn consolidate(&mut self)

Consolidate (deflate) old memories using golden hierarchy.

Tiles at level 0 that are close together (within φ^1 distance) are merged into a single tile at level 1. The merged content is XOR’d. Returns the number of tiles removed.

pub fn len(&self) -> usize

Number of stored tiles.

pub fn matching_rule_holds(&self, qx: i64, qy: i64) -> bool

Check matching rules at a lattice position. A tile matches if it has at least one neighbor of the opposite type.

pub fn get_tile_bit(&self, qx: i64, qy: i64) -> bool

Get the golden-ratio hash bit for a position.

pub fn get_color(&self, qx: i64, qy: i64) -> u8

Get the 3-coloring for a position.

pub fn is_empty(&self) -> bool

Check if the memory is empty.

pub fn supersede_tile(&mut self, tile_id: u64) -> Option<u64>

Supersede a tile — mark old as Superseded, return its content.

pub fn retract_tile(&mut self, tile_id: u64) -> bool

Retract a tile — mark as Retracted with reason.

pub fn active_tile_ids(&self) -> Vec<u64>

Get only active tile IDs.

pub fn lifecycle_stats(&self) -> (usize, usize, usize)

Count tiles by lifecycle state.

pub fn predict_recall( &self, query: &[f64], clock: &mut LamportClock, ) -> MemoryPrediction

Predict where a memory will be found before walking there. Uses the same projection as recall but without executing the walk.

pub fn confirm_prediction( &self, prediction: &mut MemoryPrediction, actual: &[RecallResult], ) -> bool

Confirm a prediction against actual recall results.

Trait Implementations

impl Default for PenroseMemory

fn default() -> Self

Returns the “default value” for a type.