Nature

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing

The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and ...
Nature

A compact digital compute-in-memory Ising annealer with probabilistic SRAM bit in 28 nm for travelling salesman problem

Combinatorial optimization problems (COPs) are critical to applications across logistics, VLSI design, and scientific discovery, yet remain challenging due to their NP-hard nature. Ising model-based ...
Semiconductor Engineering

Memory Wall Gets Higher

An increasing percentage of the chip area is consumed by the same amount of SRAM for each node shrink. The problem is not limited to leading-edge AI, as it will eventually impact even small MCUs and ...
Morningstar

Breaking the 100M Token Limit: EverMind's MSA Architecture Achieves Efficient End-to-End Long-Term Memory for LLMs

The research introduces a novel memory architecture called MSA (Memory Sparse Attention). Through a combination of the Memory Sparse Attention mechanism, Document-wise RoPE for extreme context ...