Re: Re: Creating a Query for a SHA-1 Hash

Am Donnerstag 08 Januar 2009 06:49:17 schrieb Aaron Walkhouse:
> 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.

That sounds like just add support for broadcast style hash queries again, or 
do I misunderstand you? 

Wishes, 
Arne
-- 
-- My stuff: http://draketo.de - stories, songs, poems, programs and stuff :)
-- Infinite Hands: http://infinite-hands.draketo.de - singing a part of the 
history of free software.
-- Ein Würfel System: http://1w6.org - einfach saubere (Rollenspiel-) Regeln.

-- PGP/GnuPG: http://draketo.de/inhalt/ich/pubkey.txt


[Non-text portions of this message have been removed]