jaekwon

12 ms·

61.
by jaekwon 11y ago
I can't speak for anything else out there, but Tendermint is about providing real accountable BFT middleware. https://github.com/tendermint/tendermint/wiki/Byzantine-Cons... Calling this a journaled data
62.
by jaekwon 11y ago
There are two ways to secure a ledger. Mining, and accountable BFT like Tendermint.
63.
by jaekwon 11y ago
A consensus algorithm is one that ensures that multiple independent actors come to agreement about anything. In a blockchain, multiple independent miners or validators need to come to agreement about which blocks have been committed. A fau
64.
by jaekwon 11y ago
Eris Industries is built on Tendermint. Tendermint doesn't use PoW mining, but it can secure a distributed ledger. https://github.com/tendermint/tendermint/wiki/Byzantine-Cons... There's a lot of g
65.
by jaekwon 11y ago
Hello Ben, thanks for the great tool. If Bolt supports MVCC using a page log, why does Redis destroy Bolt on random write volume? Also, I'm seeing wildly different write performance measures. Siddontang on #237 back in 2014 for Ledis
66.
by jaekwon 11y ago
Tendermint founder here. What we're doing with Tendermint is creating a new protocol. See TMSP from the tutorial from Tendermint. http://tendermint.com/posts/tendermint-socket-protocol/ Yes, we're mo
67.
by jaekwon 11y ago
Thanks for the pointers, cockroachlabs. Your posts really help developers building real applications on Golang.
68.
by jaekwon 11y ago
I haven't read the article. For the lazy, what sort of level of pH changes are we talking about? Would if affect me if I go swimming in the ocean?
69.
by jaekwon 11y ago
The inner structs (of which the outer writer struct is composed) cannot access any of the functionality or fields outside of itself. Each inner struct is completely encapsulated, so you can't override an inner struct method and expect
70.
by jaekwon 11y ago
What does that say about the EFF marking this a neutral?
71.
by jaekwon 11y ago
Specifically, the block is an optimization for more transaction throughput in a consensus system. Without blocks, consensus would take longer because every binary decision requires at least a couple rounds of communication amongst every &q
72.
by jaekwon 12y ago
It would be interesting to see a more well defined attack from you.
73.
by jaekwon 12y ago
The whitepaper says that +2/3 of the entire validator set (in voting power) must sign every block. In the ideal scenario (in other words, in the stable state) every validator does sign every block.
74.
by jaekwon 12y ago
> control over the seed determining the next set of validators That notion makes sense in something like PeerCoin or other preexisting PoS designs, but I don't see how that phrase applies to Tendermint. There is no "sampling&q
75.
by jaekwon 12y ago
;) Where are you at? We're in the Bay Area.
76.
by jaekwon 12y ago
Sure, the addresses for the validators should be reused. The more it's used the better. >> Is this a problem that isn't present in Bitcoin? How can a brand new Bitcoin user securely join the network for the first time? >
77.
by jaekwon 12y ago
+1 Yes, you raise a valid point. It's a weakness that must be addressed. There needs to be additional assumptions in the model, e.g. the respective voting powers should be on the same order of magnitude, and the number of validators
78.
by jaekwon 12y ago
I have to admit that the "difficult to build applications upon" is not the best selling point to put up there. But I stand by the security being difficult to quantify in Bitcoin because the mining reward (plus fees) is necessaril
79.
by jaekwon 12y ago
> Promoting address reuse isn't a good idea. Depends on the application and the purpose of the blockchain, but the paper isn't explicitly premoting address reuse. > The assumption that an attacker will tell you he is attacki
80.
by jaekwon 12y ago
A fork in general results in evidence of double signing by at least 1/3 of the voting power, so fork attacks (and thus double-spend attacks) are expensive to launch (depending on the market cap and existing owners of the blockchain).
81.
by jaekwon 12y ago
Hi HackerNews! We're using TM consensus to create something more interesting than just a crypto "currency", so the website and github hasn't been updated in a while. But the algorithm is still sound (as far as we know)
82.
by jaekwon 12y ago
Yes, the algorithm allows for skipping absent or Byzantine validators. It doesn't skip the height, it just progresses to the next round. In the end it's about getting more than 2/3 of commit votes. You can prevote or precommi
83.
by jaekwon 12y ago
We're building the groundwork for it, and may tackle the securities market or partner up but for now our focus is on building out the foundation -- proper consensus logic and great block chain tooling.
84.
by jaekwon 12y ago
But I want to know more about the equations! What does y^2 = x^3 + ... have to do with an ellipse or the arc length of it?
85.
by jaekwon 12y ago
This is really interesting. One or both of you all should write a blog post on it because I'm eager to learn more. I love C. Love Go. Love the idea of Rust though I've never tried it, and I just want to know more.
86.
by jaekwon 12y ago
> is incentivized to produce one in which you cannot disable the built-in DRM/security Why is that? I don't see why this has to be true.
87.
by jaekwon 12y ago
Huh interesting... how does Go do it under the hood?
88.
by jaekwon 12y ago
As long as I have the choice to disable it, I want trusted computing. For example, I want to be able to run a secure cryptocurrency wallet on a portable device. Also would like to be able to introspect the hardware, even if it's cost
89.
by jaekwon 12y ago
Well, they do make the hardware over there -- maybe they're pretty comfortable with beta software. And besides, there was already some Android integration even before Google announced it.
90.
by jaekwon 12y ago
Translated: "The article doesn't explain why, only that it is." So laowushi, why do you think it is?

More ›