0

A key feature of blockchain based cryptocurrencies is that they provide inherently secure systems that don't rely on third parties. The newer DAG-based cryptos like Byteball are being touted as superior to blockchains because they have faster transaction times and eliminate the need for miners. However, these cryptos use something called "trusted witnesses" to resolve double spend conflicts. Isn't this inherently less secure than a true trustless system like Proof of Work? I thought that the whole point of a blockchain was to provide intrinsic security without the need for trusted third parties.

  • 3
    You pointed out the flaw yourself. Naive people are being buzzword-ed off their money. No, 'trusted witnesses' are not decentralized by definition. – skang404 Feb 15 '18 at 23:53
  • That's what I thought. I would really like to hear someone argue the other side of this and tell me why they believe trusted witnesses don't compromise the system. So far, I haven't seen any of the DAG supporters make any attempt to address this question. – Mike Collins Feb 16 '18 at 14:16
  • I wonder how it will behave when witnesses used by sender and receiver disagree on amount of currency stored in given address - no malicious behavior required from witness, just someone spamming network. I guess they would need some distributed consensus protocol :) – user158037 Feb 21 '18 at 16:18
0
  1. You need to prove that the witness Selection process is random and independent. Alice can double-spent if she has control over the witness and the network.

  2. Let assume Alice can double-spent, in bitcoin one can wait for 6 confirmations to rule out most of the double-spent. E.g. Seller only sends out the goods after 6 confirmation. How can you achieve this in DAG? since the account is only updated by its' own transaction. On top of that, the graph DAG is very complex compared to bitcoins' link-listed blockchain.

  3. DOuble-spent transactions may get buried by other transactions.

-2

It's interesting that so many believe that the original Bitcoin way is the only way to achieve Byzantine Fault Tolerance. It is not. Explaining why PoW with mining is more secure than other methods boils down to the math being the trusted element. This is also the case with Byteball (now called Obyte). The Obyte whitepaper explains that it considers PoW mining to be a leak of network value; to power companies, etc. The Obyte consensus protocol follows a deterministic set of rules. The role of the witnesses is only to order or sequence the units in a fair FIFO manner. Remember, in a DAG an unbounded number of units can be created at the same time, so in the case of an attempted double-spend, the fair ordering will have been determined by the witnesses broadcasting their encounter with the unit as they occur; and not by the amount of fee paid to prioritise them as is the case in BTC. Witnesses do not have other powers and should not be compared with bitcoin miners; they are trusted to act rationally to protect their own reputation in the real world. Full nodes are anonymous nodes which execute the consensus protocol to validate and store the unit. The consensus protocol they execute is deterministic (while that of Bitcoin is probabilistic) so once a unit is confirmed stable in Obyte, it is final; it is then not just extremely unlikely to be invalidated as is the case with Bitcoin after x-number of confirmations; in Obyte it is 100% impossible. The Obyte network is designed to allow for the number of witnesses to be limited only by the number of full nodes on the network, but just twelve are needed per transaction.
Anyone can set-up a witnessing node with relatively little hardware, etc. The Bittrex witness node at address QR542JXX7VJ5UJOZDKHTJCXAYWOATID2 is used by anyone who trusts it to be honest and reliable about broadcasting units as it sees them. They use it, but maybe others don't. Bittrex has a strong logical incentive to run an honest, reliable witness and Bittrex partners, customers etc. transacting Obyte Bytes with them expect Bittrex to protect their brand. If however, they were to fail at that, it would just mean that other nodes would 'vote' away from them by not using them as a witness. A transaction needs just seven of twelve witnesses to confirm sight of the unit. So, it would require seven simultaneous 'failed' witnesses (of a given transaction) for a unit to be stuck in an unstable position, or be sequenced in an unfair order. The probability of that is considered extremely unlikely, especially in a mature network. The white paper explains this in full detail.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.