LLM re-reads the same text a thousand times. Here's what I measured
Your LLM re-reads the same text a thousand times I spent two weeks trying to make CPU inference faster. The thing that finally worked was not in the engine. Measured on a free Oracle ARM box — 4 cores, €0/month.
- ▪Your LLM re-reads the same text a thousand times I spent two weeks trying to make CPU inference faster.
- ▪The thing that finally worked was not in the engine.
- ▪Measured on a free Oracle ARM box — 4 cores, €0/month.
Hacker News (AI / LLM) files mainly under ai. We currently carry 2,955 of its stories.
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 | Github |
| Canonical URL | https://swellweb.github.io/reame/bytes/ |
| Publication time | Thu, 30 Jul 2026 18:28:32 +0000 |
| Retrieval time | 2026-07-30T18:37:19.466Z |
| Last seen | 2026-07-30T18:37:19.466Z |
| 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 | VLk3sVE4pSkF · 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
Your LLM re-reads the same text a thousand times I spent two weeks trying to make CPU inference faster. The thing that finally worked was not in the engine. Measured on a free Oracle ARM box — 4 cores, €0/month. Everything below is reproducible; the scripts are linked at the end. I maintain a CPU-first inference server built on llama.cpp. Not as a fallback for a missing GPU — as the target. The hardware I care about is the free tier: two to four ARM cores, no accelerator, no budget. The bottleneck there is prefill. Before a model writes a single token it has to read your entire prompt, and on a document of any size that read dominates everything else. So I went looking for speed in the obvious places.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Github.
Discussion
0 commentsMore from Github
