Combined Client Samples

Pathfinder · every client's sample files, merged into one population atlas
merged 2026-08-01 09:42
33m ago snapshot · 5 clients

Each machine in the fleet writes its own small pile of sample files — where it stepped, where it died, which way it moved, and how its walks were distributed in length and reach. The combine toolset sums those piles across every client into one set of combined_*.csv files: the uncensored truth over every walk ever run, not just the interesting tail the library keeps. This board is the reading room for that merged set — rendered as charts, graphs and tables from a single pre-computed snapshot.

walks run
251.28B
every path, all clients
average life
209.7
median 170 · mode 90
longest walk
3.6K
steps, single path
total visits
52.73T
cells visited, with repeats
cells touched
382.5K
distinct world cells
deaths mapped
251.48B
one per trapped walk
I

How long the walks live

combined_pathlengthdistro.csv

Every walk steps to a random unvisited neighbour until it seals itself in and can go no further. The number of steps it managed is its length. Summed over the whole fleet, that distribution is steeply skewed: most walks suffocate early, a thin tail runs for thousands of steps. The chart below plots the count of walks at each length across the full range (log count-axis so the tail stays visible); the mean is the fleet's trapping length.

median 170mean 2105001K1.5K2K2.5K3K3.5Kcount (log)
Figure 1. Walks per length, min 8 → max 3,644 steps. Dashed rule: median (170); fainter rule: mean (209.7). Count axis is logarithmic.
Table 1. Length percentiles over the whole population.
StatisticSteps
Mean (trapping length)209.71
Median (p50)170
Mode (most common)90
p90415
p99735
p99.91,046
Maximum3,644
II

How far they get

distance · reach · Manhattan

Length counts steps; these three measure ground covered. End-to-end distance is the straight line from where a walk began to where it died; farthest reach is the largest radius it ever touched (always ≥ the end distance, since walks often loop back before trapping); Manhattan distance is the grid-blocks-home figure. Each is a full-population histogram with its median marked.

1409 cells
End-to-end distance
median 19 · mean 23.4 · max 409
straight-line radius from origin to the death point
2419 cells
Farthest reach
median 27 · mean 31.3 · max 419
the largest radius the walk ever attained
1569 cells
Manhattan distance
median 24 · mean 29.9 · max 569
|dx|+|dy| at death — steps-on-a-grid distance home
III

Which way they step

combined_pathdirections.csv

The walk chooses uniformly among its free neighbours, so nothing in the process prefers a heading. Fairness therefore demands the pattern be invariant under a 90° turn — the four orthogonal counts equal each other, and the four diagonal counts equal each other. That four-fold symmetry is the real audit of the random stream; a dent in one direction is a bug caught in the act. It does not demand that straight and diagonal steps match: which of those a walk can take depends on the trail it has already laid, and here diagonals come out about 6.3% more often — geometry, not a biased generator.

ESWN
isotropic · χ²=9.75
orthogonal 48.5% · diagonal 51.5%
Table 2. Step-direction counts. Δ within group is each direction's departure from its own group mean (orthogonal or diagonal) — the four-fold-symmetry test. χ²(6) = 9.75, critical 12.592 at α=0.05.
DirectionΔx,ΔyGroupCountShareΔ within group
E 1,0 orthogonal 6.4T 12.116% 0.0000%
SE 1,1 diagonal 6.81T 12.884% 0.0000%
S 0,1 orthogonal 6.4T 12.116% 0.0000%
SW -1,1 diagonal 6.81T 12.884% 0.0000%
W -1,0 orthogonal 6.4T 12.116% +0.0001%
NW -1,-1 diagonal 6.81T 12.884% +0.0001%
N 0,-1 orthogonal 6.4T 12.116% 0.0000%
NE 1,-1 diagonal 6.81T 12.884% 0.0000%
IV

Where they wander, where they die

90×90 heat over a 4K² world

Every cell any walk stepped on (left) and every cell a walk finally trapped itself on (right), summed over the fleet and binned into a coarse grid. The dashed crosshair is the world centre, where all walks begin. Colour is on a log scale — a single bright core fanning out into an ever-sparser frontier. The two fields share a shape because walks mostly die where they mostly wander.

sparse dense
Visits. 52.73T steps over 382.5K distinct cells; busiest cell (2000,2000) hit 135.66B×.
sparse dense
Deaths. 251.48B trapped walks over 234.1K distinct death cells.
V

The burst

382.5K cells · 11 spectrums

The wander field from Section IV at full resolution — every one of the 382.5K cells any walk stepped on, over the 4K² world, painted by visit frequency on a log-of-max scale. This is the image that brands the project; the ladder at left recolours the identical data through each spectrum. Transparent means never visited — the checker shows through.

Fleet visit-density burst
Exponential spectrum · view full-resolution original
VI

The longest walks

combined_top_20_path_lengths.csv

Each client keeps its own top-20 lengths; the combine step merges them into a fleet-wide leaderboard, scoring by rank position across all clients so a length that lands high on many machines outranks a one-off outlier. These are the marathon walks — the far tail of Figure 1 made concrete.

Table 3. The 20 longest path lengths across the fleet, by combined rank score.
RankPath lengthScore
#1 3,644 20
#2 3,632 20
#3 3,618 19
#4 3,561 20
#5 3,537 20
#6 3,519 20
#7 3,465 20
#8 3,310 20
#9 3,307 20
#10 3,293 19
#11 3,290 19
#12 3,286 20
#13 3,269 20
#14 3,268 20
#15 3,244 18
#16 3,230 18
#17 3,228 40
#18 3,224 20
#19 3,203 19
#20 3,201 20
VII

The merged files

telemetry clients _files

Everything above derives from these eight files — the output of the combine step, one row per distinct value or cell. The builder reads them once (streaming the two X,Y heat files in a single binning pass) and bakes this board's snapshot; the page itself never touches the CSVs.

Table 4. Source files, their columns, and the rows found in each.
FileColumnsWhat it isRows
combined_pathlengthdistro.csv PathLength, Frequency How many walks lived exactly N steps. 3K
combined_path_distan_distribution.csv PathLength, Frequency End-to-end (Euclidean) distance from home. 383
combined_path_maximu_distribution.csv PathLength, Frequency Farthest radius each walk reached. 393
combined_path_metros_distribution.csv PathLength, Frequency Manhattan distance at death. 512
combined_pathdirections.csv DX, DY, Count How often each of the 8 step directions was taken. 8
combined_node_visits.csv X, Y, Number of Visits Every cell the fleet ever stepped on, and how often. 382.5K
combined_node_deaths.csv X, Y, Number of Deaths Every cell a walk trapped itself on. 234.1K
combined_top_20_path_lengths.csv Rank, Path Length, Score The longest walks, merged from every reporting client. 20

⭳ Download the snapshot (JSON) everything this board renders, in one small file

Reading room for the combined sample set — summed across every client and baked into combined_samples_summary.json. All measurement, no decoration; the numbers are the uncensored [POP] population, cross-checked against the per-path [LIB] library on the Path Statistics board.