WRWEB ENGINEERING
REFORGING44 · 3/7
ALL LESSONS→WEEK 44→WEDNESDAY

CONSTRAIN · GRAPHICS, MEDIA + AUDIO

Shaders and buffers

GPU and real-time frontiers30–60 MINUTESCORE + PRACTICAL
01

GROUND

Problem

What becomes confusing, fragile, or impossible without understanding shaders and buffers? This lesson answers that through explanation, a worked example, two runnable exercises, and a reference solution. No teacher-supplied worksheet is required.

The web absorbed vector graphics, raster drawing, programmable GPUs, audio graphs, cameras, recording, and real-time communication.
02

LEARN

Concept explanation

Shaders and buffers belongs to “GPU and real-time frontiers”. shaders and buffers is learned by comparing readable, constrained, and deliberately clever implementations against same evidence.

For shaders and buffers, trace concrete input, state transition, output, and failure through a timed pipeline where sources become pixels, frames, samples, tracks, or GPU work before reaching a sink.

Graphics and media are pipelines: sources become decoded frames or samples, transformations run, then sinks render, record, or transmit. Apply that model to supplied normal, boundary, and failure cases; each case below names its input and expected evidence.

Observable

Evidence produced by the shaders and buffers experiment: output, state, trace, bytes, timing, or diagnostics.

Invariant

Condition that must remain true while inputs or implementation of shaders and buffers change.

Boundary

Point where shaders and buffers crosses ownership, representation, time, process, network, or trust.

Example bank

Compare normal, boundary, failure, and cross-layer cases. Predict each observation before revealing the explanation.

Baseline · one variable

SETUPSolve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections.

OBSERVEAll versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost.

WHY IT MATTERSThis isolates the normal contract of shaders and buffers; preserve its raw evidence as the control for every later comparison.

Boundary · same contract, harder input

SETUPRun all three implementations against: Resize, lose context/track, and throttle bandwidth.

OBSERVERecord what remains invariant and the first representation, owner, size, or timing value that changes in Canvas inspector · Media panel · Web Audio analyser.

WHY IT MATTERSA boundary example is useful only when one named dimension changes and everything else stays comparable.

Failure · evidence before repair

SETUPForce every implementation through: Compile invalid shader or reject permission and show recoverable state.

OBSERVECapture the first divergence from the baseline, including exact input, diagnostic, state, and recovery result. Expected recovery: All versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost.

WHY IT MATTERSThe diagnostic is part of the interface. Repair the proven cause, not the most visible symptom.

Cross-layer · follow ownership

SETUPTrace shaders and buffers one layer below its usual abstraction through a timed pipeline where sources become pixels, frames, samples, tracks, or GPU work before reaching a sink.

OBSERVEInspect scene or canvas state, media tracks, audio graphs, frame timing, memory, encoding, bandwidth, and dropped work.

WHY IT MATTERSThe lower layer is earned when it explains evidence the current layer cannot. Otherwise keep shaders and buffers at the simpler boundary.

03

SEE

Worked example

Start from supplied index.html. Focus: Solve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections.

  1. Run: Open index.html and inspect the rendered canvas and performance timeline.
  2. Save baseline evidence. Inspect scene or canvas state, media tracks, audio graphs, frame timing, memory, encoding, bandwidth, and dropped work.
  3. Boundary case: Run all three implementations against: Resize, lose context/track, and throttle bandwidth.
  4. Failure case: Force every implementation through: Compile invalid shader or reject permission and show recoverable state.
RESULT
All versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost. Starter-level baseline: A 480×240 blue canvas renders the lesson topic in white without console errors.
04

START HERE

Starter material

PREREQUISITESModern Chromium-based browser. Camera/microphone lessons require localhost and permission you grant yourself.

ONE-TIME SETUPSave index.html, run npx --yes serve ., then open the printed localhost URL.

Create index.html, paste this exact content, then run the command below.

<!doctype html>
<meta charset="utf-8">
<title>shaders and buffers</title>
<canvas width="480" height="240"></canvas>
<script>
  const ctx = document.querySelector('canvas').getContext('2d');
  ctx.fillStyle = '#2955ff'; ctx.fillRect(0, 0, 480, 240);
  ctx.fillStyle = 'white'; ctx.font = '24px system-ui'; ctx.fillText("shaders and buffers", 24, 60);
