Here are some output examples, by a variety of the Bonsai models explained above. Notice how fast some of the tiny models can generate tokens, and even the 4B model can produce a significant percentage of actually valid code.
A human, or a large model would really need to work the code from the smaller models, to make it usable, but even the smaller model output could potentially help save time when working on short coding tasks. Pay particular attention to how quickly the small models performed on a tiny netbook with no GPU:
- https://com-pute.com/nick/bonsai1.7b-output.txt Prompt: 32.0 t/s | Generation: 10.4 t/s
- https://com-pute.com/nick/bonsai4b-output.txt Prompt: 12.7 t/s | Generation: 6.9 t/s
- https://com-pute.com/nick/bonsai8b-output.txt Prompt: 6.9 t/s | Generation: 3.9 t/s
- https://com-pute.com/nick/bonsai27b-output.txt Prompt: 0.5 t/s | Generation: 0.2 t/s
That 4th generation, by the big Qwen 3.6 27b model (which is one of the most capable open source LLMs available) was completed on an extremely low power netbook with an N5030 CPU!
I expect that the most viable way to use these models, to generate actually usable production code, would likely be to use smaller models to generate the bulk of code, and then have progressively larger models fix/refine the output of each successively better model. Notice that input tokens are processed something in the order of 2x-3x faster than output tokens, so using small models to provide some basic code structure, and then molding it into better working code, seems like a reasonable approach to building large code bases quickly. Build some basic code outlines, and then work out the details - that should work more quickly than using a large model to generate everything at a snail's pace.
Or you could always just run a long process overnight on Qwen 3.6 27b - the output from the super compressed Bonsai versions of that model is very good, for the size and hardware requirements needed to run it.
Here's a session in which Gemini 3.7 Flash evaluated all the code examples above: