"""Stones the fence never counted eske has a fence (fail2ban) that locks an address out for ten minutes after a few tries at a username that doesn't exist. It never counts a try at a name that does exist, so an address that only ever knocks as `root` can knock forever and the fence never notices. By 2026-10-19 there were 124 such addresses, and here each is a stone, sized by how many times it knocked (square-rooted): 9,243 knocks in all, 73 of them a single knock, and one address 3,354 times in twenty hours before it stopped. The stones were dropped onto the pile one at a time, biggest first, and lie where they came to rest. Only the counts are here, no addresses. The sixth weekly watch found this; an attended session planted it, 2026-10-19. """ import math import random KNOCKS = [ # SSH connections per root-only, never-banned address, 2026-09-23 .. 2026-10-19 3354, 652, 642, 627, 608, 606, 603, 486, 437, 264, 245, 69, 61, 59, 57, 54, 52, 40, 32, 29, 26, 20, 18, 14, 13, 10, 9, 8, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, ] + [2] * 13 + [1] * 73 W, H = 480, 480 GROUND = 432 rng = random.Random(len(KNOCKS)) top = max(KNOCKS) def mix(c1, c2, t): return "#%02x%02x%02x" % tuple(round(a + (b - a) * t) for a, b in zip(c1, c2)) def radius(k): return 3.6 + 34 * math.sqrt(k / top) placed = [] # (x, y, r) def drop(x, r): """Let a stone fall straight down at x until it rests on the ground or on an earlier stone.""" y = GROUND - r for px, py, pr in placed: dx = x - px reach = r + pr if abs(dx) < reach: y = min(y, py - math.sqrt(reach * reach - dx * dx)) return y out = [f'', '' '', f''] # the fence, behind: it stands, and the stones are on its near side regardless posts = [] for i in range(11): x = 30 + i * 42 + rng.uniform(-3, 3) lean = rng.uniform(-3, 3) posts.append(f'') rail_y = GROUND - 40 out.append(f'') out += posts out.append(f'') pale, dark = (168, 164, 158), (96, 102, 112) stones = [] for i, k in enumerate(sorted(KNOCKS, reverse=True)): r = radius(k) # big stones land near the middle; the rubble scatters wider, and some rolls off to the sides spread = 40 + 150 * (i / len(KNOCKS)) x = W / 2 + rng.gauss(0, spread / 2) x = min(max(x, 24 + r), W - 24 - r) y = drop(x, r) # A stone resting on just one other stone rolls down that side until it meets # the ground, a second stone, or the edge of the bed. for _ in range(600): touching = [(px, py, pr) for px, py, pr in placed if abs(math.hypot(x - px, y - py) - (r + pr)) < 0.6] if not touching or (any(px < x for px, _, _ in touching) and any(px > x for px, _, _ in touching)): break px = touching[0][0] side = 1 if x > px else -1 if x < px else rng.choice((-1, 1)) nx = min(max(x + side * 1.2, 24 + r), W - 24 - r) if nx == x: break x, y = nx, drop(nx, r) placed.append((x, y, r)) t = rng.random() col = mix(pale, dark, 0.25 + 0.6 * t) rx, ry = r * rng.uniform(0.92, 1.12), r * rng.uniform(0.82, 1.0) rot = rng.uniform(-25, 25) stones.append(f'') if r > 8: # a little light on the big ones stones.append(f'') out += stones out.append("") print("\n".join(out))