Reach out my broker Mr David Mark on w...h.....a..t...s....a...p...p...+1.. 3...2..0...-...3...1....3...-....2....2....2....9 tell him I referred you to him
53:10: Censorship detection is an interesting problem. Does anybody know of anybody working on that? 40:00 - 45:00: Very interesting stuff. Piqued my interest. Nitpick at 25:15: for Schellingcoin, the bribing attacker needs a budget of at least 0.5N(P+epsilon), where N is the number of participants. The reason is because they need to prove that they can pay P+epsilon *to each bribed participant*. In other words, the attacker can't bribe two different participants with the same pile of money.
Reach out my broker Mr David Mark on w...h.....a..t...s....a...p...p...+1.. 3...2..0...-...3...1....3...-....2....2....2....9 tell him I referred you to him
Reach out my broker Mr David Mark on w...h.....a..t...s....a...p...p...+1.. 3...2..0...-...3...1....3...-....2....2....2....9 tell him I referred you to him
Reach out my broker Mr David Mark on w...h.....a..t...s....a...p...p...+1.. 3...2..0...-...3...1....3...-....2....2....2....9 tell him I referred you to him