</script>
RUNOpen index.html and inspect the rendered canvas and performance timeline.

STOP / CLEANUPStop tracks in the page, close tab, then press Ctrl+C in server terminal.

05

DO WITH GUIDANCE

Guided exercise

Solve under constraint: shaders and buffers

  1. Normal case: Solve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections.
  2. Write predicted evidence from this named case before running starter.
  3. Keep readable baseline, then remove one convenience without hiding behavior.
  4. Run exact normal case. Save commands, inputs, outputs, and diagnostics in notebook.
  5. Explain changed evidence using lesson mental model in no more than five sentences.
Concrete guided solution
  1. Copy the supplied index.html unchanged and run: Open index.html and inspect the rendered canvas and performance timeline.
  2. Write this prediction before inspecting output: All versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost.
  3. Perform only the named normal case: Solve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections.
  4. Save the raw output, then annotate input → transition → evidence. Use Canvas inspector · Media panel · Web Audio analyser to confirm the transition rather than inferring it.
  5. Compare prediction with evidence; if they differ, keep both and write the rule that explains the difference. Reference baseline: A 480×240 blue canvas renders the lesson topic in white without console errors.
06

DO ALONE

Independent exercise

Compare three versions: shaders and buffers

  1. Create second case from blank file: Run all three implementations against: Resize, lose context/track, and throttle bandwidth.
  2. Then create controlled failure: Force every implementation through: Compile invalid shader or reject permission and show recoverable state.
  3. Use Canvas inspector · Media panel · Web Audio analyser to prove behavior, then repair controlled failure.
  4. Compare result against supplied acceptance checks and reference approach before marking complete.
Concrete independent solution
  1. Duplicate the starter into a clean comparison case; change only this boundary: Run all three implementations against: Resize, lose context/track, and throttle bandwidth.
  2. Save its evidence beside the baseline and identify the first changed value. Inspect scene or canvas state, media tracks, audio graphs, frame timing, memory, encoding, bandwidth, and dropped work.
  3. Create the exact controlled failure: Force every implementation through: Compile invalid shader or reject permission and show recoverable state.
  4. Version A: use clearest native primitives and name every intermediate state for shaders and buffers.
  5. Version B: remove one convenience while preserving same input/output contract.
  6. Version C: compress only after A and B pass baseline: Render one triangle, capture screen track, and connect two local peer connections.
  7. Run shared boundary and failure fixtures against all versions: Resize, lose context/track, and throttle bandwidth. / Compile invalid shader or reject permission and show recoverable state.
  8. Keep A unless another version has measured benefit; expected invariant: Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.
  9. Rerun baseline, boundary, and repaired failure together. Accept only if all reproduce: All versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost.
07

COMPARE

Expected result

  • All versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost.
  • A 480×240 blue canvas renders the lesson topic in white without console errors.
  • Controlled shaders and buffers failure produces captured evidence; repair restores stated invariant without hiding error.
08

PROVE

Acceptance checks

Lesson is complete only when every check is true. Each check is stored locally and travels with your JSON backup.

0/5 complete · saved on this device

09

UNSTICK

Hints

Reveal hints
  1. Start with supplied normal case exactly as written: Solve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections.
  2. For boundary case, change only named dimension: Run all three implementations against: Resize, lose context/track, and throttle bandwidth.
  3. If result is confusing, diff raw inputs and evidence before editing implementation.
  4. If tool shows nothing useful, move observation one boundary lower: representation, runtime, OS, or network.
10

VERIFY

Solution

Attempt both exercises before opening reference approach.

Reveal reference solution
  1. Run unmodified starter and preserve baseline evidence: A 480×240 blue canvas renders the lesson topic in white without console errors.
  2. Version A: use clearest native primitives and name every intermediate state for shaders and buffers.
  3. Version B: remove one convenience while preserving same input/output contract.
  4. Version C: compress only after A and B pass baseline: Render one triangle, capture screen track, and connect two local peer connections.
  5. Run shared boundary and failure fixtures against all versions: Resize, lose context/track, and throttle bandwidth. / Compile invalid shader or reject permission and show recoverable state.
  6. Keep A unless another version has measured benefit; expected invariant: Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.
11

PREDICT · INSPECT · BREAK · DEBUG · MEASURE

Interrogate reality

Prediction: write expected output, state transition, ordering, and failure evidence before running either exercise.

