mini-infer 0.1.0__tar.gz

mini_infer-0.1.0/.github/workflows/ci.yml

@@ -0,0 +1,36 @@
+name: CI
+
+on:
+  push:
+    branches: [main]
+  pull_request:
+    branches: [main]
+
+jobs:
+  test:
+    name: Test (Python ${{ matrix.python-version }})
+    runs-on: ubuntu-latest
+    strategy:
+      matrix:
+        python-version: ["3.11", "3.12"]
+
+    steps:
+      - name: Checkout repository
+        uses: actions/checkout@v4
+
+      - name: Install uv
+        uses: astral-sh/setup-uv@v5
+        with:
+          enable-cache: true
+
+      - name: Set up Python
+        run: uv python install ${{ matrix.python-version }}
+
+      - name: Install dependencies
+        run: uv sync --extra-index-url https://download.pytorch.org/whl/cpu
+
+      - name: Run linter
+        run: uv run ruff check src tests
+
+      - name: Run tests
+        run: uv run pytest -v

mini_infer-0.1.0/.gitignore

@@ -0,0 +1,18 @@
+.venv/
+__pycache__/
+*.egg-info/
+.pytest_cache/
+.ruff_cache/
+dist/
+build/
+
+# Local weight downloads & caches (never commit multi-GB weights)
+weights/
+checkpoints/
+*.safetensors
+*.bin
+*.pt
+~/.cache/
+# Personal study notes, not part of the repo
+decisions.md
+flow.md

mini_infer-0.1.0/DEVLOG.md

@@ -0,0 +1,30 @@
+# DEVLOG
+
+## 2026-10-19: Project Genesis & Architecture (M0)
+
+- Initialized Flagship #2 `mini-infer`.
+- Mission: A minimal, readable, high-performance continuous-batching inference engine with paged KV-cache, prefix caching, and speculative decoding for Qwen2.5 (0.5B / 1.5B) in pure PyTorch.
+- Hardware budget: 100% free; fits on a 6 GB NVIDIA RTX 3050 Laptop GPU (1.5B target ~3 GB VRAM + 0.5B draft ~1 GB VRAM + 2 GB Paged KV Cache).
+- Initialized repository with Apache 2.0 license, `.gitignore`, and staged milestone roadmap.
+
+## 2026-10-19: Milestones 1-5 Implemented & Verified
+
+- **M1 (Architecture & Loader)**: Implemented self-contained Qwen2.5 (RMSNorm, RoPE, SwiGLU, GQA) and direct `.safetensors` loader. Verified that cached autoregressive step produces identical logits to full prefill.
+- **M2 (Paged KV-Cache)**: Implemented `BlockPool` (fixed GPU memory pool) and `BlockTable` (virtual-to-physical block mapping) with zero memory fragmentation.
+- **M3 (Continuous Batching)**: Implemented `ContinuousScheduler` with iteration-level dynamic batching, verifying that newly admitted requests start prefill the exact moment an earlier request completes.
+- **M4 (Prefix Caching)**: Implemented `PrefixCache` for zero-recompute prompt KV reuse with LRU eviction.
+- **M5 (Speculative Decoding)**: Implemented draft-target speculative verifier (`speculative_step`) with rejection sampling. Proved that $K$ candidate tokens generate in 1 target forward pass.
+- Added GitHub Actions CI matrix (`.github/workflows/ci.yml`). 13/13 unit tests passing.
+
+## 2026-10-19: Milestone 6 - The Live Benchmark Battle
+
+- **Real Weight Loading Verified**: Loaded `Qwen/Qwen2.5-0.5B-Instruct` weights directly from `.safetensors` onto NVIDIA RTX 3050 Laptop GPU in CUDA `fp16`. Verified prompt completion (`"The capital of France is" -> "Paris..."`).
+- **OpenAI SSE Server**: Launched FastAPI continuous streaming server at `POST /v1/chat/completions` with async thread-safe iteration stepping and OpenAI chunk usage emission.
+- **Companion Benchmark Execution**: Run live benchmark sweep (`c=1, 2, 4`) using Flagship #1 `servebench`:
+  - 18/18 requests succeeded (0 failures).
+  - TTFT p50: **112 ms**.
+  - Peak throughput: **12.0 tok/s**.
+  - Peak VRAM footprint: **1.73 GB** (leaving ample headroom on 6 GB GPU).
+  - Average power draw: **12.7 W - 13.8 W** (0.76 - 0.92 Tok/Joule efficiency).
+- Exported benchmark artifacts and charts to `benchmarks/mini_infer_benchmark.json` and `benchmarks/report.md`.
+

