Ternary Memristive Logic: Hardware for Reasoning Realized via Domain Algebra

Building on resistive communication, this paper presents a physics-based design of an on-chip neural network with multi-level memristive synapses supporting a dense spectrum of conductance states. Derived from ionic transport physics, we develop a state-variable model and quantify storable sub-levels under thermal noise, drift, and quantized conductance. We assemble these devices into a 1T1R crossbar fabric, derive the linear algebra of analog vector-matrix multiplication (VMM) under wire resistance, and design a differential synapse for signed weights. A multilayer pipeline executes inference, backpropagation, and weight updates physically in the analog domain. We derive the in-situ outer-product learning rule, its discretization onto the conductance lattice, and the resulting quantization noise. We provide energy, area, capacity, and inter-tile models, showing this substrate is ideally suited for large language models (LLMs). Our design eliminates weight movement, surpassing binary ReRAM and traditional CMOS. We detail the material stack (HfO_2-based), the FEOL/BEOL CMOS foundry-integration flow, a self-contained SPICE model, the complete memristive-FPGA neuromorphic system, and an in-memory self-attention engine with current-mode translinear softmax. Finally, a ternary BitNet datapath shows projected per-token efficiency orders of magnitude better than advanced CPUs or GPUs. The result is a self-contained hardware-native blueprint for a high-density, analog, in-memory neural processor.

In-memory computing (IMC) is a paradigm that enables neural network inference by computing analog matrix-vector multiplications (MVM) directly in memory crossbar arrays, with the potential for energy efficiency gains over conventional von Neumann architectures. In this work we present a simulation framework for N-ary crossbar architectures that retrieves MVM results with minimal implementation assumptions. The XOR and MNIST classification tasks were successfully inferred using a simulated crossbar array of (4x4) 4-states magnetic tunnel junctions (MTJ). MNIST accuracy reached 93.56% (vs. 97.56% software baseline). PCA dimensionality reduction was shown to drastically lower the number of required operations and improve the software baseline, for only a modest reduction in crossbar inference accuracy. We identified weight quantization as the primary error source, and studied its impact alongside systematic non-idealities and random noise. We find that cell-specific random noise is less detrimental than systematic errors due to averaging across the array. Finally, we demonstrate an optimal number of states per cell that balances quantization error against resistance state resolution to minimize total MVM error.

This paper reports a convergence neither program was looking for. Marcus's The Algebraic Mind named three things any architecture needs -- operations over variables, recursive structure, and individuals distinct from kinds -- showed multilayer perceptrons have none, and left a register-and-treelet implementation as conjecture. Thagard's Brain-Mind ran it from the other end, making binding the mechanism from which the whole of mind is assembled, and circular convolution load-bearing. Marcus leaves his register algebra open; Thagard's is lossy, degrading under the very recursion his own account demands. VaCoAl is a hyperdimensional computing architecture built end-to-end on XOR-and-shift over GF(2) via primitive-polynomial LFSRs; PyVaCoAl is its extended software realization (all results here); the silicon substrate exists as CASRAM. Bind(R,F) = R XOR Shift(F) is exactly reversible and non-commutative: it supplies all three pillars at fixed dimension and removes convolution's depth degradation. Capability: exact reversible binding at O(N) yields compositional generalization with post-hoc auditability, which no lossy or learned substrate offers. Necessity: two independent architecture programs and the dentate gyrus-CA3 circuit require the same algebra -- convergence, not biomimicry. New here: discrimination and failure-tolerance are one. Repair every collision (RR = 1) and the system is bit-identical to a hash dictionary: candidates become indistinguishable and the confidence path-integral collapses; a memory that never fails keeps no record of which routes were hard. Position: we do not surpass large language models but supply the auditable, multi-hop relational reasoning embeddings lack. No consciousness is implemented and no cognitive experiment reported; bit-exactness holds in silicon, approximately under biological noise; speed and power remain unbenchmarked.