Low-latency NUMA-aware fork-join thread-pool with zero allocations, syscalls, CAS, or false-sharing on the hot path for C, C++, Rust, and Zig 🍴

OSVVM Utility Library: AlertLogPkg, CoveragePkg, RandomPkg, ScoreboardGenericPkg, MemoryPkg, TbUtilPkg, TranscriptPkg, ...

High speed C/C++ based behavioural VHDL/Verilog co-simulation memory model

Memory consistency modelling using Alloy

[ECCVW2018] A Memory Model based on the Siamese Network for Long-term Tracking (MMLT)

The RC11 memory model in Coq

A low level, modular bytecode, finite register VM focused on safety and extensibility, with plans for a Python like, statically typed language on top.

Labs for Introduction to Computing I

High-salience events slow the internal clock and reinforce memory. Quiet stretches accelerate the clock and let stale items decay. One model. One knob. Adaptive tempo.

"Interactive demo: Memory Model V3 with MLP, timestamps and bypass."

Persistent memory scaffolding for AI agents - Trail, Destination, Improve, Retrospect, Intent, Probe. Self-built across 221 iterations; declared complete only when GPT, Claude, and Gemini independently found nothing left to change.

https://openjdk.java.net/projects/code-tools/jcstress/

Reproducible C# experiments for sparse, overlapping, and dynamic memory engrams

Taming the beast of desync

Memory-native Uniswap v4 hook primitive: FlowPulse emission boundaries and FMM-0 receipt-bound memory consistency for agent histories.

Deterministic, browser-based 3D demo of tiered memory dynamics inside a simplex-bounded tetrahedron. Nodes consolidate across tiers while a pre-clamp out-of-bounds (OOB) signal is monitored with soft/hard events, hysteresis, and cooldown. Static Three.js (no build). Live demo included.

MMCC stands for Memory Model and Cache Coherence *|* In this repository, I push what I learn and code about the memory models and cache coherence protocols to be able to start to research on memory models and cache coherence protocols for GPGPUs and Heterogeneous Systems

Deterministic cross-modal agents with guardrails: signals route through declared transforms, inference can’t self-promote, memory echoes stay associative, and every promotion is auditable with replay artifacts. Built to make agent reasoning inspectable.

A lock-free Multi-Producer Multi-Consumer (MPMC) queue in C++. Includes experiments on memory ordering, false sharing, and performance benchmarking.

Thinking in TLA: a TLA playground to learn algorithms