@maniclang/workbench 0.1.11

package/examples/creator-one-tile-pattern-story.manic

@@ -0,0 +1,169 @@
+// Creator problem: count a hexagonal mosaic without counting 37 tiles one by
+// one. `repeat` constructs the exact layers; counters and semantic LaTeX turn
+// the geometry into a short visual proof.
+
+title("How Many Tiles Are in Three Hexagonal Rings?");
+canvas("9:16");
+template("blank");
+
+creator(me, "@anish2good name=Manic_Geometry tagline=Patterns_made_visible yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=cyan secondary=magenta footer=compact cta=Create_without_keyframes safe=clean");
+socials(me);
+watermark(mark, (w*0.16, h*0.055), "Made With Manic");
+endcard(me, "title=Turn_Patterns_Into_Proofs cta=8gwifi.org/manic");
+
+let u = (w+h-abs(w-h))/1080;
+let boardY = h*0.43;
+let tileR = 19*u;
+
+text(kicker, (cx,h*0.105), "MANIC · VISUAL COUNTING");
+text(headline, (cx,h*0.17), "Three rings surround one tile.");
+text(question, (cx,h*0.235), "How many tiles are there altogether?");
+text(caption, (cx,h*0.77), "Do not count one by one. Count what each ring adds.");
+size(kicker, 20*u); bold(kicker); color(kicker, cyan);
+size(headline, 31*u); bold(headline); wrap(headline,w*0.80);
+size(question, 25*u); bold(question); wrap(question,w*0.78); color(question,gold);
+size(caption, 22*u); bold(caption); wrap(caption,w*0.78); color(caption,dim);
+
+// One regular hexagonal tile is the only authored artwork.
+polygon(tile,
+  (cx,boardY-tileR),
+  (cx+0.866*tileR,boardY-0.5*tileR),
+  (cx+0.866*tileR,boardY+0.5*tileR),
+  (cx,boardY+tileR),
+  (cx-0.866*tileR,boardY+0.5*tileR),
+  (cx-0.866*tileR,boardY-0.5*tileR));
+color(tile, gold); glow(tile, 0.75);
+
+// The question silhouette: all 37 tiles, deliberately subdued.
+repeat(questionField, tile,
+  "layout=hex rings=4 spacing=39 rotate=30 scale=0.90");
+color(questionField, dim); opacity(questionField,0.30);
+untraced(questionField);
+
+// Declare largest first and smallest last. When all four groups are visible,
+// the later cumulative layers cover their shared interior, leaving each newly
+// added ring in its own semantic colour.
+repeat(layer4, tile,
+  "layout=hex rings=4 spacing=39 rotate=30 scale=0.90");
+color(layer4,lime); hidden(layer4); untraced(layer4);
+
+repeat(layer3, tile,
+  "layout=hex rings=3 spacing=39 rotate=30 scale=0.90");
+color(layer3,magenta); hidden(layer3); untraced(layer3);
+
+repeat(layer2, tile,
+  "layout=hex rings=2 spacing=39 rotate=30 scale=0.90");
+color(layer2,cyan); hidden(layer2); untraced(layer2);
+
+repeat(layer1, tile,
+  "layout=hex rings=1 spacing=39 rotate=30 scale=0.90");
+color(layer1,gold); hidden(layer1); untraced(layer1);
+
+hidden(tile);
+
+counter(total, (cx,h*0.655), 1, 0, "TOTAL  ", "  TILES");
+size(total,25*u); bold(total); color(total,gold); hidden(total);
+
+equation(work, (cx,h*0.70),
+  `N=\textcolor{gold}{1}+\textcolor{cyan}{6}+\textcolor{magenta}{12}+\textcolor{lime}{18}`,
+  31*u);
+hidden(work);
+
+hidden(kicker); hidden(headline); hidden(question); hidden(caption);
+
+step("pose the mosaic problem") {
+  par {
+    show(kicker,0.35);
+    show(headline,0.50);
+    show(question,0.45);
+    show(caption,0.40);
+    draw(questionField,1.25,smooth);
+  }
+}
+wait(1.10);
+
+step("focus on the construction") {
+  par {
+    fade(questionField,0.35);
+    say(caption,"Begin with the single centre tile.",0.40);
+    cam((cx,boardY),0.45,smooth);
+    zoom(1.10,0.45,smooth);
+    show(total,0.35);
+  }
+  show(layer1,0.05);
+  draw(layer1,0.45,smooth);
+  pulse(layer1,0.55);
+}
+wait(0.40);
+
+step("the first ring adds six") {
+  par {
+    show(layer2,0.05);
+    to(total,value,7,0.55,smooth);
+    say(caption,"Ring 1 adds 6 tiles: one on each side.",0.40);
+  }
+  stagger(0.055) {
+    for i in 0..7 { draw(layer2.i{i},0.28,smooth); }
+  }
+}
+wait(0.35);
+
+step("the second ring adds twelve") {
+  par {
+    show(layer3,0.05);
+    to(total,value,19,0.65,smooth);
+    say(caption,"Ring 2 has twice as many positions, so it adds 12.",0.45);
+  }
+  stagger(0.035) {
+    for i in 0..19 { draw(layer3.i{i},0.22,smooth); }
+  }
+}
+wait(0.35);
+
+step("the third ring adds eighteen") {
+  par {
+    show(layer4,0.05);
+    to(total,value,37,0.75,smooth);
+    say(caption,"Ring 3 adds 18 more. Every new ring contributes another six.",0.45);
+  }
+  stagger(0.022) {
+    for i in 0..37 { draw(layer4.i{i},0.18,smooth); }
+  }
+}
+wait(0.55);
+
+step("write what the colors counted") {
+  par {
+    show(work,0.50);
+    say(caption,"The colored layers give the sum directly.",0.40);
+    cam((cx,cy),0.45,smooth);
+    zoom(1.0,0.45,smooth);
+  }
+}
+wait(0.55);
+
+step("recognize the pattern") {
+  rewrite(work, `N=1+6(1+2+3)`,0.80,smooth);
+  say(caption,"Factor out six: the ring numbers form a triangular sum.",0.45);
+}
+wait(0.55);
+
+step("solve") {
+  par {
+    rewrite(work, `N=\textcolor{lime}{37}`,0.85,smooth);
+    say(caption,"So the mosaic contains exactly 37 tiles.",0.45);
+    pulse(total,0.80);
+    recolor(headline,gold,0.50);
+  }
+}
+wait(1.10);
+
+step("call to action") {
+  par {
+    fade(kicker,0.30); fade(headline,0.30); fade(question,0.30);
+    fade(caption,0.30); fade(total,0.30); fade(work,0.30);
+    fade(layer1,0.35); fade(layer2,0.35); fade(layer3,0.35); fade(layer4,0.35);
+    fade(me.footer,0.30); show(me.endcard,0.60);
+  }
+}
+wait(1.80);

