Twelve things a graph can do for the first time. Each one carries a bounty, a share of the vault owed to the wallets inside the structure at the moment a trade completes it. A problem is solved once and stays solved.
Nothing here is judged by anyone. The trade that closes a triangle closes it, and the signature of that trade is the proof. Until a problem is solved its row shows only what it asks for.
Three wallets, each joined to the other two.
An edge lands between two wallets that a chain of edges already connected, so the chain closes on itself.
Four wallets with all six edges among them present.
Five wallets with all ten edges among them present.
One wallet joined to ten others.
One wallet joined to twenty five others.
One wallet joined to fifty others.
Twenty five wallets that edges tie into one piece.
One hundred wallets in one piece.
Five hundred wallets in one piece.
A wallet three edges away from the vault: joined to a wallet that is joined to a wallet that is joined to the vault.
With at least fifty wallets in the graph, the edge count reaches half the wallet count. Past this point a random graph stops being scattered pieces and grows one giant piece.