1
General Discussion / Re: IOTA + Bitshares
« on: October 31, 2015, 02:48:51 pm »No, it's still not clear how popular oracle feature will be. Yes.
What is oracle?
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
No, it's still not clear how popular oracle feature will be. Yes.
The details are quite challenging to explain in layman terms. But if you are an experienced programmer it will be easier to grasp. In short: Iota client doesn't need to order transactions, it doesn't need to track balances, it doesn't need to validate transactions most of time except lightning-fast verification of a PoW token.
If there is no mining, how can the node benifit from runing a pow node?Benefit comes from ability to send transactions.Basiclly, can you tell how many roles there and how they act and why they join.One role. Cooperation with peers gives benefits to every participant, this is why they will join.
Bts is already a smart contract platform (since cfds are kind of smart)
as for turing completeness: who knows .. mayve someone is already working on a proposal to upgrade the protocol
What's your Big O efficiency in terms of request and delivery of chunks?
"chunks" (currently entire files) are indexed by file contract ID; this mapping is stored in a hash table, so lookup efficiency should be O(1). During transfer, the data is decrypted and its Merkle root is calculated; IIRC these operations are both O(n). Finally, I believe reconstructing the erasure-coded chunks is slightly worse than O(n), but I don't have an exact figure. We are, however, using this library: https://github.com/klauspost/reedsolomon which claims >1GB/s throughput, and our local tests have confirmed this. In short, Sia's algorithms do not add significant overhead to download speed. Far more relevant are 1) your download bandwidth and 2) the combined upload bandwidth of the file's hosts.
GitHub
klauspost/reedsolomon
reedsolomon - Reed-Solomon Erasure Coding in Go
testing the wallet now.
here's my address if you got some small amounts for me to play with 393c5fa7f445cc938172f70f8eba3ee2c90049aea7240b5c86a603f9e8c9d24df1048c7ab616
edit: how do you mine in windows?
So 1000 people with 25% total stake notice that their transactions are not confirmed for a long time. Votes of these people are enough to replace 51 delegates. How will they notify the others that something went wrong?
DPOS: not too comfortable with people voting honestly as a security assumption (as I recall, there was an empirical result that showed that due to the mass of people non-voting you only need ~8% of stake to perform a "51% attack"), would prefer it used a more standard BFT algo between the delegates, but otherwise makes sense.