simple and undesigned onion routing system made of nodes that together form a large network thought: how to find other nodes? eh we can put it behind a library stub ok hmm
class sillyonionnode method: route(destination) -> returns a circuit or a handle that can be used to send data to destination method: [let’s form connections to peers, or listen, and make a list of peers] ooh maybe something for ranking peers
