What fascinates me is that if you had enough cotton candy, it would be a black hole. I don't mean it would collapse into a black hole, I mean even at a uniform density of 0.05 grams per cubic centimeter, it would already be a black hole.

We're so used to surface area scaling at r^2 and volume scaling at r^3 and the weird effects that can have (never scale up an exothermic reaction), but the maximum amount of matter that can exist in a volume without creating a black hole scales by r^1. Even with cotton candy, that r^3 is going to out-scale r^1 at some point.

It's an interesting thought experiment for algorithm complexity as well. Can you actually retrieve an element from an array in constant time regardless of the size of the array? In the extreme case, the drive containing the array must have r proportional to the size of the array to avoid becoming a black hole. Assuming the query and element travel along the drive at the speed of light, retrieving the element still takes time proportional to the size of the array.