Hot answers tagged

9 votes

Can IOTA have a hard fork?

IOTA can theoretically have a hard fork. In order for that to happen, a few things must occur: 1) The forker must decide on a state of the tangle that will be used for the fork. This is more ...
user avatar
  • 3,135
8 votes

Can IOTA have a hard fork?

Most of IOTA is open source, and the parts that are not (like the Coordinator) can be implemented by interesting parties themselves (no guarantee that their Coordinator is on par with IOTA's, though). ...
user avatar
  • 7,254
4 votes

As per "The Stability and the Security of the Tangle", how will IOTA ensure that all honest nodes are continuously using their hashing power?

The paper referenced in the question try to demonstrate that the tangle cannot resist to a 51% attack. Nothing really new here. The position of the Iota Foundation is to favorise a stable organic ...
user avatar
  • 5,344
4 votes
Accepted

A blockchain is a specific type of DAG, true or false?

Here is what a blockchain looks like. The major restriction compared with a pure DAG is that a vertex (here called block) cannot have more than one parent. So, yes a blockchain is a dag with the ...
user avatar
  • 5,344
4 votes

How can the transactions in the Tangle be ordered temporally?

Due to the dag structure of the Tangle a complete ordering of transactions is impossible. Therefore, the protocol don't relies on transaction time ordering to determine which of two conflicting ...
user avatar
  • 5,344
3 votes

As per "The Stability and the Security of the Tangle", how will IOTA ensure that all honest nodes are continuously using their hashing power?

My paper states that any tip selection that uses the weight of sites to select tips are subject to double-spending attack if the amount of hashing power used by nodes to generates honest sites is ...
user avatar
  • 31
3 votes
Accepted

is tangle (IoTA) Depth-first search or Breadth-first search?

When the tip selection algorithm searches for transactions, it uses a depth parameter. You can find out more about depth here: https://docs.iota.org/docs/getting-started/0.1/transactions/depth
user avatar
2 votes

How can the transactions in the Tangle be ordered temporally?

All that we know is that Tf and Tg come after Ta,Tb, Tc ...and the transactions (directly or indirectly) referenced by Ta, Tb, Tc. That is all the Tangle "knows" about the temporal order of these ...
user avatar
2 votes

IOTA not a blockchain but uses directed acylic graph (DAG) which is what ethereum ethhash is based on (dagger)

A DAG is just a mathematical concept were you have directed edges and vertices, with the property that if you start from a vertice a follow the edges (in the correct direction): you cannot visit a ...
user avatar
  • 5,344
2 votes

Theoretical delay before first approval

r/(r+λh) is a mean value ( < 1 ) r is tips before time [t-h] r+λh is a slightly higher number adding all tips from time interval [t-h,t] since the node does not know λh tips are no tips any more ...
user avatar
2 votes
Accepted

Theoretical delay before first approval

1/ln2 from equation (3) in page 8. (in version 1.2 of the whitepaper)
user avatar
2 votes

How will Smart Contracts be implemented on the Tangle, providing timestamps are enforced?

Ales has his own take, but I think he is perhaps ruling out smart contracts based on perceived functionality from other implementations. http://iota.org/timestamps.pdf Even if all transactions ...
user avatar
2 votes

How will Smart Contracts be implemented on the Tangle, providing timestamps are enforced?

In IOTA timestamp accuracy cannot be trusted. "The tangle is a graph with only a partial order structure, which makes it difficult (in fact, generally impossible) to establish the correct time ...
user avatar
1 vote

A blockchain is a specific type of DAG, true or false?

The author's logic is correct. To be more precise, every Blockchain is a DAG, but not every DAG is a Blockchain. This is because a Blockchain is a very specific type of DAG, one could say it's simply ...
user avatar
  • 1,663
1 vote

Theoretical delay before first approval

Expected increment of # of tips at time t is: 1 - 2*r/(r+λh) .....eqn(1) where "1" refers to new tip created by the tx and "2*r/(r+λh)" refers to expected # of "erased" tips. If the two "erased" ...
user avatar

Only top scored, non community-wiki answers of a minimum length are eligible