Copyright © 2026 OyList. All Rights Reserved.
Share
Items21
1
The Internet: Packets, Routing & Reliability
A natural place to start, because every email, video call and web page you use travels this way. Vint Cerf, one of the internet's founders, and Spotify engineer Lynn Root show how a message is chopped into small pieces called packets, sent by whatever route is cheapest at the moment, and checked off at the other end so nothing goes missing.
It runs about six minutes, with animation doing the heavy lifting. Afterward, phrases like "dropped packets" or "the request timed out" stop sounding like jargon and start sounding like a postal system having a bad day.
More about The Internet: Packets, Routing & Reliability2
The Internet: IP Addresses & DNS
"It's always DNS" is an engineering in-joke, and this short video explains why. Vint Cerf and software engineer Paola Mejia cover how every device on a network gets a numeric address and how the Domain Name System turns a friendly web address into that number.
At under seven minutes it pairs naturally with the packets video from the same Code.org series. It is the one to watch before your next outage review, when someone says a site was up but nobody could find it.
More about The Internet: IP Addresses & DNS3
The Internet: How Search Works
A search box looks instant, but the work happens long before you type. John, who led search and machine learning at Google, and Akshaya from Microsoft Bing explain how programs called spiders crawl the web ahead of time to build an index, and what decides which results come first.
It also touches on how search engines fight spam and use your location, all in about five minutes. Handy context for any conversation about search features, ranking or why a page "isn't indexed yet".
More about The Internet: How Search Works4
What is an API? (in 3 minutes)
Three and a half minutes, one analogy, and "we'll expose it through an API" finally makes sense. The video casts an API as a waiter in a restaurant: you never deal with the back of house yourself, you hand your order to someone who carries it there and brings back what you asked for.
It was made by MuleSoft, a company that sells API software, so expect a little of its own world. The waiter picture is the part worth keeping, and it holds up well when engineers start talking about requests, responses and connecting one product to another.
More about What is an API? (in 3 minutes)5
The Internet: Encryption & Public Keys
The padlock in your browser, explained in under seven minutes. Mia Epner, who works on security for a US national intelligence agency, starts with simple scrambled-letter ciphers and builds up to public and private keys, 256-bit encryption and the HTTPS connection behind online banking and checkout pages.
It is the broadest security primer here, so it makes a good first watch on the subject. The Diffie-Hellman and 256-bit videos on this list then fill in the two questions it raises: how strangers agree on a secret, and why guessing a key is hopeless.
More about The Internet: Encryption & Public Keys6
Diffie-Hellman Key Exchange
How do two strangers agree on a secret while everyone is listening? Art of the Problem answers with paint. Each side mixes a private color into a shared public one, swaps the result, and adds its own color again, ending with the same shade that an eavesdropper cannot unmix.
The video then explains the math the paint stands in for, which lands far more gently once you already hold the picture. It also tells the story of how public key cryptography came about, and the whole thing runs under nine minutes.
More about Diffie-Hellman Key Exchange7
How secure is 256 bit security?
"It uses 256-bit encryption" sounds like marketing until 3Blue1Brown makes the number physical. In about five minutes Grant Sanderson asks how long guessing and checking would take, then stacks up imaginary computers, planets and galaxies working on the problem until the answer stops being a number you can picture.
There is no math to follow beyond multiplying by four billion again and again, and the animation does the persuading. It is the reason engineers shrug at brute-force attacks and worry about stolen passwords instead.
More about How secure is 256 bit security?8
Hashing Algorithms and Security - Computerphile
If "we store the hash" has ever ended a conversation you wanted to follow, start here. Tom Scott explains what hashing algorithms are for: checking that a file is authentic and has not been tampered with on its way to you.
He then asks how secure they really are, and why the algorithms in use keep changing as old ones are found wanting. About eight minutes, and the natural first step before the password video that follows it here.
More about Hashing Algorithms and Security - Computerphile9
How NOT to Store Passwords! - Computerphile
The practical follow-up to the hashing video, and the one that makes sense of so many breach headlines. Tom Scott walks through the bad ways websites have kept passwords, from plain text upward, and lands on hashing with a salt, a random extra string added for each user so that two identical passwords no longer look the same in a stolen database.
It runs just over nine minutes. Watch it and you will know what to ask when a supplier says your users' passwords are "encrypted", and why that word alone is not the reassuring answer.
More about How NOT to Store Passwords! - Computerphile10
Hacking Websites with SQL Injection - Computerphile
The classic website attack, explained as a trick of language rather than wizardry. Tom Scott shows how a site that pastes whatever you type straight into its database query can be fooled into running your words as commands, letting an attacker read or wipe data through an ordinary login box.
His example is a site written in PHP, and he talks through the query it builds, but you only need to follow which text came from the visitor. Nine minutes in, "sanitize your inputs" stops being a developer slogan and becomes common sense.
More about Hacking Websites with SQL Injection - Computerphile11
Representing Numbers and Letters with Binary: Crash Course Computer Science #4
Everything a computer holds, from texts to photos, is ones and zeros, and this episode shows how that works without hand-waving. Carrie Anne Philbin counts in binary, explains bits and bytes, and shows how agreed tables of numbers became letters, ending with the universal encoding that rescued email from garbled text.
At under eleven minutes it is the foundation for the storage and memory videos on this list. Afterward "8-bit", "32-bit" and "a megabyte" become sizes you can reason about rather than labels on a box.
More about Representing Numbers and Letters with Binary: Crash Course Computer Science #412
Characters, Symbols and the Unicode Miracle - Computerphile
Why does a name with an accent sometimes turn into a string of junk symbols? Tom Scott explains how the web settled on one standard for the characters of every writing system, and then shows the clever design of UTF-8, which kept old English-only text working while making room for everything else.
It is under ten minutes, and Tom Scott is openly delighted by the engineering, which is infectious. Useful the next time a bug report mentions "encoding" or a form mangles a customer's name.
More about Characters, Symbols and the Unicode Miracle - Computerphile13
Floating Point Numbers - Computerphile
Why do a computer's sums with decimals sometimes come out very slightly wrong? Tom Scott explains floating point, the scientific-notation trick computers use to handle huge and tiny numbers quickly, and why that speed comes at the cost of small rounding errors.
The payoff for anyone near a product with prices in it is the question the video sets out to answer: why floating point cannot do money. Nine minutes, and the engineers' insistence on handling amounts differently will make sense.
More about Floating Point Numbers - Computerphile14
The Problem with Time & Timezones - Computerphile
More than four million views, and it earns every one. Tom Scott starts with a feature that sounds trivial, a web app that shows how many seconds ago something happened, and then piles on daylight saving changes, time zones that move and places that skipped whole days, getting more exasperated by the minute.
There is no code to follow, just a man and a mounting list of exceptions. Watch it before you next ask why a "simple" scheduling or reminders feature needs a whole sprint.
More about The Problem with Time & Timezones - Computerphile15
Compression: Crash Course Computer Science #21
How does a song or a photo shrink to a fraction of its size? Carrie Anne Philbin explains the two kinds of compression: lossless, which gives back exactly what went in, and lossy, which throws away detail human eyes and ears are unlikely to notice.
That distinction is the one to carry into meetings about image quality, upload limits or streaming costs. At just under thirteen minutes it is one of the longer entries, but it moves briskly through clear animated examples.
More about Compression: Crash Course Computer Science #2116
How do SSDs Work?
Where does a downloaded podcast physically go? Branch Education opens up a smartphone's storage chip, the same kind used in SSDs and flash drives, and flies the camera down into its stacked layers of microscopic cells, each holding a little trapped charge that stands for ones and zeros.
The 3D animation is the draw: it turns "storage" from an abstraction into a place. It runs about eighteen minutes, so save it for a quiet evening rather than a coffee break.
More about How do SSDs Work?17
How does Computer Memory Work?
Why does a computer need both memory and storage, and why do programs take time to load? Branch Education answers by following data from an SSD into DRAM, the computer's working memory, then zooming into the nanoscopic capacitors that hold each bit and showing how they are read, written and constantly refreshed.
At over thirty-five minutes this is the longest entry by far, and it gets more detailed as it goes; stop once the first questions are answered and you will still have the key distinction. The video carries a plug for a memory maker's SSDs.
More about How does Computer Memory Work?18
Intro to Algorithms: Crash Course Computer Science #13
An algorithm is just a recipe of steps, and this episode shows why some recipes are dramatically faster than others. Carrie Anne Philbin compares ways of sorting a list, the kind of job behind finding cheap airfares, and shows how each approach slows down as the data grows, before turning to graph search, the problem behind map directions.
That middle idea is what engineers mean when they say something "won't scale". A short stretch of on-screen pseudocode appears, but the animated sorting does the explaining; under twelve minutes.
More about Intro to Algorithms: Crash Course Computer Science #1319
Data Structures: Crash Course Computer Science #14
The vocabulary episode. Carrie Anne Philbin explains the shapes data is organized into so a program can store it and find it again: arrays, strings, pointers and nodes, then stacks, heaps and trees, each drawn as boxes and arrows rather than code.
It moves fast through a lot of terms in ten minutes, so it rewards a second watch. Afterward, "push it onto the stack" or "a tree of comments" become pictures rather than noises.
More about Data Structures: Crash Course Computer Science #1420
Dijkstra's Algorithm - Computerphile
The idea behind the routes a GPS app suggests, worked through by hand. Dr. Mike Pound draws a small network of points and connections, then shows step by step how Dijkstra's algorithm finds the shortest path by always exploring the closest unvisited point next.
Watching an algorithm run on paper is the best cure for thinking of one as magic, and this example is small enough to follow every move. Just under eleven minutes, and a good companion to the Crash Course algorithms episode, which sets up the same graph-search problem.
More about Dijkstra's Algorithm - Computerphile21
What on Earth is Recursion? - Computerphile
Recursion, a process that solves a problem by calling a smaller version of itself, is the idea most likely to leave non-programmers lost, and Professor David Brailsford admits it can be hard to get your head around. He makes it graspable by working out the factorial of four, layer by layer, until the answers come back up the chain.
The channel compares it to something from the film Inception, dreams within dreams, which is a decent mental picture to bring along. He frames the example as a short function in a programming language, but the step-by-step arithmetic carries it; under ten minutes.
More about What on Earth is Recursion? - Computerphile
