[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[GNUnet-SVN] r26047 - gnunet-java
From: |
gnunet |
Subject: |
[GNUnet-SVN] r26047 - gnunet-java |
Date: |
Thu, 7 Feb 2013 12:42:05 +0100 |
Author: dold
Date: 2013-02-07 12:42:04 +0100 (Thu, 07 Feb 2013)
New Revision: 26047
Modified:
gnunet-java/ISSUES
Log:
type
Modified: gnunet-java/ISSUES
===================================================================
--- gnunet-java/ISSUES 2013-02-07 11:41:24 UTC (rev 26046)
+++ gnunet-java/ISSUES 2013-02-07 11:42:04 UTC (rev 26047)
@@ -1,7 +1,7 @@
* Writing down the details: How / How formal should I do it?
-* IBF implemente with 8-bit count, 64-bit key, 32-bit checksum
+* IBF implemented with 8-bit count, 64-bit key, 32-bit checksum
* improved decoding algorithm by checking locations generated by hash in
(supposedly) pure bucket
* 1mio elements take ~25sec on my machine, scales linearly
* performance in the last version was better, because now there's one more
call to CRYPTO_hash to generate
@@ -15,7 +15,7 @@
* author's solution: don't XOR, add, check for divisibility of id-sum by count
)
-* the order of the IBF should is its salt
+* the order of the IBF should be its salt
* mapping between keys<->hashcodes
* i don't think there is the need for any *additional* mapping,
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [GNUnet-SVN] r26047 - gnunet-java,
gnunet <=