[Gzz-commits] gzz/Documentation/misc/hemppah-progradu researc...

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/12/17 08:57:40

Modified files:
        Documentation/misc/hemppah-progradu: research_problems 

Log message:
        Updates to b)'s answer

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/research_problems.diff?tr1=1.5&tr2=1.6&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.5 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.6
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.5       Tue Dec 
17 05:36:21 2002
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Tue Dec 17 
08:57:40 2002
@@ -253,7 +253,7 @@
 -How CAs' data should be saved ?
 
 2.2.5. Answers to research problem
--compared to previous research problem, the benefits of DHTs and SWNs in this 
research problem are smaller
+-compared to previous research problem, the "first seen" benefits of DHTs and 
SWNs in this research problem are smaller
        -we don't know which block is the most recent associated with a specfic 
urn-5 name
 -in theory, though, the most efficient algorithm is O(log n), *assuming* that 
we already know the most recent block's ID (see previos research problem)
 -currently, there is no "out-of-the-box" answer to this research problem