AR_1

4 ms·

1. 1.▲
   by AR_1 4y ago

   A well written article and the problem of efficient peer discovery in a large network of nodes will become even more pronounced in the near future. Another design using proximity based hashing is to use a particle swarm optimization approac
2. 2.▲
   by AR_1 5y ago

   Isn’t it similar to how Holochain operates?
3. 3.▲
   by AR_1 6y ago

   Happy to discuss and dive in. We’ve been thinking about this problem for quite some time. JP was supposed to put us in touch last year, as we had questions on Urkel, but it never happened. Happy to connect here.
4. 4.▲
   by AR_1 6y ago

   @JJ big fan of yours and ideas behind Urkel. Now in C it’ll be very performant. Likewise, I’ve done testing with SMT and we were hitting the same bottlenecks. It will be interesting to test this implementation. We recently published a res