holographic-memory 0.6.1

A high-performance Holographic Memory System (HMS) implementing Vector Symbolic Architectures (VSA).
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91

// Copyright 2024-2026 WritersLogic Contributors
// SPDX-License-Identifier: AGPL-3.0-or-later

use holographic_memory::core::block_codes::{BlockCodeBundle, BlockCodeConfig, BlockCodeVec};

fn main() {
    let cfg = BlockCodeConfig::default_config(); // 1024x16

    // Same setup as test_recover_from_codebook
    let codebook: Vec<BlockCodeVec> = (0..50)
        .map(|i| BlockCodeVec::new_deterministic(&cfg, i * 31 + 7))
        .collect();
    let relation = BlockCodeVec::new_deterministic(&cfg, 999);

    let mut bundle = BlockCodeBundle::new(&cfg);
    for ci in 0..20 {
        let ki = (ci + 1) % 50;
        let fact = codebook[ci].bind(&relation).bind(&codebook[ki]);
        bundle.add(&fact);
    }

    println!("fact_idx\tcorrect_ki\tdecoded_sim\tbest_idx\tbest_sim\t2nd_sim\trecovered");
    for ci in 0..20 {
        let ki = (ci + 1) % 50;
        let cue = codebook[ci].bind(&relation);
        let decoded = bundle.unbind_and_decode(&cue);
        let correct_sim = decoded.similarity(&codebook[ki]);

        let mut sims: Vec<(usize, f64)> = (0..50)
            .map(|j| (j, decoded.similarity(&codebook[j])))
            .collect();
        sims.sort_by(|a, b| b.1.partial_cmp(&a.1).unwrap());

        println!(
            "{}\t{}\t{:.4}\t{}\t{:.4}\t{:.4}\t{}",
            ci,
            ki,
            correct_sim,
            sims[0].0,
            sims[0].1,
            sims[1].1,
            if sims[0].0 == ki { "YES" } else { "NO" }
        );
    }

    // Now same but with benchmark-style facts (ci=i, ki=0)
    println!("\n# Benchmark-style facts (all ki=0)");
    let codebook2: Vec<BlockCodeVec> = (0..200)
        .map(|i| BlockCodeVec::new_deterministic(&cfg, i as u64 * 31 + 7))
        .collect();
    let relation2 = BlockCodeVec::new_deterministic(&cfg, 999999);

    let mut bundle2 = BlockCodeBundle::new(&cfg);
    // First 20 non-self facts from benchmark pattern
    let mut facts2 = Vec::new();
    let mut sc: u64 = 0;
    while facts2.len() < 20 {
        let ci = (sc as usize) % 200;
        let ki = ((sc as usize) / 200) % 200;
        sc += 1;
        if ci == ki {
            continue;
        }
        facts2.push((ci, ki));
        let fact = codebook2[ci].bind(&relation2).bind(&codebook2[ki]);
        bundle2.add(&fact);
    }

    println!("fact_idx\tci\tki\tdecoded_sim\tbest_idx\tbest_sim\trecovered");
    for (fi, &(ci, ki)) in facts2.iter().enumerate() {
        let cue = codebook2[ci].bind(&relation2);
        let decoded = bundle2.unbind_and_decode(&cue);
        let correct_sim = decoded.similarity(&codebook2[ki]);

        let mut sims: Vec<(usize, f64)> = (0..200)
            .map(|j| (j, decoded.similarity(&codebook2[j])))
            .collect();
        sims.sort_by(|a, b| b.1.partial_cmp(&a.1).unwrap());

        println!(
            "{}\t{}\t{}\t{:.4}\t{}\t{:.4}\t{}",
            fi,
            ci,
            ki,
            correct_sim,
            sims[0].0,
            sims[0].1,
            if sims[0].0 == ki { "YES" } else { "NO" }
        );
    }
}