7
votes
Accepted
What is the Actual IOTA Algorithm for Tip Selection?
(I already know that this answer will disappoint you - as it did disappoint me when I found it out)
The current algorithms around the tangle depend on a central node run by the Foundation, known as ...
mihi♦
- 7,324
4
votes
Accepted
IOTA Whitepaper: What is z in Section 4.1?
Variable z is just the index over which the sum in equation (13) iterates. This is similar to when you have
\sum_{i=1}^n ...
where i is the standard index (so no need to "define" i separately).
...
4
votes
Iota White paper section 4.4. Random walkers
A random walker on it's way to tip to approve must randomly select a path at each step. The random walker have the choice between all transactions (i.e. site) directly approving it's current site.
...
3
votes
Accepted
Comparing transaction approval and confirmation in IOTA and blockchain
This important question should be answered clearly & with detail. There are three parts to your question:
How does IOTA confirm transactions now?
How will IOTA confirm transaction after ...
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 ...
2
votes
Accepted
Theoretical delay before first approval
1/ln2 from equation (3) in page 8. (in version 1.2 of the whitepaper)
2
votes
Accepted
Iota Whitepaper: What is "k" in Section 3?
The k from the footnote of section 1 is the required number of transactions to be referenced by new transactions (as is noted by you in your question).
The k from section 3 is just an index/...
2
votes
Iota Whitepaper: What is "k" in Section 3?
In both cases, k is a "variable" used to make the English sentence easier to understand, the variable is both defined and used within the sentence, but nowhere else. The meaning of these two k is ...
mihi♦
- 7,324
2
votes
Accepted
IOTA Whitepaper: What is δ?
H(t) represent the expected cumulative weight at time t.
∂ is a way to note a very small delta time.
The first equation explicit the value the H function relatively to the value of the H function a ...
2
votes
Accepted
"The Tangle" white paper: How the probability of double-spending event end with this approximation (t_0 μ)/w_1?
It's Taylor series of the exp function to the 1st order:
https://en.wikipedia.org/wiki/Taylor_series#Exponential_function
exp(-x) = 1 + (-x)^1/1! + (-x)^2/2! + ....
Since white paper assumes x to ...
2
votes
What is a conflicting transaction?
Transactions are conflicting if they try to spend the same money from the same address (and the address does not include enough money to satisfy both at the same time - but this should not happen ...
mihi♦
- 7,324
2
votes
Iota White paper section 4.4. Random walkers
Currently we have the Coo node running and placing milestones at regular intervals and these milestones are used by the nodes to determine the 'direction' that consensus is forming among all the ...
1
vote
Accepted
IOTA Whitepaper Math Section 4.1: Am I calculating this right?
Unfortunately, this doesn't look correct. Regardless of the actual numbers, you are not treating the sum as a sum but rather as a single summand. On top of that, you seem to be missing the exp ...
1
vote
Iota White paper section 4.4. Random walkers
Selection of start points of random walkers is quite random in the Tangle.
First, it considers a subset of the Tangle with a cumulative weight between the range L and 2L where L is reasonably large ...
1
vote
Accepted
IOTA Whitepaper: What is n in Section 4?
Here W^{(n)} denotes the time it takes to complete a Proof-Of-Work of difficulty n, where n is a positive integer (of acceptable size, cf. first paragraph of Section 2).
1
vote
Accepted
IOTA Whitepaper: What is N in Section 3?
Parameter N was defined in an earlier version of the whitepaper as "total number of transactions". However, the dependency of h on L and N (as seen in your quote) has since been removed, and all the ...
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" ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
white-paper × 16iota-network × 7
tangle × 5
double-spending × 4
tip-selection × 2
transaction × 1
security × 1
legacy-protocol × 1
dag × 1
algorithm × 1