size optimization

Morphcat Games explains how they fit Micro Mages, a full-featured NES game, into 40 kilobytes. It covers compression of sprites and level layouts and other space-saving tricks.

Nicholas Ormrod's CppCon 2016 talk on how Facebook optimizes std::string with its open-source replacement fbstring. It covers storage layout tradeoffs, small string optimization and memory allocation behavior.

Matt Godbolt, creator of Compiler Explorer, tours surprising optimizations modern compilers perform, such as turning loops into closed-form sums and using popcount instructions. He explores what the compiler does behind the scenes.

Andrei Alexandrescu's ACCU 2016 talk previews material from his book on writing fast code, with a focus on optimization techniques such as sentinels and faster search.

A visual scale comparison of stars and cosmic objects, from planets up to some of the largest known stars, set to music. It is meant to convey the vastness of the universe.

David Schachter describes how he made a data-collection Python program run 114,000 times faster, drawing on decades of experience. The talk covers pipelining, cache effects and other optimization lessons.

Chandler Carruth's CppNow 2013 keynote on how C++ builds complex software from simple emergent structures, and how compilers optimize them through inlining and value semantics.

A short look at the Voder, the first electronic voice synthesizer, demonstrated by Bell Labs at the 1939 World's Fair. It was operated by trained women using ten finger keys, foot pedals and a knee lever.

A 2-minute clip of US Representative Hank Johnson telling a congressional hearing he feared Guam would become so overpopulated that it would tip over and capsize. Johnson later said he was joking.

Emery Berger explains why performance is hard to measure and deliver on modern hardware, showing how code layout and alignment can swamp optimization effects. He presents Stabilizer for statistically sound evaluation and Coz, a causal profiler.

Chandler Carruth's CppCon 2014 talk on writing fast C++, explaining why data structure choice and memory layout matter more than clever algorithms. It covers why standard containers like unordered_map perform poorly on modern CPUs.

Dean Friedman's near-hour-long introduction to synthesis, covering the building blocks of sound and the controls on a synthesizer. He slowly adjusts knobs so viewers hear what each parameter does.

Andrei Alexandrescu's CppCon 2019 talk revisits sorting, showing how branchless tricks, hybrid strategies and a cost metric can speed up std::sort-style algorithms on modern hardware.

Matt Godbolt's CppCon 2017 talk shows what modern compilers do with your C++ code, using Compiler Explorer to inspect generated assembly. It covers surprising optimizations and how the tool works.

An Alan Kay talk on programming and scaling, covering theoretical limits of code size, engineering versus tinkering, and biological cells as inspiration for object-oriented design.

Chandler Carruth's CppCon 2016 talk tries to defuse the heated debate over undefined behavior in C and C++. He explains from the compiler writer's perspective why UB exists and how it enables optimization.

Musician Thoj performs a live looping session on the Teenage Engineering OP-1 synthesizer, building a deep house track layer by layer.

Hartverdrahtet by Akronyme Analogiker, the winning PC 4k intro at Revision 2012. It is a realtime demo with music and fractal visuals in 4096 bytes.

Christian Schafmeister presents CANDO at the 2016 European Lisp Symposium. It is a compiled Lisp-based language for designing macromolecules and nanoscale materials, built on the Clasp implementation of Common Lisp.

A run through the 32 factory presets of the Yamaha DX7 FM synthesizer, with timestamps for each patch such as brass, strings, pianos, bass and tubular bells. It is a straight audio demo of the sounds.

A one-minute clip of slime mold placed on a map with food at the cities around Tokyo, growing a network that approximates the Tokyo-area railway system.

Elevated by Rgba and TBC, the winner of the 4k intro compo at Breakpoint 2009. It is a realtime procedurally generated 3D flythrough with music, all in a 4096-byte executable.

A Commodore 64 demo by Linus Akesson that fits video and music into 256 bytes, winning the Oldskool 4K Intro compo at Revision 2017. A technical write-up accompanies it.

Jason Turner's CppCon 2016 talk builds a simple Commodore 64 game using C++17, showing how constexpr and const let a modern compiler produce tight 6502 code. He walks through assembly output to show abstractions being optimized away.

Jonathan Blow speaks at UC Berkeley's CSUA about how to program independent games. He argues for keeping code simple, avoiding unnecessary work, and shipping.

Mick Gordon's GDC 2017 session on composing the Doom (2016) soundtrack. He details his compositional process, production techniques and the experimental instrument and synth design behind the music.

Optiver's Carl Cook explains how to build high-frequency trading systems in C++, where the critical path runs rarely but must be extremely fast. He covers techniques for low and predictable latency, including avoiding main memory and cache misses.

A recording of .the .product by Farbrausch, the first-place 64k intro at The Party 2000. It fits an 11-minute 3D demo with music into 64 kilobytes.

Andrew Adams, a Halide developer, presents the Halide language for image processing and tensor computation. The talk explains the separation of algorithm from schedule with illustrated examples of parallelism, locality and redundancy tradeoffs.

John Oliver's Last Week Tonight segment on how media outlets report incomplete or untrue findings as settled science. It covers sensational headlines, small studies and pressure on researchers.

Peter Rizun and Andrew Stone present results of tests running 1 GB blocks on a Bitcoin test network at Scaling Bitcoin Stanford. The talk argues for big-block scaling and discusses its consequences.

Jan Vitek of Northeastern University gives a meetup talk on the challenges of making the R language run fast. He explains what in R's semantics makes it hard to optimize and to build a JIT compiler for.

Lukas Eder's Devoxx talk on how modern cost-based SQL optimizers rewrite and plan queries in ways developers would not expect. It argues that declarative SQL, used well, can run complex queries very fast.

A one-minute capture of Tim Clarke's 1993 'Mars' DOS demo, a roughly 5 KB program that renders a navigable terrain landscape in real time.

Rusty Russell and Matt Evans examine why Unix utilities like ls and cat grew from a few kilobytes to over a hundred kilobytes. They take apart common tools to see where the growth comes from.

The winning demo from Revision 2015's oldskool competition, running on a real 1981 IBM PC with CGA at 4.77MHz. It uses extreme tricks to produce effects, graphics and sound far beyond what the hardware was thought capable of.

A 2013 research demo of simulated bipedal creatures whose natural gaits are found by optimizing muscle-based controllers, with no motion capture or keyframe animation. It shows physics-based walking and running emerging from musculoskeletal models.

Christian Thalinger presents at the 2015 JVM Language Summit on adding ahead-of-time compilation to the JVM, covering the HotSpot team's AOT work and its relation to warmup and deoptimization.

A clip of psychologist Jordan Peterson lecturing on intelligence and IQ, covering how it is defined and its correlation with academic and work success.

A short clip of Jordan Peterson explaining Pareto distributions, using Soviet farm collectivization and the resulting famine as context. It also covers how outcomes concentrate in a few people.