What Happens When You Load YouTube

A continuous 2D technical walkthrough follows a single browser request from the moment a user types youtube.com to the page rendering. It visualizes DNS resolution, TCP handshake, TLS negotiation, HTTP request routing through a load balancer, application server processing, cache lookups, and database queries. Animated packets and camera zooms keep each stage visually distinct and sequential. Useful for computer science students, web developers, and anyone studying networking or backend system design fundamentals.

Narrated · 16:9 · Preview before teaching · automatic layout checks do not establish subject accuracy

The prompt that made it

Create one 3-minute continuous technical animation explaining what happens when a user types youtube.com, following one request through DNS, TCP, TLS, HTTP, load balancing, application servers, cache and database. Use clean 2D technical visualization, consistent components, animated packets and camera zooms. Prioritize technical accuracy.

Make your own version

Make the next one in this series

• Zoom into how TLS handshakes establish encryption keys before any data is sent
• Show what happens during a cache miss versus a cache hit at the application layer
• Animate how a CDN serves video content differently from a standard web page request

Related animations

How A Perceptron Makes A Decision

This animation visualizes a single perceptron processing weighted inputs, summing them with a bias, and passin…

From logic gates to arithmetic: the half adder

This animation shows how a half adder circuit uses an XOR gate to compute the sum bit and an AND gate to compu…

Minimum spanning tree with Kruskal's algorithm

A weighted graph is processed by sorting all edges from cheapest to most expensive, adding each one only if it…

Fibonacci: the recursion tree repeats work; memoisation removes it

This animation draws the full recursion tree for fib(5), showing all 15 calls and highlighting the repeated su…

Recursion on the call stack: 5! unwinds

This animation visualizes fact(5) as it pushes five stacked frames, one for each recursive call, until reachin…

Binary search tree: smaller left, larger right

Values 50, 30, 70, 20, 40, 60, 80, and 35 are inserted one at a time into a binary search tree, with each comp…