Temporal Trinary Logic (00): Hardware-Enforced Irreversibility for Sparse Computing and Branch Pruning

Temporal Trinary Logic (00) introduces a hardware-enforced absorbing state designed to prune dead or unviable computation branches permanently at the silicon level. Unlike standard binary logic or traditional three-valued logic systems—where unknown states (X or ⊥) can be overwritten or reset on subsequent clock cycles—Temporal Trinary Logic enforces strict time-dependent irreversibility: once a logic node enters the 00 (Terminated / T-Lock) state, it latches permanently until a global domain reset, immediately severing downstream clock distribution and operand switching. Key Highlights in v2.4: Architectural Foundations: Defines the formal state-transition rules and clock-domain gating mechanics for 00 state propagation, shifting branch pruning from software control loops into physical hardware. Cycle-Accurate Simulation Results: Includes full Python verification suites (Temporal_Trinary_Sim_v2_4.pdf) evaluating switching activity reductions across three workloads: Test A (Sparse Tree Traversal): Prunes dead search branches immediately upon constraint violation. Test B (Streaming Packet Filtering): Halts downstream pipeline registers upon header mismatch. Test C (MAC Operand Gating): Zeroes out dynamic switching power in Multiply-Accumulate units when zero-weights or pruned activations are detected. Hardware RTL Verification: References the synthesizable Verilog RTL implementation (t_lock_core.v), verifying zero-cycle latch lockup and downstream clock-gating behavior in simulation.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24398574
Primary Topic
Low-power high-performance VLSI design
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Temporal Trinary Logic (00): Hardware-Enforced Irreversibility for Sparse Computing and Branch Pruning

Peter Hunt
1 links
Zenodo (CERN European Organization for Nuclear Research)
Low-power high-performance VLSI design
article

Temporal Trinary Logic (00): Hardware-Enforced Irreversibility for Sparse Computing and Branch Pruning

Peter Hunt
article en

Abstract

Temporal Trinary Logic (00) introduces a hardware-enforced absorbing state designed to prune dead or unviable computation branches permanently at the silicon level. Unlike standard binary logic or traditional three-valued logic systems—where unknown states (X or ⊥) can be overwritten or reset on subsequent clock cycles—Temporal Trinary Logic enforces strict time-dependent irreversibility: once a logic node enters the 00 (Terminated / T-Lock) state, it latches permanently until a global domain reset, immediately severing downstream clock distribution and operand switching. Key Highlights in v2.4: Architectural Foundations: Defines the formal state-transition rules and clock-domain gating mechanics for 00 state propagation, shifting branch pruning from software control loops into physical hardware. Cycle-Accurate Simulation Results: Includes full Python verification suites (Temporal_Trinary_Sim_v2_4.pdf) evaluating switching activity reductions across three workloads: Test A (Sparse Tree Traversal): Prunes dead search branches immediately upon constraint violation. Test B (Streaming Packet Filtering): Halts downstream pipeline registers upon header mismatch. Test C (MAC Operand Gating): Zeroes out dynamic switching power in Multiply-Accumulate units when zero-weights or pruned activations are detected. Hardware RTL Verification: References the synthesizable Verilog RTL implementation (t_lock_core.v), verifying zero-cycle latch lockup and downstream clock-gating behavior in simulation.

Zenodo (CERN European Organization for Nuclear Research)
Low-power high-performance VLSI design
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon