The written memory planner multiplies billions of model parameters by its assigned bytes per weight. An illustrative thirty-billion-parameter model at BF sixteen uses two bytes per weight and displays sixty GB; INT four uses one half and displays fifteen. Bars show those assigned weight figures at eight pixels per displayed GB. This excludes its zero assigned CUDA overhead and actual runtime workspaces, quantization metadata and allocator fragmentation; it is not a verified hardware fit. Its cache formula is two times layers times KV heads times head dimension times effective tokens times bytes per cache element. An illustrative thirty-two layers, eight KV heads, head dimension one hundred twenty-eight, one thousand twenty-four tokens, and two-byte elements produces one hundred twenty-eight MiB per sequence. Four simultaneous sequences produce five hundred twelve MiB. Bars show those cache values at zero point nine pixels per MiB. The source labels binary-divided cache totals as GB and adds them to decimal weight GB, so retain that unit limitation rather than certifying capacity. The effective token count is a positive sliding window only when it is smaller than the requested context. With the same illustrative cache dimensions, two thousand forty-eight effective tokens produce two hundred fifty-six MiB; a one-thousand-twenty-four window produces one hundred twenty-eight. Bars show equal units at two pixels per MiB. Hidden size and total attention head inputs do not enter this source cache formula. Its tokens-per-second label divides assigned bandwidth by model weight size and is not a measured decoding benchmark.