Update README.md
Browse files
README.md
CHANGED
|
@@ -1,5 +1,150 @@
|
|
| 1 |
-
|
| 2 |
-
|
| 3 |
-
|
| 4 |
-
|
| 5 |
-
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Lite LLM
|
| 2 |
+
|
| 3 |
+
Lite LLM is a deterministic, tiered-parameter, hierarchical sparse expert (HSER) language model runtime designed to scale from **1B → 1T parameters** and beyond (up to quadrillion-scale parameter universes) while keeping **active compute bounded** per token.
|
| 4 |
+
|
| 5 |
+
The Github organization hosts the **specification corpus**, **reference implementations**, and **operational tooling** for building and deploying Lite LLM as an enterprise / reference-grade system.
|
| 6 |
+
|
| 7 |
+
Model optimization for the LiteCore Coherent Silicon Photonic Complex Multiply-Accumulate (CSP-cMAC) Unit Cell Hardware focuses on maximizing inference efficiency under tight memory and power constraints by combining compression, quantization, and memory aware execution. LiteCore is a fundamental photonic compute primitive purpose-built for large language model (LLM) inference at quadrillion-parameter scales. LiteCore leverages silicon-on-insulator (SOI) photonics to perform complex-valued multiply-accumulate operations at <1 fJ energy and 1–10 ps latency—representing 500–2,000× energy and 1,000–10,000× latency improvements over state-of-the-art electronic GPUs.
|
| 8 |
+
|
| 9 |
+
---
|
| 10 |
+
|
| 11 |
+
## What makes Lite LLM different
|
| 12 |
+
|
| 13 |
+
### Deterministic by design
|
| 14 |
+
Lite LLM treats determinism as a first-class requirement:
|
| 15 |
+
- Stable top‑k routing with seeded tie‑breaking
|
| 16 |
+
- Deterministic collectives and reproducible distributed execution
|
| 17 |
+
- Deterministic audit logs and replayable training runs
|
| 18 |
+
|
| 19 |
+
### Tiered Parameter Architecture (TPA)
|
| 20 |
+
Parameters are partitioned across storage tiers:
|
| 21 |
+
- **Hot** (HBM / GPU)
|
| 22 |
+
- **Warm** (DRAM)
|
| 23 |
+
- **Cold** (NVMe)
|
| 24 |
+
- **Archive** (Object Store)
|
| 25 |
+
|
| 26 |
+
Only the TierSet for a request is eligible for routing; everything else has **zero activation probability**.
|
| 27 |
+
|
| 28 |
+
### Hierarchical Sparse Expert Routing (HSER)
|
| 29 |
+
Routing is hierarchical:
|
| 30 |
+
**Tier → Group → Expert**
|
| 31 |
+
with bounded activation:
|
| 32 |
+
`k_tier × k_group × k_expert` experts per token per layer.
|
| 33 |
+
|
| 34 |
+
This enables extreme parameter scaling while keeping per-token compute predictable.
|
| 35 |
+
|
| 36 |
+
### Enterprise runtime focus
|
| 37 |
+
Lite LLM is not only a model architecture—it is a runtime system:
|
| 38 |
+
- Distributed execution protocols
|
| 39 |
+
- Storage hierarchy and prefetching
|
| 40 |
+
- Secure loading and integrity verification
|
| 41 |
+
- Multi-tenant isolation, quotas, and compliance readiness
|
| 42 |
+
|
| 43 |
+
---
|
| 44 |
+
|
| 45 |
+
## Repositories
|
| 46 |
+
|
| 47 |
+
### Specifications (authoritative)
|
| 48 |
+
- `lite-llm-specs` — Enterprise Runtime Engineering Specification Corpus (SPEC‑001…SPEC‑060)
|
| 49 |
+
- `lite-llm-schemas` — JSON/YAML schemas for manifests, telemetry, policies
|
| 50 |
+
- `lite-llm-rfcs` — Design proposals and evolution process (RFCs)
|
| 51 |
+
|
| 52 |
+
### Reference implementations
|
| 53 |
+
- `lite-llm-runtime` — Rust runtime (routing, caches, dispatch, TierSet engine)
|
| 54 |
+
- `lite-llm-train` — Training orchestration, checkpointing, determinism harness
|
| 55 |
+
- `lite-llm-kernels` — Device kernels + safe wrappers (CUDA/HIP/Metal/CPU)
|
| 56 |
+
- `lite-llm-comm` — Transport abstraction (RDMA / NCCL / QUIC), collectives
|
| 57 |
+
- `lite-llm-storage` — Shards, manifests, tier placement, streaming + prefetch
|
| 58 |
+
|
| 59 |
+
### Tooling
|
| 60 |
+
- `lite-llm-cli` — Operator CLI (inspect checkpoints, tier policies, telemetry)
|
| 61 |
+
- `lite-llm-observability` — Metrics exporters, dashboards, tracing
|
| 62 |
+
- `lite-llm-deploy` — Helm charts, Terraform modules, bare‑metal playbooks
|
| 63 |
+
|
| 64 |
+
> The organization may not yet contain all repositories listed above; this is the intended long-term structure.
|
| 65 |
+
|
| 66 |
+
---
|
| 67 |
+
|
| 68 |
+
## Getting started
|
| 69 |
+
|
| 70 |
+
### 1) Read the specs
|
| 71 |
+
Start with:
|
| 72 |
+
- **SPEC‑001** Runtime Architecture Overview
|
| 73 |
+
- **SPEC‑003** Deterministic Routing Engine
|
| 74 |
+
- **SPEC‑004** Tiered Parameter Architecture (TPA)
|
| 75 |
+
- **SPEC‑005** Hierarchical Sparse Expert Routing (HSER)
|
| 76 |
+
- **SPEC‑006** Active Compute Bounding Model
|
| 77 |
+
- **SPEC‑021…030** Storage hierarchy (hot/warm/cold/archive)
|
| 78 |
+
- **SPEC‑041…050** Inference runtime (TierSet selection, dispatch, KV cache)
|
| 79 |
+
|
| 80 |
+
### 2) Implement the contracts
|
| 81 |
+
The specs are written to be directly implementable:
|
| 82 |
+
- Deterministic routing + stable sorting
|
| 83 |
+
- Tier placement policies and shard formats
|
| 84 |
+
- All‑to‑all dispatch and imbalance handling
|
| 85 |
+
- Audit logging and integrity verification
|
| 86 |
+
|
| 87 |
+
### 3) Validate determinism
|
| 88 |
+
Before performance optimization:
|
| 89 |
+
- Ensure cross-node routing reproducibility
|
| 90 |
+
- Validate deterministic collectives
|
| 91 |
+
- Use the replay engine during training
|
| 92 |
+
|
| 93 |
+
---
|
| 94 |
+
|
| 95 |
+
## Contribution
|
| 96 |
+
|
| 97 |
+
We welcome contributions in:
|
| 98 |
+
- Spec clarifications and testable invariants
|
| 99 |
+
- Rust runtime modules (memory model, routing, dispatch, caching)
|
| 100 |
+
- Deterministic training harness and replay tooling
|
| 101 |
+
- Storage tier orchestration and prefetch algorithms
|
| 102 |
+
- Security hardening and audit improvements
|
| 103 |
+
|
| 104 |
+
Please read:
|
| 105 |
+
- `CONTRIBUTING.md` for workflow and standards
|
| 106 |
+
- `CODE_OF_CONDUCT.md` for community expectations
|
| 107 |
+
- `SECURITY.md` for vulnerability reporting
|
| 108 |
+
|
| 109 |
+
---
|
| 110 |
+
|
| 111 |
+
## Security
|
| 112 |
+
|
| 113 |
+
Lite LLM emphasizes:
|
| 114 |
+
- Memory-safe runtime design in Rust
|
| 115 |
+
- Secure checkpoint loading and integrity verification
|
| 116 |
+
- Encryption at rest for tier storage
|
| 117 |
+
- Key management and auditability
|
| 118 |
+
- Sandboxing and capability isolation for extensions
|
| 119 |
+
|
| 120 |
+
See `SECURITY.md` to report vulnerabilities responsibly.
|
| 121 |
+
|
| 122 |
+
---
|
| 123 |
+
|
| 124 |
+
## Governance
|
| 125 |
+
|
| 126 |
+
The specification corpus is the **normative authority**.
|
| 127 |
+
Changes to the corpus should go through the RFC process:
|
| 128 |
+
1. Open an RFC in `lite-llm-rfcs`
|
| 129 |
+
2. Discuss and iterate
|
| 130 |
+
3. Land a spec patch with tests, invariants, and migration notes
|
| 131 |
+
|
| 132 |
+
---
|
| 133 |
+
|
| 134 |
+
## License
|
| 135 |
+
|
| 136 |
+
Lite-LLM is distributed under the Dust Open Source License
|
| 137 |
+
|
| 138 |
+
license: other
|
| 139 |
+
license_name: dosl-iie-1.0
|
| 140 |
+
license_link: https://github.com/lite-llm/lite-llm/raw/refs/heads/main/LICENSE
|
| 141 |
+
|
| 142 |
+
---
|
| 143 |
+
|
| 144 |
+
## Contact
|
| 145 |
+
|
| 146 |
+
- Security: see `SECURITY.md`
|
| 147 |
+
- General: open an issue in the relevant repository
|
| 148 |
+
|
| 149 |
+
---
|
| 150 |
+
|