Conditions & context
Today we are looking at a lightweight French model, Mistral 7B Instruct. I chose the Q5 quantization version, thinking that the jump in VRAM utilization would be outweighed by increased accuracy. I’ve heard good things about it and it certainly looked promising. How was it? Let’s dive in…
As in all my tests, I use the same prompt, the same hardware, and the same methodology. I’m looking at the same set of metrics across every model: VRAM usage, GPU utilization, CPU load, token throughput, tokens written, and total response time. These matter to me because they reveal whether a model is actually usable on consumer hardware — not just in theory, but in practice.
| Specs | Value |
|---|---|
| Linux Distro | Ubuntu Server 24.04.4 LTS |
| Linux Kernel | 6.8.0-101 |
| CPU | Intel CORE i7 14th Gen 14700K Cores: 8P/12E Threads: 28 |
| Motherboard | MSI PRO B660M-A |
| RAM | 80 GB DDR4 (32+16+32+16) |
| SSD | Crucial NVME 1TB |
| GPU | MSI NVidia GeForce RTX 5060Ti Shadow 2X OC PCIe 5.0×8 |
| CUDA Cores | 4,608 |
| VRAM | 16 GB GDDR7 128-bit 448 GB/s |
| GPU Driver | NVidia 590.48.01 |
| CUDA version | 13.1 |
| Ollama version | 0.17.4 |
| Model | Mistral 7B Instruct |
| Quantization | Q5 |
The prompt
Write a simple Python function that checks if a number is prime.Explain how it works in plain English, like you're teachinga beginner.
The results
Mistral 7B Instruct is a non-reasoning model — it has no chain-of-thought to speak of, no pre-thinking overhead (like Copilot does, for example), just raw inference. And it shows. Simple questions get answered faster than you can lift your wrists off the keyboard — sub-second response after hitting Enter. The benchmark numbers reflect exactly that: rock-solid consistency across all three runs, GPU reaching sweet 98% utilization without ever flooding the CPU, identical token output every time. Gotta love this!
| Model | Quant | Run | Tokens/sec | Total Time | Tokens Written | VRAM | GPU Util |
|---|---|---|---|---|---|---|---|
| Mistral 7B Instruct | Q5 | 1 | 77.46 | 3s | 294 | 5.9GB | 98% |
| Mistral 7B Instruct | Q5 | 2 | 76.87 | 4s | 294 | 5.9GB | 98% |
| Mistral 7B Instruct | Q5 | 3 | 76.13 | 4s | 294 | 5.9GB | 98% |
That consistency is rare. Every other model I’ve tested in this series showed some variation — Gemma degraded, GPT-OSS varied by length, Qwen had its quirks. Mistral 7B just… delivered. Same output, same speed, same GPU utilization, three times in a row.
The code was correct, the explanation was accurate, and the whole response was readable and well-structured, even if it was quite brief.
At just below 6GB VRAM it also opens an interesting door — this model would run comfortably on an older 8GB card.
Time for self-reflection: for three quarters of your daily tasks — quick code snippets, drafting emails, explaining concepts, grammar checks, simple Q&A — a model like this running locally at 75+ tokens/sec beats a frontier model hands down. Zero latency, zero subscription cost, zero privacy concerns, fully offline (for you doomsday aficionados).
Honoring its overt politeness, I asked Mistral 7B what name and gender it would choose for itself and why, if it could. Mistral didn’t deflect with “I’m just an AI.” It thought about it and chose female gender and name: Elysium — evoking serenity and calm, aligned with the purpose as a companion. How poetic! And also apologetic and self-aware when stepping on someone’s toes.
So Elysium she is! The benchmarks are impressive, but honestly? That brief and sweet exchange told me more about this model than any tokens/sec table ever could. Pleasant, willing to serve, learn and be helpful. Yes, her word structure and reasoning are not as deep as frontier models and there is a palpable scripted cadence to the output you pick up on over time of repetition. But that’s OK. When you just need a light-weight model for mundane tasks who you don’t want to have deeply philosophical conversations with and expect writing a War and Peace novel with, Mistral 7B Instruct is worthy of examining.
The conclusion – TL;DR
You know what? You don’t need a frontier LLM model for three quarters of your daily tasks. Quick code snippets? Drafting emails? Explaining concepts? Summarizing text? Checking your grammar? Simple Q&A or trivia? This Mistral edition proves that a simple 7B-8B model running locally at 70-80 tokens/sec on modest hardware handles all of that beautifully. And it does it with zero latency, negligible cost, zero privacy concerns, offline. As I’m very concerned about how much energy these data centers running frontier models are now devouring — it will hit a ceiling one day — seeing these local models work at such speed and prowess gives me hope for AI and its potential to actually help humanity, not compromise or harm it. When used consciously, and with good intent, these models are a real life-changing tool and absolutely can and will improve our lives.
Mistral 7B is not a new model by any stretch of imagination, but it is wicked fast, polite, very capable for being a daily driver, helping you out, is willing to learn and best of all, you can run this on an affordable GPU with 8GB VRAM and that puts you into a $300 territory. Easily. Used ones? Probably half that. This model may breathe a new life into your old PC and actually run on it like a champ. Hmmm… interesting.
What’s not to like?
Mistral 7B (or Elysium as she called herself) gets double thumbs up and I will plan to deploy this model on my second PC with RTX 3060Ti 8 GB GPU and use as an AI agent for my business’ website.
This is a lightweight model you need to try.
Won’t disappoint you.
The output (pasted & unedited)
Sure! Here’s a simple Python function that checks if a number is prime:
def is_prime(n): if n <= 1: return False for i in range(2, int(n**0.5) + 1): if n % i == 0: return False return True
This function takes an integer n as input and returns a boolean value indicating whether it is prime or not. It works by first checking if the number is less than or equal to 1, in which case it is not prime. If the number is greater than 1, the function proceeds to check if it is divisible by any number between 2 and the square root of n.
To do this, the function uses a loop that iterates over all numbers i from 2 to the integer value of the square root of n, plus 1. For each value of i, the function checks if n is divisible by i. If it is, then n is not prime and the function returns False. If the loop completes without finding any divisors for n, then n is prime and the function returns True.
I hope that helps explain how this function works! Let me know if you have any other questions.
Need Help?
Need help streamlining your processes or solving tricky business problems? I offer one-on-one consultations to get you unstuck fast. Book a free consultation with me today at goarcherdynamics.com.
Want more practical tips and workflow hacks? I publish them regularly on my blog — check it out and subscribe for newsletter updates: goarcherdynamics.com

Leave a Reply