in πŸ““ Notes

Pastry (DHT)

Table of Contents

1 min read

  • Node ID, 128 bits $\in [0, 2^{128}[$
  • Key Id, 164 bits $\in [0, 2^{161}[$
  • Key $n$ stored on node $n$. If the node $n$ is not available, store on $n+1$.
  • Routing algorithm works with prefix-based matching, getting progressively closer to the destination.new

Or if you don't know what a response is, you can always write a webmention comment (you don't need to know what that is).