durable structures

Erik Demaine's MIT 6.851 Advanced Data Structures lecture introducing succinct data structures, covering rank, select and tries. It is part of the Spring 2012 course.

Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast queries. It ties together the research and walks through his Haskell succinct library.

Juan Pedro Bolivar Puente explains immutable and persistent data structures in C++ and how they support value semantics. He presents the Immer library, rrb-trees, and a prototype text editor that opens a huge file instantly.

Chandler Carruth's CppCon 2016 talk on designing hybrid data structures for performance. He covers cache locality, working-set size and allocation overhead, and why standard C++ containers fall short.

Sean Parent's CppCon 2015 talk on better use of standard containers and the goal of having no incidental data structures. It argues that proper containers can greatly simplify code.

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.

Alexander Rose of the Long Now Foundation describes the design and construction of the 10,000 year clock conceived by Danny Hillis. He covers the project's history, methods, and how different cultures built things to last millennia.

Isaac Arthur examines Dyson spheres and swarms, including common myths and misconceptions. He covers uses such as interstellar travel, black hole generation, and computing large enough to simulate universes.

Lee Byron of Facebook explains how persistent immutable data structures work and how to use them in React apps with Immutable.js. He covers memoization benefits and avoiding coupling through shared mutable state.

Isaac Arthur explains the Matrioshka Brain, a hypothetical computer or artificial mind powered by an entire star using nested shells. It covers how such megastructures relate to Dyson spheres and superintelligence.

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 Channel 9 Going Deep interview in which Brian Beckman talks with Rich Hickey, creator of Clojure, about the language's design. It covers Clojure's persistent data structures, reference types and its approach to concurrency on the JVM.

An Isaac Arthur episode on arcologies, self-sufficient habitats that could house whole cities, on Earth or on harsh worlds. It covers how such structures might work and what limits their size.

Isaac Arthur examines the Dyson Dilemma, the puzzle of why we see no Dyson spheres or megastructures if growth-oriented civilizations should build them. He covers detectability and whether such structures could hide.

A Kurzgesagt animated explainer on how humanity could build a Dyson sphere, a swarm of structures capturing the sun's energy. It covers using Mercury's materials and a step-by-step construction approach.

Python core developer Raymond Hettinger explains how Python's dictionary implementation evolved into the compact, ordered dict in Python 3.6. He uses pictures and small bits of pure Python, and covers key-sharing, compaction and versioning.

Isaac Arthur explains the orbital ring, a megastructure launch-assist system that could move bulk cargo cheaply to orbit and beyond. He compares it with space elevators and discusses power transmission.

A 2007 Google Tech Talk in which Cliff Click of Azul Systems presents a lock-free concurrent hash table that scales to 768 CPUs. He explains why it is correct by reasoning in a different way than usual happens-before and memory-order arguments.

Kurzgesagt explains stellar engines such as the Shkadov thruster and Caplan thruster, which could move the Sun and solar system across the galaxy over millions of years to avoid hazards and reach new regions.

Malte Skarupke's C++Now 2018 talk on hash table performance, explaining why std::unordered_map is slow and memory hungry and presenting faster designs, including his bytell hash map.

A guest lecture Jon Gjengset gave at Two Sigma on using Rust for large, high-performance systems. It covers why Rust suits such projects, the Noria research database, a concurrent data structure used in it, and practical experience.

Stuart Armstrong of the Future of Humanity Institute gives an Oxford physics talk on what exploratory engineering suggests about the Fermi paradox. He argues that von Neumann probes and Dyson spheres are plausibly buildable and asks what traces advanced civilizations would leave.

Brian Karis's SIGGRAPH 2021 talk explains how Unreal Engine 5's Nanite virtualized geometry works. It covers mesh import, the data structures, streaming, decompression, culling, software and hardware rasterization, and shading.

A lecture from MIT's Missing Semester course covering version control with git. It builds up git from its data model rather than from commands.

Tom Stuart's Ruby Manor 3 talk builds FizzBuzz using nothing but Ruby lambdas, working through Church encodings of numbers, booleans and data structures. It is a hands-on introduction to lambda calculus.

Tim Hutton's demonstration of SmoothLifeL, a continuous version of Conway's Game of Life using floating point values. It shows gliders traveling in any direction, rotating pairs, and elastic cord-like structures, with config details to run it yourself.

James Trunk introduces Clojure syntax and thinking, covering its core data structures, immutability, the thread-last macro and live data analysis in the REPL.

Douglas Crockford's Nordic.js 2014 talk on 'the better parts' of JavaScript and programming in general. He argues against `this`, `new` and ES6 classes, and for classless, composition-based object patterns, with some broader remarks on building better structures for the future.

Scott Meyers explains how CPU caches work and why they matter for performance, covering cache levels, access speeds, associativity, and effects in multithreaded code. The focus is C++ and cache-aware, data-oriented programming.

Edward Kmett's talk to the NY Haskell User Group on the lens library, building from fmap and function composition up to lenses, folds and traversals. It shows how these composable combinators access and modify parts of data structures.

Chandler Carruth walks through tuning C++ performance, from writing benchmarks to analyzing results on real CPUs and compilers. It focuses on small-scale problems such as loop kernels, data structures and algorithms, and on keeping compilers from optimizing benchmarks away.

Permaculture instructor Andrew Millison visits the village of Garavadi in Maharashtra, India, which took part in the Paani Foundation's Water Cup competition. It shows the water harvesting structures the villagers built in 45 days and how they restored groundwater and the local economy.

A Strange Loop 2019 talk by Aaron Cummings on the computing systems aboard Voyager 1 and 2, which control the spacecraft and record and return data decades after launch in 1977.

Rich Hickey introduces Clojure to the NYC Java Study Group in the first of a two-part talk. It covers reader syntax, core data structures, code-as-data, evaluation, special operators, functions, macros and sequences, assuming no Lisp background.

Timothy Baldridge presents Pixie, a lightweight Lisp built on RPython, at Strange Loop 2015. It covers C interop, immutable data structures, fast startup and async-by-default IO.

A short video of a Boeing 777 wing being tested to destruction, finally breaking at 154 percent of its designed limit load. The wing is flexed upward until it fails.

The final part of Dan Gelbart's 18-part Building Prototypes series, focused on mechanical design. It opens with a demonstration of stiffness and covers practical design principles for prototype machines.

A Vox explainer on why California's high-speed rail project is years late and far over budget, with only a few concrete structures built by 2022. It covers the political, legal and routing challenges behind the delays.

An interview with Anders Hejlsberg, lead architect of TypeScript, about porting the TypeScript compiler to Go. He covers the 10x type-checking speedup, lower memory use, and why Go was chosen.

Alex Ionescu's OffensiveCon 2019 keynote on how reverse engineering is done on Windows without conventional reversing. It covers legal ways to obtain names of variables, exported functions and structures.