You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
LLM Architectures Explained: how language-model architectures differ, model by model, with every value sourced, a tested cost model and diagrams generated from the data.
Interactive explainer: BDH's attention has no softmax, so it is exactly a Hebbian synaptic memory — one fixed-size matrix written once per token. Run both forms, watch them agree to 1e-16, then break it with one toggle. DataForge 2026, Pathway track.
The complete ASD-STE100 Simplified Technical English skill for Claude Code, Codex, and LLMs. Features Andrej Karpathy's Ladder of Understanding (STE-100, diagrams, interactive HTML, 3b1b video), linter, and prompt compiler.
Multi-audience interactive explainers (JEPA & world models, orbital mechanics, quantum computing, elasticity, electromagnetism) + the Claude Code skill that generates them
Language as lossy compression of thought: an interactive explainer, in a single self-contained HTML file, on which kinds of thought survive being put into words.
GPU Kernels Explained: how a GPU actually executes the maths (memory hierarchy, roofline, coalescing, bank conflicts, occupancy, GEMM, FlashAttention), animated by a tested execution model.
Agent Security Explained: how to build agents that stay safe, defences only: trust boundaries and labels, untrusted input, the lethal trifecta, least privilege and sandboxing, driven by a tested policy engine.
Agent Harnesses Explained: the loop between a model and the world (tools, permissions, context, caching, sub-agents), animated by a deterministic simulator whose Python and TypeScript halves agree token for token.
LLM Inference Explained: an interactive guide to how real systems serve language models, from the KV cache and roofline to batching, speculative decoding and disaggregated serving, with a tested simulator in your browser.
Agent Evals Explained: how to tell whether an agent is good, and how sure you can be: benchmarks, pass@k vs pass^k, intervals, paired comparisons, graders and cost, driven by a tested engine.
Agent Orchestration Explained: agents as graphs, steps and checkpoints, multi-agent patterns and durable runs, on an engine checked against real LangGraph in CI.
Numerics Explained: number formats and quantisation for AI (FP16 to FP4, MX, rounding, accumulation, quantisers), animated by a bit-exact numerics library checked against numpy and ml_dtypes.
Inference Trade-offs Explained: which serving lever helps which metric, for which workload, from a recorded sweep of a discrete-event simulator that also runs in your browser.
Interactive explainer of "LLM Orchestration with Geometry-Aware Memory" (IEEE ICBDML 2026): nine scroll-driven chapters on hyperbolic memory, orchestration and synthesis, plus the poincare-ball TypeScript package.