How Large a Model Can Your Computer Run
Pick a GPU or Mac model for a real-time answer; the VRAM formula, quantization levels, and the MoE mismatch between memory and speed
THE QUESTION THIS PAGE ANSWERS
ANSWER FIRSTHow Large a Model Can Your Computer Run?
Pick a GPU or Mac model for a real-time answer; the VRAM formula, quantization levels, and the MoE mismatch between memory and speed
Make the claim earn its place. Use this page as a decision aid, not a definition to memorize. Connect the idea to one real task, one observable result, and one failure that would change your mind.
Write one question you could answer with evidence after trying this idea.
A conclusion that sounds complete but leaves the key assumption untested.
The last row, Qwen3.8-Max, stays red no matter what you pick. That is not a bug in the list. It is the model from the third lesson of this chapter whose weights have been announced as coming but have not been released yet: run 2.4 trillion parameters through the formula above and you need 1560 GB, more than even the most expensive machine on the list can offer. It stays in the table because "the weights are open" and "you can run it" are two different things, and seeing that number lands better than reading the words "very large."
The result above is not looked up in a table. It is one multiplication:
Example: an 8B model at INT4, 8 × 0.65 ≈ 5.2 GB
The factor is the part that needs explaining. To load the weights alone, INT4 takes 0.5 bytes per parameter, so an 8B model needs only 4 GB. But a running model also needs extra room to hold the intermediate state that piles up during a conversation, the KV Cache covered in Part 2. That overhead is already baked into the factor, so do not multiply in another safety margin on top of it, or you will end up concluding that no machine can run anything.
Quantization means storing each parameter with fewer bits. Fewer bits means a smaller footprint, and the price is lost precision.
Switch the precision from FP16 to INT4 in the calculator above and watch which models become runnable. Quantization is the single most effective way to lower the bar for local deployment: an 8 GB card cannot handle an 8B model at FP16, but at INT4 it has room to spare.
Everyone can recite the line "fewer bits means some loss," but at which step does the loss actually happen? Quantization does exactly one thing: it rounds weights that used to be continuous onto a finite set of levels. The bit width decides how many levels there are to work with — 4 bits gives you 16, 8 bits gives you 256. The fewer the levels, the further each weight has to move to reach one.
Two things are worth pausing on at INT4. First, the weights with the smallest magnitudes round straight onto 0, so those parameters stop doing anything at all in the quantized file; a model holds an enormous number of such small weights, and while none of them matters on its own, together they carry a lot of the fine detail. Second, there are fewer dots on the ruler — no dot went missing, several weights that used to be different got squeezed onto the same level. Sixteen levels cannot hold that many distinct values, so those weights have to share one number, and whatever set them apart is gone.
Why should nudging the weights a little affect the quality of an answer? Because every word the model writes is the highest-scoring option out of a whole pool of candidates. Most of the time the front-runner is far enough ahead that a nudge changes nothing, but every so often the top two are almost tied, and then the smallest perturbation is enough to swap them.
NVIDIA GPU
- VRAM is dedicated; you can use just about all of the rated capacity
- High bandwidth and fast generation; at the same model size it feels noticeably smoother
- Capacity is a hard ceiling — consumer cards currently top out around 32 GB
- The most mature software ecosystem; almost any problem you hit already has a searchable fix
Apple Silicon
- CPU and GPU share unified memory, and the system will not let you hand all of it to the GPU
- The calculator assumes roughly 75% is assignable, which is a conservative estimate
- A big capacity advantage; high-end configurations fit sizes consumer GPUs never reach
- Bandwidth usually trails a similarly priced discrete GPU, so large models generate more slowly
Put simply: NVIDIA competes on speed, Apple on capacity. If you want to run models above 30B, a Mac with plenty of memory is often more realistic than a consumer GPU; if you are after response speed, a discrete GPU suits you better.
iogpu.wired_limit_max; 75% is a conservative estimate for the default configuration, not a hard ceiling.
Entries in the results list with an A in the name are MoE models, such as Qwen3-30B-A3B, meaning 30B parameters in total with 3B actually activated each pass. These come with a trap that is easy to fall into:
That makes MoE a good fit when VRAM is plentiful but you want quick responses — a high-memory Mac, for example. The reverse also holds: if VRAM is tight, a smaller dense model gives you more for the same footprint.
Every number above is an estimate. Actual usage is also shaped by these factors:
- Context length. This is the biggest variable. Open the context from 4K up to 128K and the KV Cache footprint grows several times over, which can break a model that was running fine.
- Concurrency. Handling several requests at once means each one needs its own copy of the intermediate state. Usually not a concern for personal use, but you have to redo the math when you build a service.
- The specific quantization implementation. Two tools can both call it INT4 and still differ in implementation details, so the sizes come out different.
- System overhead. The GPU still has to leave something for the desktop and other programs, so do not plan on using every last byte.
So the calculator gives you a feasibility judgment, not a precise budget. When the verdict is "tight," plan as if it will not run.
Now that you know what you can run, the next lesson gets it installed. Two tools — Ollama on the command line and LM Studio with a GUI — and ten minutes to a working setup.
Put “Run the Numbers First” back into its constraints
“The last row, Qwen3.8-Max, stays red no matter what you pick.” shows that a model, license, access route, or leaderboard is information—not an answer outside context. The real choice depends on task, data boundary, latency, quality floor, and operating cost.
Write elimination criteria before chasing the top score
The comparison in “The result above is not looked up in a table.” should use the same real inputs while observing correctness, failure behavior, response time, and cost. A model leading a public leaderboard may still fail your license, privacy, or peak-latency constraints.
- VRAM is dedicated ; you can use just about all of the rated capacity
- High bandwidth and fast generation; at the same model size it feels noticeably smoother
- Capacity is a hard ceiling — consumer cards currently top out around 32 GB
Without a test set, there is no reliable winner
Start with “Now that you know what you can run, the next lesson gets it installed.”: choose inputs that could genuinely change the decision and write down one counterexample that would reverse your choice. That is more useful than memorizing a single ranking.
From “Run the Numbers First” to “Where the Formula Comes From”
“Run the Numbers First” grounds the problem in “The last row, Qwen3.8-Max, stays red no matter what you pick. That is not a bug in the list. It is the model from the third lesson of this chapter whose weights have been announced as coming but have not been r…”. “Where the Formula Comes From” then moves it toward “The result above is not looked up in a table. It is one multiplication”. Together, they show that the lesson is not just a conclusion to remember, but a claim with conditions.
Carry the judgment into the next situation
For model selection, write non-negotiable constraints from the real task first. Compare quality, failure behavior, latency, licensing, and cost on the same inputs; use a leaderboard only as a starting point.
- “Run the Numbers First”: The last row, Qwen3.8-Max, stays red no matter what you pick. That is not a bug in the list. It is the model from the third lesson of this chapter whose weights have been announced as coming but have not been r…
- “Where the Formula Comes From”: The result above is not looked up in a table. It is one multiplication
- “The closing point”: CPU and GPU share unified memory, and the system will not let you hand all of it to the GPU
The final “The closing point” brings the discussion to “CPU and GPU share unified memory, and the system will not let you hand all of it to the GPU”. The useful thing to carry forward is knowing which judgments must be revisited when input, scale, or risk changes.
I turned one judgment from this article into a small experiment I could run today. Knowing what to observe next is more useful than simply remembering the conclusion.
After reading this, I first looked for the conditions behind the idea instead of copying the method into a project. That order made the later trade-offs much clearer.
When this judgment reaches real work, which constraint should be added first? I am curious which step matters most between reading and the first practical attempt.
No discussion on this article yet.