Re: Creating a Query for a SHA-1 Hash

--- In [email protected], Arne Babenhauserheide <arne_bab@...>
wrote:
> Would an Ultrapeer "proxy" hash queries, it would have to do the
full search 
> itself - possibly for every single leaf. I think you can imagine how
much that 
> could overload the UP when it has more than one leaf to proxy. 

A old-fashioned hash search comes in from wherever, leaf or peer, it
either matches a hash or not in your table and you send a single
old-fashioed hit back or not, as simple as that.  Is that so hard?
You don't have to treat each individual query as a whole new peer, 
just reflect back hits one-for one and pass it along to the next hop.
The general idea is to just temporarily cover the existing protocol
without getting fancy and overthinking it.