package/examples/creator-pathfinding.manic

@@ -0,0 +1,82 @@
+// The Shortest Path — a Short where VECTOR art poses the problem and a Manic
+// ALGORITHM solves it. An imported robot and pin (crisp `svg()` vectors) sit at the
+// start and goal of a maze; a naive straight line cuts through the walls; then A*
+// (`gridastar`) searches the space cell-by-cell and traces the true shortest route.
+// Vectors imported, path computed — Manic does both, in one branded 9:16 file.
+title("The Shortest Path");
+canvas("9:16");
+template("shorts");
+
+voice("elevenlabs");                       // promo narration (ELEVENLABS_API_KEY)
+// voice("elevenlabs", "alice");
+// voice("cartesia");  // voice("gtts");   // free fallback
+// speak("…") = voice only; say(cap, "…") = on-screen caption.
+
+creator(me, "@anish2good name=Manic tagline=Turn_plain_text_into_amazing_math_videos yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=cyan secondary=gold footer=signature cta=Try_it_free safe=reels");
+watermark(mk, (w*0.955-100, h*0.045+24), "Made With Manic");
+
+// --- the maze grid + the cell geometry (so the vector icons land on cells) ---
+let cs = w*0.11;
+let gx = cx;
+let gy = h*0.43;
+let sx = gx - 2.5*cs;   let sy = gy - 3.5*cs;   // start cell (0,0) centre
+let px = gx + 2.5*cs;   let py = gy + 3.5*cs;   // goal  cell (5,7) centre
+
+grid(g, "@ . . . . . ; # # # # # . ; . . . . . . ; . # # # # # ; . . . . . . ; # # # # # . ; . . . . . . ; . # # # # *", (gx, gy), 6, 8, cs);
+neighbors(g, "4");
+
+// --- imported vector characters (faithful colours, crisp at any size) ---
+svg(bot, (sx, sy), "asset:svg/robot.svg", cs*0.8);   z(bot, 6);   hidden(bot);
+svg(dest, (px, py), "asset:svg/pin.svg", cs*0.8);    z(dest, 6);  hidden(dest);
+
+// the naive "just go straight" line — cuts across the walls
+line(naive, (sx, sy), (px, py)); color(naive, red); dashed(naive); z(naive, 4); hidden(naive);
+
+text(hook, (cx, h*0.12), "Can the robot reach the pin?");
+size(hook, 34); color(hook, gold); bold(hook); wrap(hook, w*0.82);
+text(cap, (cx, h*0.78), ""); size(cap, 30); color(cap, dim); wrap(cap, w*0.84);
+socials(me);
+endcard(me, "title=Try_Manic cta=8gwifi.org/manic");
+untraced(hook); cursor(hook);
+
+// 1 — HOOK
+mark("hook");
+type(hook, 1.2);
+speak("How does a robot find its way through a maze?");
+
+// 2 — BUILD: the maze is the world; the imported vectors are its characters
+show(cap, 0.3); say(cap, "a maze — the robot and pin are imported SVG vectors");
+speak("Drop in a robot and its goal — both imported as crisp SVG vectors.");
+par { show(bot, 0.5); show(dest, 0.5); }
+wait(0.6);
+
+// 3 — PROBLEM: the straight line fails
+fade(hook, 0.4); recolor(cap, red); say(cap, "a straight line? it cuts right through the walls");
+speak("The obvious answer — a straight line — slams right into the walls.");
+show(naive, 0.5); flash(naive, red);
+wait(0.9);
+
+// 4 — SOLVE: A* searches, then traces the real route
+fade(naive, 0.4); recolor(cap, dim); say(cap, "A* searches the space, cell by cell…");
+speak("So Manic runs A-star — searching the grid, cell by cell,");
+gridastar(g, (0,0), (5,7), manhattan);
+recolor(cap, gold); say(cap, "…and traces the true shortest path");
+speak("until it traces the true shortest path around every wall.");
+draw(g.path, 1.6);
+wait(0.6);
+
+// 5 — POINT
+recolor(cap, cyan); say(cap, "vectors imported, path computed — Manic does both");
+speak("Vectors imported, path computed — Manic does both. Turn plain text into animated explainers, free, at eight g wifi dot org slash manic.");
+wait(1.2);
+
+// 6 — END CARD — clear the maze, path, and characters so the CTA stands alone
+mark("endcard");
+par {
+  fade(cap, 0.4); fade(me.footer, 0.4);
+  fade(g.cells, 0.4); fade(g.lines, 0.4); fade(g.path, 0.4);
+  fade(g.frontier, 0.4); fade(g.visited, 0.4);
+  fade(bot, 0.4); fade(dest, 0.4);
+}
+show(me.endcard, 0.6);
+wait(1.6);

