RISHI
SHARMA
Ship | Build | Scale. Zero fluff.
I turn engineering into a competitive advantage — build secure platforms that scale, teams that thrive, and AI that delivers real customer value.
25+
Years building
43M
DAU peak
£700M
Saved at Tesco
250+
Engineers led
CredentialsMore →
Recent writingMore →
The Thinking Machine Chronicles #0002: Electricity Learns to Think: Shannon's Boolean Algebra for Circuits
In 1937, MIT master's student Claude Shannon showed that Boolean algebra, an abstract 19th-century mathematics, maps perfectly onto electrical switching circuits. Every digital computer ever built rests on this 71-page thesis.
May 7, 2026
12 min read
Inside SubQ: How a Fully Sub-Quadratic Sparse-Attention Architecture Actually Works
Standard transformers compare every token to every other token — that's O(n²) compute. SubQ's Sparse Attention Architecture (SSA) finds which of those relationships actually matter and attends only to those, achieving near-linear scaling. This article digs into how that works, why all previous attempts compromised on quality, and what SubQ's benchmark numbers tell us about whether they've finally cracked it.
May 5, 2026
15 min read
The Thinking Machine Chronicles #0001: The Paper That Started Everything: Turing's "On Computable Numbers"
In 1936, a 24-year-old Cambridge postgraduate named Alan Turing solved Hilbert's Entscheidungsproblem and, in doing so, described a theoretical machine that is the ancestor of every computer ever built.
May 2, 2026
12 min read
Recent projectsMore →
TMC #0002: Boolean Circuit Simulator
A Python implementation of Shannon's 1937 algebraic model of switching circuits. Composable gate primitives, truth table generation, SOP/POS canonical forms, Shannon cofactor expansion, and a ripple-carry adder, all from first principles.
May 7, 2026
SubQ Sparse Attention — Simulator & Benchmark
A Python implementation of dense vs. sparse attention patterns — sliding window, LSH-bucketed, and top-k learned routing — with a retrieval recall benchmark that shows why prior sparse attention approaches degraded at scale and what a learnable router buys you.
May 5, 2026
TMC #0001: Turing Machine Simulator
A faithful Python implementation of the formal Turing machine model from the 1936 paper. Includes parity checker, palindrome recogniser, unary adder, and a demonstration of the Universal Turing Machine concept via machine encoding.
May 2, 2026