Persistent State Machines: LLM Attention with INT4 In-Memory Cells
Published August 2, 2026 | Version v8 Preprint Open Persistent State Machines: Complete Mathematical Proofs and Vivado Implementation Synthesis (Version 8.0) Authors/Creators Esaka, Yusuke1 Show affiliations 1. Cosmos Administrative Scrivener Office & Independent Researcher Description Persistent State Machines: Complete Mathematical Proofs and Vivado Implementation Synthesis (Version 8.0) ABSTRACT We present a formal discrete framework for attention operators in Large Language Models via Persistent State Machines (PSMs). Computation is broadcast to stationary in-memory cells that evaluate local deterministic state transitions.
- ▪Published August 2, 2026 | Version v8 Preprint Open Persistent State Machines: Complete Mathematical Proofs and Vivado Implementation Synthesis (Version 8.0) Authors/Creators Esaka, Yusuke1 Show affiliations 1.
- ▪Cosmos Administrative Scrivener Office & Independent Researcher Description Persistent State Machines: Complete Mathematical Proofs and Vivado Implementation Synthesis (Version 8.0) ABSTRACT We present a formal discrete framework for attent
- ▪Computation is broadcast to stationary in-memory cells that evaluate local deterministic state transitions.
Hacker News (Front Page) files mainly under programming. We currently carry 972 of its stories. Top-voted stories on Hacker News.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Zenodo |
| Canonical URL | https://zenodo.org/records/21753002 |
| Publication time | Sun, 02 Aug 2026 01:01:45 +0000 |
| Retrieval time | 2026-08-02T03:05:40.026Z |
| Last seen | 2026-08-02T03:05:40.026Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | DGA9-hef7dQI · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Published August 2, 2026 | Version v8 Preprint Open Persistent State Machines: Complete Mathematical Proofs and Vivado Implementation Synthesis (Version 8.0) Authors/Creators Esaka, Yusuke1 Show affiliations 1. Cosmos Administrative Scrivener Office & Independent Researcher Description Persistent State Machines: Complete Mathematical Proofs and Vivado Implementation Synthesis (Version 8.0) ABSTRACT We present a formal discrete framework for attention operators in Large Language Models via Persistent State Machines (PSMs). Computation is broadcast to stationary in-memory cells that evaluate local deterministic state transitions.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Zenodo.