Ismail Khoffi

Yeah, just trying to understand what the max peer-list size would be and if that could still be gossiped as a whole (e.g. instead of a dht).

Speaking of fool's errands: >Randomized to spread load better. Skewed load would be limited in case of attack (manipulating sample count), but inconvenient. Sample counts are also only powers of...

> DAS assumes that at least one copy of the data is available, not that the data is stored uniformly by nodes. Yes, the latter helps with the former, but...

I'm also more in favour of option B. Additionally to what John said, I believe that if the specs are closer to the actual code that, they would rather be...

I also do not think that key-splitting makes the arithmetic constant time. I'm not too familiar with "physical proximity, like power analysis and fault attacks" but it would be cool...

The reason is: the regualr expression `/\/{2}/` used for finding single line comments also matches if found in some string like `"I'm not a comment // I'm a string"`. (see...

I am not even sure if this can be solved using a regualr expression. (At least I suspect without using a library, you can't solve this with a single Regular...

Thanks a lot for your feedback! > Each client can then implement a lightweight wallet which tracks only their interested transactions from the blockchain network. Won't clients still need to...

@LongNguyenHoang89 If you feel like it: We certainly would be happy if you/someone comes up with a pull-request where the client commits STRs to the bitcoin blockchain and where clients...

> equivocation could be detected proactively (even before the tree-roots are signed) In the current cosi implementation the "exception mechanism" is still lacking, which would be necessary for the pro-active...