OBSERVATION 020
雷
Ikazuchi — Lightning
Press the picture or the button to reduce the points.40,000 → 625 → 40 → 1, then back to 40,000.
At fewer points, dots grow and trails linger to help you follow their paths.
“Listen” maps the displayed points to sound.Changing the count rebuilds the sound.
From top to bottom, it crosses in one go.
The first two generations barely bend.
The lower two split wide.
The more a road bends, the sooner it ends.
Only what goes straight reaches far.
The brightest place is the root.
Not because it is thick there.
Because all eighty-one roads pass through it.
It finishes growing, disappears, and falls again.
The same shape comes twice
because on that side there is no chance.
Read and verify the equation
(i, t,
j = i % 81, u = (i / 81 | 0) / 494,
g = (t / (TAU * 2)) % 1,
d0 = j % 3 - 1, d1 = (j / 3 | 0) % 3 - 1,
d2 = (j / 9 | 0) % 3 - 1, d3 = (j / 27 | 0) % 3 - 1,
a0 = 1.5708 + .07 * d0 + .19 * sin(j * 2.4),
a1 = a0 + .14 * d1 + .21 * sin(j * 1.7),
a2 = a1 + .62 * d2 + .23 * sin(j * 3.1),
a3 = a2 + .92 * d3 + .25 * sin(j * 5.3),
L0 = 118, L1 = 96,
L2 = 74 * (1 - .54 * abs(d2)),
L3 = 58 * (1 - .58 * abs(d3)) * (1 - .34 * abs(d2)),
s0 = min(1, max(0, u * 4)), s1 = min(1, max(0, u * 4 - 1)),
s2 = min(1, max(0, u * 4 - 2)), s3 = min(1, max(0, u * 4 - 3)),
X = 200 + L0 * cos(a0) * s0 + L1 * cos(a1) * s1 + L2 * cos(a2) * s2 + L3 * cos(a3) * s3,
Y = 24 + L0 * sin(a0) * s0 + L1 * sin(a1) * s1 + L2 * sin(a2) * s2 + L3 * sin(a3) * s3
) => u > g ? [-9, -9] : [X, Y]
Fingerprint of this equation
sha256:e37035ee865645928ea912be66e04db62c6d1ca45ca42dc759cafd866eb85667
The same point number and time give the same coordinates.
Trails and the appearance of points depend on rendering settings and the device.
The button above takes the equation out as it is. To count it again yourself:
pbpaste > f.txt && printf %s "$(cat f.txt)" | shasum -a 256
Take it and run it.What appears when you change the equation? Run and rewrite this equation →