<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Llm-Architecture on BRYSGO</title><link>https://www.brysgo.com/tags/llm-architecture/</link><description>Recent content in Llm-Architecture on BRYSGO</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Tue, 13 Oct 2026 19:41:14 +0000</lastBuildDate><atom:link href="https://www.brysgo.com/tags/llm-architecture/index.xml" rel="self" type="application/rss+xml"/><item><title>What Ternary Weights Taught Me About Why Models Hallucinate</title><link>https://www.brysgo.com/post/2026-10-13-what-ternary-weights-taught-me-about-why-models-hallucinate/</link><pubDate>Tue, 13 Oct 2026 19:41:14 +0000</pubDate><guid>https://www.brysgo.com/post/2026-10-13-what-ternary-weights-taught-me-about-why-models-hallucinate/</guid><description>&lt;h2 id="the-three-numbers-problem"&gt;The Three Numbers Problem&lt;/h2&gt;&#10;&lt;p&gt;A few months ago I was reading through the BitNet b1.58 papers expecting to find the usual quantization story — some clever tricks to shrink a model, a modest accuracy hit, a tradeoff chart. What I found instead unsettled me a little. Constrain every weight in a transformer to one of three values — -1, 0, or +1 — train it that way from scratch, and past about 3 billion parameters it matches full 16-bit precision on perplexity and downstream tasks. Not &amp;ldquo;close enough for edge deployment.&amp;rdquo; Matches. You can throw away roughly 14.4 of every 16 bits per parameter and lose nothing that anyone can measure.&lt;/p&gt;</description></item></channel></rss>