package/examples/creator-point-to-plane-distance.manic

@@ -0,0 +1,167 @@
+// A pure-3D textbook problem. Every geometric object stays spatial:
+// a point, a plane, its normal, the perpendicular foot, and the shortest path.
+
+title("Shortest Distance from a Point to a Plane");
+canvas("9:16");
+template("neon");
+
+creator(me,"@anish2good name=Manic_Geometry tagline=3D_math_made_visible yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=cyan secondary=magenta footer=compact safe=clean");
+socials(me);
+watermark(manicMark,(w*0.17,h*0.065),"Made With Manic");
+endcard(me,"title=Make_3D_Math_Move cta=8gwifi.org/manic");
+
+let u = (w+h-abs(w-h))/2160;
+text(kicker,(cx,h*0.075),"MANIC · VECTOR GEOMETRY"); size(kicker,22*u); bold(kicker); color(kicker,cyan); hidden(kicker);
+text(headline,(cx,h*0.125),"How far is a point from a plane?"); size(headline,38*u); bold(headline); wrap(headline,w*0.82); hidden(headline);
+text(chapter,(cx,h*0.185),"THE SHORTEST PATH MUST BE PERPENDICULAR"); size(chapter,22*u); bold(chapter); color(chapter,gold); wrap(chapter,w*0.82); hidden(chapter);
+equation(problem,(cx,h*0.235),`P=(2,2,5),\qquad \Pi:x+y+z=3`,36*u); hidden(problem);
+
+equation(work,(cx,h*0.745),`d(P,\Pi)=?`,43*u); hidden(work);
+text(caption,(cx,h*0.815),"A slanted route is longer. The normal reveals the minimum."); size(caption,24*u); bold(caption); wrap(caption,w*0.80); hidden(caption);
+text(note,(cx,h*0.86),"Find the direction · locate the foot · measure the segment"); size(note,21*u); color(note,dim); wrap(note,w*0.80); hidden(note);
+
+// The frame uses the same physical coordinates as the problem:
+// x,y in [-3,3] and z in [0,6] map one-to-one into a 6-unit display cube.
+// A perspective three-quarter view balances both facts: the plane reads as a
+// full surface, while its perpendicular keeps enough screen length to remain
+// obvious. This story never switches to an orthographic/textbook projection.
+camera3((20,-5,17),(0,0,2.8),42);
+frame3(world,(0,0,3),(6,6,6),"x=-3..3 y=-3..3 z=0..6 xmajor=1 ymajor=1 zmajor=2 planes=xy:min mode=spatial");
+hidden(world);
+
+// Pi: x+y+z=3, rendered as z=3-x-y over a bounded patch.
+surface3(plane,"3-x-y",(-1.5,1.5),(-1.5,1.5),20);
+color(plane,cyan);
+finish3(plane,"material=glass shading=flat mesh=0.38 depth=0.32 shadow=0.12");
+hidden(plane);
+
+// Crisp boundary keeps the translucent plane readable on a phone.
+line3(edge0,(-1.5,-1.5,6),(1.5,-1.5,3)); color(edge0,cyan); thick(edge0,0.045); untraced(edge0); hidden(edge0); tag(edge0,planeEdge);
+line3(edge1,(1.5,-1.5,3),(1.5,1.5,0)); color(edge1,cyan); thick(edge1,0.045); untraced(edge1); hidden(edge1); tag(edge1,planeEdge);
+line3(edge2,(1.5,1.5,0),(-1.5,1.5,3)); color(edge2,cyan); thick(edge2,0.045); untraced(edge2); hidden(edge2); tag(edge2,planeEdge);
+line3(edge3,(-1.5,1.5,3),(-1.5,-1.5,6)); color(edge3,cyan); thick(edge3,0.045); untraced(edge3); hidden(edge3); tag(edge3,planeEdge);
+
+// P is the given point. Q is its perpendicular projection onto Pi.
+point3(P,(2,2,5),0.20); color(P,magenta); hidden(P); tag(P,geometry);
+point3(Q,(0,0,3),0.18); color(Q,gold); hidden(Q); tag(Q,geometry);
+text(pLabel,(0,0),"P (2, 2, 5)"); size(pLabel,22*u); bold(pLabel); color(pLabel,magenta); hidden(pLabel); pin3(pLabel,P,(20,-18)); tag(pLabel,geometry);
+text(qLabel,(0,0),"Q (0, 0, 3)"); size(qLabel,22*u); bold(qLabel); color(qLabel,gold); hidden(qLabel); pin3(qLabel,Q,(-24,20)); tag(qLabel,geometry);
+
+// The gradient of x+y+z-3 is n=(1,1,1).
+arrow3(normal,(0,0,3),(1.15,1.15,4.15)); color(normal,gold); thick(normal,0.075); untraced(normal); hidden(normal);
+point3(nTip,(1.15,1.15,4.15),0.01); hidden(nTip);
+text(nLabel,(0,0),"n = (1, 1, 1)"); size(nLabel,21*u); bold(nLabel); color(nLabel,gold); hidden(nLabel); pin3(nLabel,nTip,(18,-14));
+
+// The minimum-distance segment is parallel to n and ends at Q.
+line3(distanceLine,(0,0,3),(2,2,5)); color(distanceLine,lime); thick(distanceLine,0.105); untraced(distanceLine); hidden(distanceLine); tag(distanceLine,geometry);
+point3(distanceMid,(1,1,4),0.01); hidden(distanceMid);
+text(distanceLabel,(0,0),"d = 2√3"); size(distanceLabel,23*u); bold(distanceLabel); color(distanceLabel,lime); hidden(distanceLabel); pin3(distanceLabel,distanceMid,(-22,-20)); tag(distanceLabel,geometry);
+
+// A small spatial right-angle mark: one side lies in Pi, one follows n.
+line3(right0,(0,0,3),(0.45,-0.45,3)); color(right0,fg); thick(right0,0.045); untraced(right0); hidden(right0); tag(right0,rightMark);
+line3(right1,(0.45,-0.45,3),(0.70,-0.20,3.25)); color(right1,fg); thick(right1,0.045); untraced(right1); hidden(right1); tag(right1,rightMark);
+line3(right2,(0.70,-0.20,3.25),(0.25,0.25,3.25)); color(right2,fg); thick(right2,0.045); untraced(right2); hidden(right2); tag(right2,rightMark);
+
+step("pose the spatial problem") {
+  seq {
+    par {
+      show(kicker,0.35); show(headline,0.50); show(chapter,0.45);
+      show(problem,0.55); show(work,0.40); show(caption,0.45); show(note,0.40);
+    }
+    show(world,0.70);
+    par {
+      show(plane,0.75);
+      show(edge0,0.10); draw(edge0,0.70,smooth);
+      show(edge1,0.10); draw(edge1,0.70,smooth);
+      show(edge2,0.10); draw(edge2,0.70,smooth);
+      show(edge3,0.10); draw(edge3,0.70,smooth);
+    }
+    stagger(0.12) { show(P,0.25); show(pLabel,0.30); pulse(P,0.60); }
+    wait(0.65);
+  }
+}
+
+step("read the plane normal") {
+  seq {
+    par {
+      say(chapter,"1 · READ THE NORMAL FROM THE PLANE",0.40,smooth);
+      say(caption,"The coefficients of x, y, and z point perpendicular to Π.",0.50,smooth);
+      say(note,"For ax + by + cz + d = 0, the normal is (a,b,c).",0.45,smooth);
+      rewrite(work,`\Pi:x+y+z-3=0`,0.65,smooth);
+      fade(pLabel,0.30);
+    }
+    par {
+      show(Q,0.25);
+      show(normal,0.10); draw(normal,1.10,smooth);
+      show(nLabel,0.35);
+      rewrite(work,`\mathbf n=(1,1,1)`,0.80,smooth);
+    }
+    pulse(normal,0.65);
+    wait(0.60);
+  }
+}
+
+step("locate the perpendicular foot") {
+  seq {
+    par {
+      fade(normal,0.35); fade(nLabel,0.35);
+      say(chapter,"2 · DROP THE PERPENDICULAR",0.40,smooth);
+      say(caption,"Move from P opposite the normal until the plane equation becomes true.",0.50,smooth);
+      say(note,"Q = P − t n must lie on Π.",0.40,smooth);
+      rewrite(work,`Q=(2,2,5)-t(1,1,1)`,0.80,smooth);
+    }
+    rewrite(work,`(2-t)+(2-t)+(5-t)=3\Rightarrow t=2`,1.00,smooth);
+    par {
+      show(distanceLine,0.10); draw(distanceLine,1.20,smooth);
+      show(right0,0.10); draw(right0,0.55,smooth);
+      show(right1,0.10); draw(right1,0.45,smooth);
+      show(right2,0.10); draw(right2,0.55,smooth);
+      rewrite(work,`Q=(0,0,3)`,0.75,smooth);
+    }
+    pulse(Q,0.65);
+    wait(0.65);
+  }
+}
+
+step("measure the shortest segment") {
+  seq {
+    par {
+      say(chapter,"3 · MEASURE THE NORMAL SEGMENT",0.40,smooth);
+      say(caption,"The point-to-plane formula measures exactly the green segment PQ.",0.50,smooth);
+      say(note,"Absolute value gives distance; the denominator normalizes n.",0.45,smooth);
+      rewrite(work,`d=\frac{|2+2+5-3|}{\sqrt{1^2+1^2+1^2}}`,1.05,smooth);
+    }
+    rewrite(work,`d=\frac{6}{\sqrt3}=\textcolor{lime}{2\sqrt3}`,0.90,smooth);
+    par {
+      rewrite(work,`\boxed{d(P,\Pi)=\textcolor{lime}{2\sqrt3}}`,0.75,smooth);
+      show(distanceLabel,0.30);
+      pulse(distanceLine,0.80);
+    }
+    wait(0.75);
+  }
+}
+
+step("orbit the proof") {
+  seq {
+    par {
+      say(chapter,"THE ANSWER IS A SPATIAL RELATIONSHIP",0.45,smooth);
+      say(caption,"Orbit the proof: PQ stays normal to Π from every viewpoint.",0.50,smooth);
+      say(note,"One plane · one projection · one shortest path",0.45,smooth);
+      fade(pLabel,0.35); fade(qLabel,0.35);
+    }
+    par { orbit3(38,28,24,1.80,smooth); pulse(distanceLine,0.70); }
+    par { orbit3(68,30,24,1.80,smooth); pulse(plane,0.70); }
+    wait(0.80);
+  }
+}
+
+step("creator call to action") {
+  par {
+    fade(world,0.45); fade(plane,0.45); fade(planeEdge,0.45);
+    fade(geometry,0.45); fade(rightMark,0.45);
+    fade(problem,0.35); fade(work,0.35); fade(chapter,0.35);
+    fade(caption,0.35); fade(note,0.35);
+    show(me.endcard,0.60);
+  }
+  wait(1.80);
+}

