Feeling Emotional About The Delightfuls

(inspired by this post) in the script reading Nigel mentions that Father was captured by the GKND did the GKND take the DCFDTL too or are they left alone in their mansion waiting for Father to come back?

after being undelightfulized i think Sector Z would hate being compared to the Delightfuls the fact that Bruce still has blues eyes gives this idea more angst potential. Although its not delightful blue i still think, under certain lighting, they could look very similar

Some very delightful children

You try to pull the blanket off of yourself, and you realize that, it too, is made of chocolate. You try to shake it off, and step out of bed. Your carpet feels strangely spongy. You look down, only to realize it’s actually cake. Lovingly baked, and smelling of sweet fruit. You grab a piece, and cautiously take a bite. It is one of the most delicious cakes you have ever eaten.

You get up, confused, and exit your room to see if the rest of your house is like this. The door handle melts in your hand as you hold onto it, and covers it with dark chocolate carefully painted gold. The rest of the carpet on the floor is still cake, the guardrails on the stairs leading down are tempered chocolate, the tiles on the floor are the same, the windows are sugar glass, everything is edible.

You run outside, knocking over the lovingly crafted chocolate front door in a panic.

You realize, in horror, that your house was not an exception. The bushes, the grass, the asphalt on the road, the trees, birds, the world itself, is chocolate.

If you want, could you maybe just draw them enjoying sweets in secret cause I think they deserve to be happy and indulge themselves

thank you so much 💛!! I think they should be enjoying a sweet treat

(i am very brave for drawing the Delightfuls anywhere near a jar)

this took me three attempts to get right

Field: Combinatorial Number Theory

Journal: Communications in Addition and Subtraction

Title: A Lower Bound on the Largest Natural number

Abbreviated Abstract: We prove a lower bound on the largest number. The proof proceeds in two steps: we begin with 1, and proceed by induction as until we lose count. We then add that number to itself. The main advance in the first step is to get a big number, and the second step notably avoids using multiplication (they don't teach that until 3rd grade).

Field: Topological Geometry

Journal: Advances in Nonlines

Title: The Four-Color Scribbles

Abbreviated Abstract: In this work we show a zoo of examples of nonlines (curves) with the unique property that they are either red, blue, orange, or purple, or some combination therein. The key idea is to use less colors rather than more, creating a clear and easy to follow proof. This provides a clear basis for simplifications to further work, such as scribbling with 5 colors.

Field: Playground Analysis

Journal: Slide Dynamics

Title: Sufficient Conditions to Yell Weeeeeee on Spiral Slides