Six Degrees of Bluesky
Find the shortest chain of follows from one Bluesky account to another, and measure any one account’s network: who follows back, when it followed whom, which follows have gone quiet, which lists include it, how tightly its follows follow each other. Everything runs in this tab against Bluesky’s public servers, and the page never sends more than 300 requests in any minute. Before sending anything it says how many requests the work needs; a run that would pass its budget waits for you to continue.
Shortest follow path
A path reads: From follows x, who follows y, …, who follows To. The search grows rings from both ends (a ring is every account the same number of follows from one end) and finishes each ring it starts. Accounts with more than page cap pages of 100 follows (followers on To’s side, where the search walks backward through followers) are not read, though a path can still pass through them. The result says whether the path is proven shortest.
One account’s network
Loading lists seven measurements of the account, each with the number of requests it needs; run any of them.
Making lists
Bluesky lists are public. Sign in before running anything: sign-in leaves this page and reloads it, which clears the results on screen; everything read is cached for 24 hours, so running the same search or measurement again costs no requests.