A Distributed Ledger

Blockchain

• each transactions with two entities
• variables design like the block size , time between block...
• the block creater decide the block content
• POW expensive electrical-consume
  and Blockchain is just like a straightly single line

ByteBall

• each transaction with one entity
• no block creater
• use data structure Directed Acyclic Graph (DAG)
• no pow
  transactions connected directly they won't group into block ,the new transaction references to 1 or more pre transaction,and in DAG we have a brunch of transctions in parallel and the degree of parallelism with adapts dynamically to the current load.
  (Byteball中没有区块的概念，也没有区块容量的问题。相反，每一个新的交易都通过包含和签名它们的哈希来参考更早(父母交易)的一个或几个交易。交易中的链接形成了一个DAG(有向无环图) ),多节点并行，并会根据负载进行动态调整

So how does byteball work?

• First -- how it add peer?
  The pic show us how thr peers add on the DAG structure and each new peer is visible to all the peers
  thus it could roll very fast just like the snowball
  
  Also,if we already have a partial order in DAG,and when there are two transactions conflicting and one of them is reachable from the other through directional parent-child links, we canimmediately reject the later one.(与软分叉的模式很相似)

• Second -- proof
  what if there is no partial order in the DAG ?
  It need some special users ,called WITNESSES , who are trusted to post their transaction in order.
  
  and we could order other transaction with it ,even there is no partial order , it draw a special chain through DAG called Main Chain(update every time a new transaction added).
  If there is a Double-spend conflict transaction which appears earlier on the Main Chain is VALID and the other is invalid , the invalid transaction will still exist on DAG but its movements will be ignored.
• Tird --Witness
  Witnesses are very important for the security of Byteball.we can asume the witness is just like the distrbuted checkpointing.
  Comparing with the ITOA \ PEERCOIN(one checkpointing authority)-- Byteball have 12 witnesses.
  Witnesses are selected by the community and can be replaced one by one .
  

One of the most unique features of Byteball is that when the witnesses misbehave they will lose something in the real world,not just in the byteball economy .

• Fourth --security and resource using
  The bond between internal economy and real world make the byteball isn't dependant on the size of internal economy. The proportion between Native Currency and Token. when we have a native currency and some tokens.In this systemwill only reliably run within acertain safety range.
  Like the whitepaper says :"only if the native currency captures the majority of the value such an architecture canbe secure."

As for byteball 1 byte is exactly the amount you pay for storing 1 byte of data in a global secure,decentralized database , permanently.

个人觉得

ByteBall的共识机制其实本质上就是DPOS通过局部中心化代替了原来POW的完全去中心化
DPOS机制在很大程度上更像是现在国家的人民代表大会，美国两会制度，这样不仅能够提高我们的工作效率额日期额也聚集到了更多的人。

在与比特币的对比中

• 在共识方面能够达到节省电力能源的消耗，降低网络运行成本、并且提高出快速率，
• 存在的问题也是投票机制带来的决策速率慢，不能对问题节点作出快速的处理