package/examples/creator-race-quiz.manic

@@ -0,0 +1,76 @@
+// creator-race-quiz.manic — a Creator Short that PROVES a claim with a race chart.
+// Poses a quiz (which economy grew fastest since 1990?), lets you guess, reveals
+// the answer, then plays a bar-chart RACE that settles it — the data as the payoff.
+// Shows the charts kit composing with quiz cards, voice, and creator chrome.
+//
+//   ELEVENLABS_API_KEY=... manic examples/creator-race-quiz.manic --record out.mp4
+title("The Race-Chart Quiz");
+canvas("9:16");
+template("shorts");
+voice("elevenlabs");
+
+creator(me, "@anish2good name=Manic tagline=Turn_plain_text_into_amazing_data_videos yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=cyan secondary=magenta footer=signature cta=Try_it_free safe=reels");
+watermark(mark, (w*0.955-100, h*0.045+24), "Made With Manic");
+
+// --- the question ---
+text(kick, (cx, h*0.13), "Since 1990, which economy grew the FASTEST?");
+size(kick, 46); color(kick, fg); bold(kick); wrap(kick, w*0.86); hidden(kick);
+
+// --- four option cards (India · China · S. Korea · Brazil) ---
+let cy0 = h*0.30; let ch = h*0.09; let gap = h*0.115;
+rect(card1, (cx, cy0),        w*0.74, ch); outlined(card1); outline(card1, dim); stroke(card1, 3); hidden(card1);
+rect(card2, (cx, cy0+gap),    w*0.74, ch); outlined(card2); outline(card2, dim); stroke(card2, 3); hidden(card2);
+rect(card3, (cx, cy0+gap*2),  w*0.74, ch); outlined(card3); outline(card3, dim); stroke(card3, 3); hidden(card3);
+rect(card4, (cx, cy0+gap*3),  w*0.74, ch); outlined(card4); outline(card4, dim); stroke(card4, 3); hidden(card4);
+text(lbl1, (cx, cy0),       "India");        size(lbl1, 40); color(lbl1, fg); bold(lbl1); hidden(lbl1);
+text(lbl2, (cx, cy0+gap),   "China");        size(lbl2, 40); color(lbl2, fg); bold(lbl2); hidden(lbl2);
+text(lbl3, (cx, cy0+gap*2), "South Korea");  size(lbl3, 40); color(lbl3, fg); bold(lbl3); hidden(lbl3);
+text(lbl4, (cx, cy0+gap*3), "Brazil");       size(lbl4, 40); color(lbl4, fg); bold(lbl4); hidden(lbl4);
+
+// --- the proof: a GDP bar-chart race (labels only), hidden until the reveal ---
+racechart(gdp, "bar", "1990 1998 2006 2014 2020 2026");
+racedata(gdp, "
+  USA,          5.96,  8.6, 13.8, 17.5, 21.1, 30.3
+  China,        0.36,  1.1,  2.8,  10.5, 14.7, 20.5
+  Japan,        3.13,  4.1,  4.6,   4.9,  5.1,  4.4
+  India,        0.32,  0.4,  0.9,   2.0,  2.7,  4.6
+  Brazil,       0.46,  0.9,  1.1,   2.5,  1.5,  2.4
+  South Korea,  0.28,  0.6,  1.0,   1.5,  1.6,  1.9
+");
+
+text(cap, (cx, h*0.70), ""); size(cap, 34); color(cap, dim); bold(cap); wrap(cap, w*0.86); hidden(cap);
+
+socials(me);
+endcard(me, "title=Race_ANY_Dataset cta=8gwifi.org/manic");
+
+// ---------------- the story ----------------
+fade(gdp, 0.01); // keep the race hidden during the quiz
+show(kick);
+speak("Since nineteen-ninety, one economy grew faster than every other major country. Which one?");
+stagger(0.16) { show(card1); show(card2); show(card3); show(card4); }
+par { show(lbl1); show(lbl2); show(lbl3); show(lbl4); }
+show(cap, 0.3); say(cap, "Lock in your guess…");
+wait(1.0);
+
+speak("The answer? China.");
+par { recolor(card2, gold); pulse(card2); recolor(lbl2, gold); }
+par { fade(card1); fade(card3); fade(card4); fade(lbl1); fade(lbl3); fade(lbl4); }
+wait(0.6);
+
+speak("But don't take my word for it — let the data settle it.");
+par { fade(card2); fade(lbl2); fade(kick); fade(cap); }
+show(gdp);
+par {
+  race(gdp, 8.0);
+  seq {
+    speak("Watch China — from the bottom of the pack,");
+    speak("climbing past Brazil, Korea, India, even Japan,");
+    speak("all the way to number two.");
+  }
+}
+wait(0.6);
+
+speak("The data doesn't argue. And this whole video is one Manic script — drop in any dataset, get a race. Free, at eight g wifi dot org slash manic.");
+par { fade(gdp); }
+show(me.endcard);
+wait(2.6);

package/examples/creator-randomwalk3-diffusion.manic

@@ -0,0 +1,72 @@
+// Creator short: many random decisions do not create visual noise only—the
+// choice model leaves a characteristic 3D signature.
+
+title("Can Randomness Have a Shape?");
+canvas("9:16");
+template("paper");
+
+creator(me, "@anish2good name=Manic_Generative tagline=Randomness_made_visible yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=cyan secondary=magenta footer=compact cta=Animate_the_invisible safe=clean");
+socials(me);
+watermark(mark, (w*0.16,h*0.055), "Made With Manic");
+endcard(me, "title=Make_Invisible_Systems_Visible cta=8gwifi.org/manic");
+
+let u = (w+h-abs(w-h))/1080;
+text(kicker, (cx,h*0.11), "MANIC · RANDOM SYSTEMS");
+text(headline, (cx,h*0.18), "Can randomness have a shape?");
+text(caption, (cx,h*0.77), "Start at one point. Choose one of six directions.");
+text(count, (cx,h*0.70), "100 STEPS");
+size(kicker,20*u); bold(kicker); color(kicker,cyan);
+size(headline,31*u); bold(headline); wrap(headline,w*0.78);
+size(caption,23*u); bold(caption); wrap(caption,w*0.75);
+size(count,20*u); bold(count); color(count,gold);
+
+camera3((9,-12,8),(0,0,0),38,orthographic);
+randomwalk3(w100,(0,0,0),100,42,"mode=axis color=direction scale=0.25");
+randomwalk3(w1000,(0,0,0),1000,42,"mode=axis color=direction shade=depth scale=0.16");
+randomwalk3(w10000,(0,0,0),10000,42,"mode=axis color=direction shade=depth scale=0.09");
+untraced(w100); untraced(w1000); untraced(w10000);
+hidden(w1000); hidden(w10000);
+hidden(kicker); hidden(headline); hidden(caption); hidden(count);
+
+step("one random journey") {
+  par {
+    show(kicker,0.35); show(headline,0.45); show(caption,0.40); show(count,0.35);
+    draw(w100,1.25,smooth); view3(w100,"fit",0.55,smooth,1.35);
+  }
+}
+wait(0.55);
+
+step("the cloud begins to emerge") {
+  par {
+    fade(w100,0.35); show(w1000,0.05);
+    say(count,"1,000 STEPS",0.30);
+    say(caption,"More choices reveal a spreading 3D cloud.",0.40);
+  }
+  par { draw(w1000,1.75,smooth); view3(w1000,"fit",0.55,smooth,1.35); }
+}
+wait(0.60);
+
+step("scale exposes the law") {
+  par {
+    fade(w1000,0.35); show(w10000,0.05);
+    say(count,"10,000 STEPS · SAME SEED",0.30);
+    say(caption,"The individual turns are random. The large-scale diffusion is not.",0.45);
+  }
+  par { draw(w10000,2.30,smooth); view3(w10000,"fit",0.60,smooth,1.35); }
+  orbit3(112,30,11,1.70,smooth);
+}
+wait(0.85);
+
+step("creator takeaway") {
+  say(caption,"Manic turns a model and a seed into a camera-ready explanation.",0.45);
+  recolor(headline,gold,0.45);
+}
+wait(1.00);
+
+step("call to action") {
+  par {
+    fade(kicker,0.30); fade(headline,0.30); fade(caption,0.30); fade(count,0.30);
+    fade(w10000,0.40); fade(me.footer,0.30); show(me.endcard,0.60);
+  }
+}
+wait(1.80);

package/examples/creator-reflected-ellipse.manic

@@ -0,0 +1,48 @@
+// Existing-Manic treatment of animations/fig0110.asy.
+// Solve a concrete reflection across x=c with two ordinary ellipses.
+
+title("Reflecting an Ellipse");
+canvas("9:16");
+template("black");
+creator(me,"@anish2good name=Manic_Geometry tagline=Conics_made_visible yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=magenta secondary=cyan footer=compact cta=Reflect_the_conic safe=clean");
+socials(me);
+watermark(mark,(w*0.16,h*0.055),"Made With Manic");
+endcard(me,"title=Build_Visual_Proofs cta=8gwifi.org/manic");
+
+let u=(w+h-abs(w-h))/1080; let yy=h*0.48; let mirrorX=cx;
+text(kicker,(cx,h*0.10),"REFLECTION · CONIC SECTIONS");
+text(head,(cx,h*0.17),"Reflect an ellipse across x = 0.");
+text(caption,(cx,h*0.79),"Reflection negates every x-coordinate and preserves every distance to the mirror.");
+equation(eq,(cx,h*0.72),`(x,y)\mapsto(-x,y)`,34*u);
+size(kicker,20*u); bold(kicker); color(kicker,magenta);
+size(head,27*u); bold(head); wrap(head,w*0.76);
+size(caption,19*u); bold(caption); wrap(caption,w*0.74); color(caption,dim);
+
+line(mirror,(mirrorX,h*0.31),(mirrorX,h*0.65)); color(mirror,dim); dashed(mirror,12); stroke(mirror,3);
+ellipse(left,(cx-130*u,yy),105*u,62*u,-18); color(left,cyan); stroke(left,4); untraced(left);
+reflectpath(right,left,mirror,320); color(right,magenta); stroke(right,4); untraced(right);
+dot(C,(cx-130*u,yy),8*u); dot(Cp,(cx+130*u,yy),8*u); color(C,gold); color(Cp,gold);
+line(distance,(cx-130*u,yy),(cx+130*u,yy)); color(distance,gold); dashed(distance,10); untraced(distance);
+untraced(mirror); hidden(C); hidden(Cp); hidden(distance);
+hidden(kicker); hidden(head); hidden(caption); hidden(eq);
+
+step("pose") {
+  par { show(kicker,0.3); show(head,0.4); show(caption,0.35); }
+  seq { draw(mirror,0.55,smooth); draw(left,0.75,smooth); show(C,0.2); }
+}
+wait(0.85);
+step("reflect the center") { par { show(distance,0.45); show(Cp,0.25); show(eq,0.4); say(caption,"The center moves to the opposite side by the same perpendicular distance.",0.4); } }
+wait(0.85);
+step("reflect every boundary point") { par { draw(right,0.85,smooth); say(caption,"Applying the same map to the whole boundary produces the reflected ellipse.",0.45); } }
+wait(0.95);
+step("check what reflection preserves") {
+  par {
+    pulse(distance,0.80);
+    say(caption,"Every point keeps the same perpendicular distance from the mirror, so lengths and angles are unchanged.",0.60,smooth);
+  }
+}
+wait(1.0);
+step("solve") { par { pulse(right,0.75); say(head,"Same shape. Opposite orientation.",0.4,smooth); } }
+wait(1.25);
+step("cta") { par { fade(kicker,0.3); fade(head,0.3); fade(caption,0.3); fade(eq,0.3); fade(mirror,0.3); fade(left,0.3); fade(right,0.3); fade(C,0.3); fade(Cp,0.3); fade(distance,0.3); fade(me.footer,0.3); show(me.endcard,0.6); } }
+wait(2.2);

package/examples/creator-rule90-sierpinski.manic

@@ -0,0 +1,64 @@
+// Rule 90 → Sierpinski — a QUIZ-style Creator v2 Short. Rule 90 is the elementary
+// cellular automaton where each new cell = its two upper neighbours, XOR'd. From a
+// single seed it draws Sierpinski's triangle — because XOR of two parents is exactly
+// Pascal's triangle mod 2 (a cell is lit iff C(n,k) is ODD). Two birds, one stone:
+// the CA, the binomial parity, and the fractal are the same picture. The gasket is
+// the quiz's media (fit with `figure`), building as you're asked to predict it.
+title("Rule 90 → Sierpinski");
+canvas("9:16");
+template("shorts");
+
+creator(me, "@anish2good name=Manic tagline=Turn_plain_text_into_amazing_math_videos yt=zarigatongy x=@anish2good web=8gwifi.org/manic accent=cyan secondary=magenta footer=signature cta=Try_it_free safe=reels");
+watermark(manicMark, (w*0.955-100, h*0.045+24), "Made With Manic");
+
+// The gasket: only the LIT cells (odd binomials) are drawn, so it reads as the
+// clean Sierpinski triangle. `figure` fits the whole group into the media region.
+let N = 16;
+let cw = 30;
+let rh = 30;
+for n in 0..N {
+  for k in 0..n+1 {
+    let val = prod(i in 1..k+1 : (n-k+i)/i);
+    let odd = round(val - 2*floor(val/2));
+    if odd > 0.5 {
+      dot(sc{n}_{k}, (cx + (k - n*0.5)*cw, cy - N*rh*0.5 + n*rh), 11);
+      color(sc{n}_{k}, magenta); tag(sc{n}_{k}, sier); tag(sc{n}_{k}, srow{n});
+    }
+  }
+}
+figure(sier);
+hidden(sier);   // hidden at first, then builds row by row while you predict
+
+quiz(q, "Rule 90: start with one dot. Each new cell = its two upper neighbours, XOR'd. What shape appears?",
+     "studio layout=media-first reveal=fade density=comfortable motion=calm safe=reels accent=cyan");
+option(q, "A checkerboard");
+option(q, "Sierpinski's triangle", correct);
+option(q, "Random static");
+option(q, "A solid pyramid");
+explain(q, "XOR of two parents = Pascal's triangle mod 2 — the ODD cells are Sierpinski.", "Why");
+
+timing(q, "calm ask=1.2 options=1.1 think=5.2 reveal=0.8 hold=2.4 stagger=0.06");
+timerstyle(q, "look=ring position=below number=inside direction=drain size=medium thickness=1.1 color=cyan track=dim label=PREDICT font=mono finish=pulse");
+
+socials(me);
+endcard(me, "title=Try_Manic cta=8gwifi.org/manic");
+
+// Play the quiz; in parallel, Rule 90 builds the gasket row by row so it finishes
+// right as the answer is revealed.
+mark("hook");
+par {
+  run(q);
+  seq {
+    wait(1.1);
+    for n in 0..N { show(srow{n}, 0.16); wait(0.26); }
+  }
+}
+
+mark("endcard");
+par {
+  fade(q.parts, 0.45);
+  fade(sier, 0.45);
+  fade(me.footer, 0.45);
+}
+show(me.endcard, 0.6);
+wait(1.6);