Inspection: Inspect SVG DOM, canvas state, GPU frames conceptually, audio graphs, media tracks, permissions, and recording output.

Measurement: Track frame time, dropped frames, memory, sample latency, encoding cost, bandwidth, and power use.

INSPECT

Capture raw evidence before explaining.

BREAK

Change one assumption and force controlled failure.

DEBUG

Find cause with Canvas inspector · Media panel · Web Audio analyser before editing fix.

TOOL DRILL · keyboard only · record one retrievable command or shortcut
12

MASTERY + FRONTIER + BOUNDARY

Own the knowledge

TEACH

Explain shaders and buffers at beginner, intermediate, and senior depth.

REBUILD

Recreate smallest useful example from blank file without notes or AI.

RETRIEVE

Schedule recall for day 1, 7, 30, and 90.

Creative frontier lab

Try first without opening the solutions. The constraints invite invention; the reference gives one concrete direction, never the only valid answer.

Constraint inversion

Re-solve shaders and buffers by removing the most convenient abstraction. render the same scene through two pipelines and compare interaction—not appearance alone.

CONSTRAINTKeep the same inputs, observable result, and failure evidence; change the means, not the contract.

ORIGINAL IDEATurn subtraction into a design tool: the missing abstraction should reveal which responsibility it used to hide.

Reveal frontier solution
  1. Freeze the contract as three fixtures: Solve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections. / Run all three implementations against: Resize, lose context/track, and throttle bandwidth. / Force every implementation through: Compile invalid shader or reject permission and show recoverable state.
  2. List every convenience used by the starter; remove the highest-level one while preserving Open index.html and inspect the rendered canvas and performance timeline..
  3. Implement the smallest replacement using render the same scene through two pipelines and compare interaction—not appearance alone.
  4. Run all fixtures and compare raw evidence. Keep the simpler version unless the removed abstraction has a demonstrated benefit.
Representation x-ray

Build an explanation artifact for shaders and buffers: draw pipeline timing, frame cost, sample levels, track state, and dropped work beside the output.

CONSTRAINTA peer must be able to locate the first divergence without reading implementation code.

ORIGINAL IDEATreat the explanation itself as a product: make invisible transitions visible, replayable, and diffable.

Reveal frontier solution
  1. Create one row or timestamped event for each transition in: Solve shaders and buffers three ways using identical fixture: Render one triangle, capture screen track, and connect two local peer connections.
  2. For every row record input, representation, owner, operation, output, and tool evidence from Canvas inspector · Media panel · Web Audio analyser.
  3. Replay Run all three implementations against: Resize, lose context/track, and throttle bandwidth.; highlight only changed rows.
  4. Replay Force every implementation through: Compile invalid shader or reject permission and show recoverable state.; stop at the first divergent row and attach its recovery action.
Adversarial remix

Combine the boundary and failure into a new user-visible scenario for shaders and buffers. translate one data stream into both a visual and audible representation.

CONSTRAINTDo not merely add more input. Invent a recovery interaction, alternate representation, or self-checking behavior.

ORIGINAL IDEAMake the system teach its own limits: the artifact should expose the invariant and offer a safe next action when it breaks.

Reveal frontier solution
  1. Combine these two pressures without changing them: Run all three implementations against: Resize, lose context/track, and throttle bandwidth. AND Force every implementation through: Compile invalid shader or reject permission and show recoverable state.
  2. Name the invariant that must survive and the user-visible evidence when it cannot: All versions preserve Frame/track/peer lifecycle is logged; failures identify pipeline stage and release resources.; comparison records code size, predictability, and debugging cost.
  3. Implement this original direction: translate one data stream into both a visual and audible representation.
  4. Demonstrate baseline, combined failure, recovery, then baseline again; save the sequence as a regression fixture.

Capability frontier

Push shaders and buffers until another layer becomes justified. Record one robust technique, one contextual trade-off, and one labeled hack or historical curiosity.

CORE · PRACTICAL · CONTEXTUAL · HACK · FRAGILE · HISTORICAL · GOLF

Boundary

Real-time media demands careful scheduling and resource ownership; DOM abstractions alone do not guarantee timing.

If this vanished tomorrow…

Use DOM/CSS visuals, server-rendered media, native media elements, and precomputed assets.

Why next layer is earned

Hardening is earned once a real system exists to profile, attack, leak, and make accessible.