mini_infer-0.1.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

mini_infer-0.1.0/PKG-INFO

@@ -0,0 +1,378 @@
+Metadata-Version: 2.5
+Name: mini-infer
+Version: 0.1.0
+Summary: A minimal, high-performance continuous-batching LLM inference engine with paged KV-cache, prefix caching, and speculative decoding for Qwen2.5.
+Project-URL: Homepage, https://github.com/Prajwal7-2002/mini-infer
+Project-URL: Repository, https://github.com/Prajwal7-2002/mini-infer
+Project-URL: Issues, https://github.com/Prajwal7-2002/mini-infer/issues
+Author-email: Prajwal Pujari <prajwalpujari16@gmail.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: continuous-batching,inference,kv-cache,llm,paged-attention,qwen2.5,serving,speculative-decoding
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: System :: Distributed Computing
+Requires-Python: >=3.11
+Requires-Dist: fastapi>=0.110
+Requires-Dist: pydantic>=2.6
+Requires-Dist: rich>=13
+Requires-Dist: safetensors>=0.4.3
+Requires-Dist: torch>=2.4.0
+Requires-Dist: transformers>=4.40
+Requires-Dist: typer>=0.12
+Requires-Dist: uvicorn>=0.29
+Description-Content-Type: text/markdown
+
+# mini-infer 🚀
+
+[![CI](https://github.com/Prajwal7-2002/mini-infer/actions/workflows/ci.yml/badge.svg)](https://github.com/Prajwal7-2002/mini-infer/actions/workflows/ci.yml)
+[![License](https://img.shields.io/badge/license-Apache%202.0-blue.svg)](LICENSE)
+![Python](https://img.shields.io/badge/python-3.11%2B-blue)
+![PyTorch](https://img.shields.io/badge/PyTorch-2.4%2B-ee4c2c)
+[![Hardware](https://img.shields.io/badge/GPU-RTX%203050%20%7C%20Kaggle%20T4-green.svg)](#)
+
+A minimal, educational, and high-performance **continuous-batching LLM inference engine** with **Paged KV-cache**, **radix prefix caching**, and **speculative decoding** built from scratch in pure Python and PyTorch.
+
+Most developers only know how to *call* an inference engine (`ollama run` or `vllm serve`). The actual systems algorithms—how tensors are paged in VRAM to eliminate fragmentation, how continuous batching schedules requests at the iteration level, how prefix caching avoids redundant prefills, and how speculative decoding generates multiple tokens per forward pass—are locked behind tens of thousands of lines of complex C++/CUDA.
+
+**mini-infer** implements these exact production algorithms in **pure, readable, testable Python/PyTorch** designed to run on a single consumer GPU (such as an entry-level 6 GB laptop GPU or a free Kaggle T4), with **zero C++ compiler or CMake toolchain required**.
+
+---
+
+## ⚡ Core Architecture
+
+```
+                                 Client / servebench
+                                          │
+                                          ▼
+┌──────────────────────────────────────────────────────────────────────────────────┐
+│ mini-infer Engine                                                                │
+│                                                                                  │
+│  ┌───────────────────────┐         ┌──────────────────────────────────────────┐  │
+│  │   HTTP Server (SSE)   │         │       Continuous Batching Scheduler      │  │
+│  │  /v1/chat/completions ├────────►│  - Iteration-level token scheduler       │  │
+│  └───────────────────────┘         │  - Dynamic prefill/decode interleaving   │  │
+│                                    └────────────────────┬─────────────────────┘  │
+│                                                         │                        │
+│                                                         ▼                        │
+│  ┌────────────────────────────────────────────────────────────────────────────┐  │
+│  │                        Paged KV-Cache Memory Manager                       │  │
+│  │  - Fixed Physical Block Pool (16 tokens/block in pre-allocated GPU VRAM)   │  │
+│  │  - Virtual-to-Physical Block Table per request (zero fragmentation)        │  │
+│  │  - Radix / Prefix Cache (zero recompute for shared system prompts)         │  │
+│  └──────────────────────────────────────────────┬─────────────────────────────┘  │
+│                                                 │                                │
+│                                                 ▼                                │
+│  ┌────────────────────────────────────────────────────────────────────────────┐  │
+│  │                       Qwen2.5 Model Executor & Kernels                     │  │
+│  │  - Pure safetensors streaming loader (RMSNorm, RoPE, SwiGLU, SDPA)         │  │
+│  │  - Speculative Decoding (0.5B draft proposes → 1.5B target verifies)       │  │
+│  └────────────────────────────────────────────────────────────────────────────┘  │
+└──────────────────────────────────────────────────────────────────────────────────┘
+```
+
+---
+
+## ⏱️ Quickstart: Up and Running in 60 Seconds
+
+### Step 1: Install Dependencies
+
+> [!NOTE]
+> Unlike vLLM or llama.cpp, **mini-infer requires NO C++ compilers, Visual Studio Build Tools, or CMake**. It runs entirely using standard PyTorch wheels!
+
+**With [uv](https://docs.astral.sh/uv/) (Recommended & fastest):**
+```bash
+git clone https://github.com/Prajwal7-2002/mini-infer.git
+cd mini-infer
+uv sync
+```
+
+**With standard pip & virtualenv:**
+```bash
+git clone https://github.com/Prajwal7-2002/mini-infer.git
+cd mini-infer
+python -m venv .venv
+
+# Windows
+.venv\Scripts\activate
+# Linux / macOS
+source .venv/bin/activate
+
+pip install -e .
+```
+
+---
+
+### Step 2: Check Hardware Diagnostics
+Verify your GPU and memory allocation plan:
+```bash
+uv run mini-infer info
+```
+```text
+mini-infer System Diagnostics
+PyTorch version: 2.6.0+cu124
+CUDA available: True
+GPU Device: NVIDIA GeForce RTX 3050 6GB Laptop GPU
+Total VRAM: 6.00 GB
+
+Memory Allocation Plan (RTX 3050 6 GB):
+  • Qwen2.5-1.5B (Target Model): ~3.0 GB VRAM
+  • Qwen2.5-0.5B (Draft Model):  ~1.0 GB VRAM
+  • Paged KV-Cache Memory Pool:  ~1.5 GB VRAM (~2000 blocks)
+  • Safety Buffer:               ~0.5 GB
+```
+
+---
+
+### Step 3: Launch the Streaming Server
+Start serving `Qwen2.5-0.5B-Instruct` (model weights will download automatically from Hugging Face on the first run):
+```bash
+uv run mini-infer serve --port 8000
+```
+```text
+mini-infer serving Qwen/Qwen2.5-0.5B-Instruct on 127.0.0.1:8000 (cuda)
+Loading tokenizer...
+Loading model weights...
+Streaming weights from 1 safetensors file(s) into cuda (torch.bfloat16)...
+Initializing Paged KV-Cache (256 blocks of size 16)...
+Server ready! Connect any OpenAI-compatible client or run servebench quick against http://127.0.0.1:8000/v1
+INFO:     Uvicorn running on http://127.0.0.1:8000 (Press CTRL+C to quit)
+```
+
+---
+
+### Step 4: Stream Tokens (Choose your client)
+
+#### Option A: Quick `curl` terminal command
+```bash
+curl -N http://127.0.0.1:8000/v1/chat/completions \
+  -H "Content-Type: application/json" \
+  -d '{
+    "model": "qwen2.5-0.5b",
+    "messages": [{"role": "user", "content": "Explain Paged KV-Cache in 1 sentence."}],
+    "stream": true
+  }'
+```
+
+#### Option B: Standard Python Streaming
+```python
+import urllib.request, json
+
+data = json.dumps({
+    "model": "qwen2.5-0.5b",
+    "messages": [{"role": "user", "content": "Explain continuous batching in 1 sentence."}],
+    "stream": True,
+}).encode("utf-8")
+
+req = urllib.request.Request(
+    "http://127.0.0.1:8000/v1/chat/completions",
+    data=data,
+    headers={"Content-Type": "application/json"}
+)
+
+for line in urllib.request.urlopen(req):
+    text = line.decode("utf-8")
+    if text.startswith("data: ") and not text.startswith("data: [DONE]"):
+        chunk = json.loads(text[6:])
+        print(chunk["choices"][0]["delta"].get("content", ""), end="", flush=True)
+print()
+```
+
+#### Option C: Official OpenAI Python SDK
+Because `mini-infer` implements standard OpenAI streaming protocols, it works out of the box with `openai-python`, LangChain, and Open-WebUI:
+```python
+from openai import OpenAI
+
+client = OpenAI(base_url="http://127.0.0.1:8000/v1", api_key="none")
+
+response = client.chat.completions.create(
+    model="qwen2.5-0.5b",
+    messages=[{"role": "user", "content": "Hello mini-infer!"}],
+    stream=True,
+)
+
+for chunk in response:
+    print(chunk.choices[0].delta.content or "", end="", flush=True)
+```
+
+---
+
+## ⚡ The Four Systems Breakthroughs Explained
+
+### 1. Paged KV-Cache (Virtual Memory Management)
+Standard PyTorch caches allocate contiguous tensors for each sequence up to `max_seq_len`. This causes **over 60% memory waste** due to internal and external VRAM fragmentation.
+* `mini-infer` divides KV-cache memory into a fixed pool of **16-token physical blocks** (`BlockAllocator`).
+* Each request maintains a dynamic `BlockTable` mapping logical token positions to non-contiguous physical blocks on the GPU.
+* Allows dynamically growing and shrinking memory with zero reallocation bubbles.
+
+### 2. True Continuous Batching (Iteration-Level Scheduling)
+Traditional batching evaluates all requests together until the longest one completes, leaving GPU compute units idle during short completions.
+* `mini-infer` steps at the **iteration level**: every decode forward pass processes exactly one token across all active requests.
+* When a request generates `<|im_end|>`, its physical blocks are immediately recycled to the pool.
+* Incoming requests enter the engine on the very next token iteration without waiting for current batches to finish.
+
+### 3. Hash-Based Radix Prefix Caching
+Repeated system prompts (e.g., `"You are a helpful coding assistant..."`) waste significant compute in redundant prefill passes.
+* Completed 16-token blocks are cryptographically hashed and indexed in a prefix cache table.
+* Incoming requests sharing common prefixes match these block hashes and bypass prefill entirely, reducing **Time-to-First-Token (TTFT) by up to 80%**.
+
+### 4. Speculative Decoding with Zero Distribution Drift
+Autoregressive decoding is memory-bandwidth bound on single tokens.
+* `mini-infer` runs a lightweight **0.5B draft model** proposing $K=3$ candidate tokens.
+* A larger **1.5B target model** verifies all $K$ candidates in a **single parallel forward pass**.
+* Uses **Leviathan rejection sampling** to accept or correct candidates, mathematically guaranteeing that outputs match the exact distribution of the 1.5B model alone.
+
+---
+
+## ⚡ Real-World Benchmarks on Real Hardware
+
+Measured live using Flagship #1 [servebench](https://github.com/Prajwal7-2002/servebench) on an **NVIDIA GeForce RTX 3050 6GB Laptop GPU** running `Qwen2.5-0.5B-Instruct` in pure PyTorch CUDA:
+
+```bash
+servebench run --url http://127.0.0.1:8000/v1 --model qwen2.5-0.5b --concurrency 1,2,4
+```
+
+| Concurrency | Requests (OK / Fail) | Throughput (tok/s) | TTFT p50 (ms) | TTFT p99 (ms) | TPOT p50 (ms) | VRAM Peak (MB) | Power Avg (W) | Tok/Joule |
+| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |
+| **c = 1** | **6 / 0** | **9.6** | **112 ms** | 171 ms | 102 ms | 1,482 MB | 12.7 W | 0.76 |
+| **c = 2** | **6 / 0** | **12.0** | **203 ms** | 380 ms | 157 ms | 1,482 MB | 13.1 W | 0.92 |
+| **c = 4** | **6 / 0** | **11.7** | **496 ms** | 1,037 ms | 297 ms | 1,734 MB | 13.8 W | 0.85 |
+
+### 🏎️ Speculative Decoding Benchmark (0.5B Draft Proposer → 1.5B Target Verifier)
+
+Evaluated live on **NVIDIA GeForce RTX 3050 6GB Laptop GPU** using zero-overhead in-place streaming `bfloat16` weights with PyTorch SDPA:
+
+| Pipeline | Model(s) | Total VRAM | Acceptance Rate $\alpha$ | Verify Mode | Distribution Match |
+| :---: | :---: | :---: | :---: | :---: | :---: |
+| **Standalone Target** | Qwen2.5-1.5B | 2.88 GB | N/A | Autoregressive (1 tok/step) | Reference ground truth |
+| **Speculative Pair** | 0.5B (Draft) + 1.5B (Target) | **3.81 GB** | **43.6% – 77.8%** | Leviathan Parallel Rejection ($K=3$) | **100% Exact** (Zero drift) |
+
+* **Zero Distribution Drift**: Target rejection sampling mathematically guarantees exact equivalence to sampling from the 1.5B target distribution alone.
+* **Dual-Model VRAM Fit**: Both models load simultaneously into just **3.81 GB VRAM** via zero-overhead in-place file streaming, running effortlessly within consumer 6 GB limits.
+
+---
+
+## 🛠️ Comparison: mini-infer vs Production Engines
+
+| Feature | `mini-infer` | `vLLM` | `llama.cpp` | `HuggingFace Transformers` |
+| :--- | :---: | :---: | :---: | :---: |
+| **Core Language** | Pure Python / PyTorch | C++ / CUDA / Python | Pure C / C++ | Python / PyTorch |
+| **Paged Attention** | ✅ (16-tok blocks) | ✅ (CUDA kernel) | ❌ | ❌ |
+| **Continuous Batching** | ✅ (Iteration-level) | ✅ (Iteration-level) | ⚠️ (Slot-based) | ❌ (Static padding) |
+| **Prefix Caching** | ✅ (Hash matching) | ✅ (Radix tree) | ✅ (Prompt cache) | ❌ |
+| **Speculative Decoding** | ✅ (Rejection sampling) | ✅ (Draft worker) | ✅ (Draft model) | ⚠️ (Experimental) |
+| **Hardware Barrier** | None (Runs on Laptop GPU) | High (Requires full CUDA toolkit) | Low (Runs on CPU/GPU) | None |
+| **Code Readability** | ⭐⭐⭐⭐⭐ (Clean & Modular) | ⭐⭐ (Deep C++ macros) | ⭐⭐ (Low-level C) | ⭐⭐⭐ (Heavy abstraction) |
+
+---
+
+## 💻 Python Programmatic API
+
+Want to experiment with the engine directly inside Python scripts or Jupyter Notebooks without launching the HTTP server?
+
+```python
+import torch
+from mini_infer.engine import InferenceEngine
+from mini_infer.models.loader import load_model_from_safetensors
+
+# 1. Load weights directly from safetensors with zero host memory duplication
+model, config = load_model_from_safetensors("Qwen/Qwen2.5-0.5B-Instruct", device="cuda")
+
+# 2. Initialize the Paged KV engine
+engine = InferenceEngine(
+    model=model,
+    config=config,
+    num_blocks=256,
+    block_size=16,
+    device=torch.device("cuda"),
+)
+
+# 3. Submit a prompt and step the continuous batching scheduler
+prompt_ids = [785, 6722, 315, 9625, 374]  # "The capital of France is"
+req_id = engine.add_request(prompt_tokens=prompt_ids, max_tokens=10)
+
+# 4. Iterate scheduler until request finishes
+while not engine.is_finished(req_id):
+    outputs = engine.step()
+    for seq_id, new_token in outputs:
+        if seq_id == req_id:
+            print(f"Generated token ID: {new_token}")
+```
+
+---
+
+## ❓ Frequently Asked Questions (FAQ)
+
+<details>
+<summary><b>1. Do I need an expensive GPU to run mini-infer?</b></summary>
+
+**No.** `mini-infer` is specifically engineered to run within the memory constraints of consumer laptop GPUs (like an NVIDIA RTX 3050 6GB) and free cloud tiers (Kaggle or Google Colab T4). It also features automatic CPU fallback via `--device cpu`.
+</details>
+
+<details>
+<summary><b>2. How are model weights downloaded?</b></summary>
+
+Weights are automatically fetched on the first run via `huggingface_hub` and cached locally in `~/.cache/huggingface/`. You do not need to convert or manually download `.bin` or `.gguf` files.
+</details>
+
+<details>
+<summary><b>3. How do I run the automated test suite?</b></summary>
+
+Run the test suite using `pytest`:
+```bash
+uv run pytest -v
+```
+All 13 unit tests cover block allocation, continuous scheduling, prefix hash matching, and speculative rejection verification.
+</details>
+
+<details>
+<summary><b>4. How does mini-infer pair with servebench?</b></summary>
+
+[servebench](https://github.com/Prajwal7-2002/servebench) was built as Flagship #1 of our portfolio to rigorously measure local LLM engines. When `mini-infer` is running, `servebench` automatically detects it at `GET /health` (`status: ok, engine: mini-infer`) and provides instant TTFT, TPOT, and throughput cards.
+</details>
+
+---
+
+## 📂 Codebase Tour
+
+```
+mini-infer/
+├── src/mini_infer/
+│   ├── models/
+│   │   ├── config.py         # Architecture specs (hidden size, heads, RoPE theta)
+│   │   ├── qwen2.py          # Pure PyTorch Qwen2 model with SDPA attention
+│   │   ├── loader.py         # Zero-overhead in-place safetensors streaming loader
+│   │   └── sampler.py        # Temperature, top-p, and greedy token sampling
+│   ├── cache/
+│   │   ├── block.py          # Physical memory blocks & BlockAllocator pool
+│   │   ├── table.py          # Virtual-to-physical block translation table
+│   │   └── prefix_cache.py   # Radix hash matching for shared prompt prefixes
+│   ├── scheduler/
+│   │   ├── sequence.py       # Sequence lifecycle & state machine (WAITING, RUNNING)
+│   │   └── continuous.py     # Iteration-level continuous batching scheduler
+│   ├── speculative/
+│   │   └── verifier.py       # Leviathan rejection sampling draft/target verifier
+│   ├── api/
+│   │   └── server.py         # FastAPI OpenAI-compatible SSE streaming endpoints
+│   ├── engine.py             # Unified InferenceEngine coordinator
+│   └── cli.py                # Typer CLI (serve, info)
+└── tests/                    # Comprehensive unit tests (cache, scheduler, models)
+```
+
+---
+
+## 📋 Roadmap & Completed Milestones
+
+- [x] **M1: Self-Contained Model & Weights Loader**: Clean Qwen2.5 in PyTorch, direct `.safetensors` loader without `transformers.AutoModel`, logits verified against reference within $10^{-4}$.
+- [x] **M2: Paged KV-Cache**: Block allocator, virtual-to-physical block table, zero VRAM waste.
+- [x] **M3: Continuous Batching Engine**: Iteration-level dynamic batching scheduler.
+- [x] **M4: Prefix Caching**: Radix block matching for shared prompt prefixes.
+- [x] **M5: Speculative Decoding**: 0.5B draft proposer + 1.5B target parallel verifier.
+- [x] **M6: HTTP Streaming Server & Benchmark Battle**: OpenAI SSE streaming API benchmarked live against real hardware with `servebench`.
+
+---
+
+## 📄 License
+
+Apache 2.0 — free for commercial, research, and educational use.