软件的形态。

HN 首页化作一个鲜活的生命体——帖子按得分大小排布，每分钟重新轮询，排名与点数随版面的呼吸而起伏。

将 GitHub 的公共事件洪流渲染为一个缓缓旋转的星系盘——每一次新提交都点亮一颗星，按编程语言着色。

Step through esoteric-language programs as they run — a correct Brainfuck (and OOK!) interpreter that lights up the memory tape, the data pointer, the current instruction, and the output one command at a time.

Watch a tiny program flow through a real compiler — lexer to tokens, parser to AST, three-address IR, then stack-machine assembly — and step through how one construct maps stage to stage.

Watch bubble, quicksort, heap and friends sprint through the same shuffled deck, step for step, in their own lanes.

Type a pattern and watch a cursor sweep your text, lighting every match and capture group while a meter counts the engine’s steps and backtracks.

Watch BFS, Dijkstra, A* and Greedy Best-First flood a grid maze and race to trace the shortest path.

Hash a row of data blocks into a single root, then edit any leaf and watch one change cascade all the way up — or pull a Merkle proof that needs only log₂ n sibling hashes.

Watch keys get hashed, probe their way into buckets, collide, chain, and trigger a live rehash as the table fills.

Watch a branchy commit history build itself the way gitk draws it — commits pop in along colored lanes, branches fan out, and merges braid back together, replayed operation by operation.

Watch a garbage collector trace a live heap from its roots and reclaim the unreachable — mark-and-sweep, reference counting (and its fatal cycle leak), and a generational copying GC.

Type a number and watch its exact IEEE-754 bits unfold into sign, exponent and mantissa — click any bit to toggle it and learn first-hand why 0.1 is never really 0.1.

Edit two versions of a text and watch the diff form — added, removed and kept lines — then open the edit graph to see the algorithm trace the longest common subsequence that every git diff is secretly built on.

A classic five-stage RISC pipeline laid bare — watch instructions overlap, stall on data hazards, forward results, and flush on a mispredicted branch.

Hash servers and keys onto a ring; add or remove a node and watch only ~1/N of the keys move — while virtual replicas smooth the load.

A CPU cache visualizer that shows why memory access patterns dominate performance — hits versus misses, the cache line that brings neighbours along for free, and why row-major beats column-major.

Watch items fan out through k hash functions to light up a bit array, then probe queries that are "definitely not" or "possibly" in the set as false positives bloom.

Toggle the bits of two 32-bit integers and watch AND, OR, XOR, shifts and rotates compute live — binary, hex and signed/unsigned decimal all in sync, with presets that teach how computers actually manipulate bits.

Drop keys into a binary search tree and watch it pivot, recolor, and rebalance itself in real time — plain BST, AVL, or red-black.

Insert keys into a B-tree of order m and watch overflowing nodes split, promote their median upward, and grow the tree — the balanced, fat-node structure behind databases and filesystems.

五种排序算法——冒泡、归并、快速、基数与堆排序——在 3D 条形阵列上并行竞速，每次比较都伴随音频音调。

将 GitHub 代码仓库渲染为一座 3D 城市：文件是建筑（高度即代码行数），目录是街区，语言决定颜色。点击任意建筑即可阅读源代码。