Update on Overleaf.
This commit is contained in:
@@ -123,18 +123,18 @@ However, the adversary remains computationally bounded. Hence, it cannot, in a p
|
|||||||
% Second, we assume that \hash{.} values are uniformly distributed over the \(\llbracket 0 ; 2^{\ell} -1\rrbracket \)interval.
|
% Second, we assume that \hash{.} values are uniformly distributed over the \(\llbracket 0 ; 2^{\ell} -1\rrbracket \)interval.
|
||||||
% Finally, we assume that \hash{.} is collision free in the sense that given two blocks \(b_1, b_2\) we have \(b_1 = b_2 \Leftrightarrow \) \hash{b_1} = \hash{b_2}.
|
% Finally, we assume that \hash{.} is collision free in the sense that given two blocks \(b_1, b_2\) we have \(b_1 = b_2 \Leftrightarrow \) \hash{b_1} = \hash{b_2}.
|
||||||
|
|
||||||
% \textcolor{blue}{je ne suis pas completement sure que la suite fasse partie du modele. En fait il faut mettre toute cette partie là ou on va expliquer notre solution}
|
% \textcolor{blue}{je ne suis pas completement sûre que la suite fasse partie du modèle. En fait il faut mettre toute cette partie là où on va expliquer notre solution}
|
||||||
% In addition to the application specifications, a block \(b\) is valid if it can be appended to a prefix of the current blockchain.
|
% In addition to the application specifications, a block \(b\) is valid if it can be appended to a prefix of the current blockchain.
|
||||||
% Note that a block is not required to extend the best blockchain. On the contrary, it can happen that this addition may change the best blockchain.
|
% Note that a block is not required to extend the best blockchain. On the contrary, it can happen that this addition may change the best blockchain.
|
||||||
% PoW systems rely on two additional functions, namely \diff{.} and \target{.}.
|
% PoW systems rely on two additional functions, namely \diff{.} and \target{.}.
|
||||||
|
|
||||||
% \target{.} computes a value that depend on the current best blockchain to ensure a constant interblock delay.
|
% \target{.} computes a value that depends on the current best blockchain to ensure a constant interblock delay.
|
||||||
% For instance, Bitcoin computes a new \target{.} at each sequence of 2016 blocks on the empirical interblock delay on the previous sequence.
|
% For instance, Bitcoin computes a new \target{.} at each sequence of 2016 blocks on the empirical interblock delay on the previous sequence.
|
||||||
% The adjustment of \target{.} aims at handling the variation of the population of the system.
|
% The adjustment of \target{.} aims at handling the variation of the population of the system.
|
||||||
% When the population growths, blocks will be generated with a smaller interblock delay, \target{.} is thus lowered by the protocol.
|
% When the population growths, blocks will be generated with a smaller interblock delay, \target{.} is thus lowered by the protocol.
|
||||||
% On the contrary, if the population decreases, the interblock delay will increase and the \target{.} has to be increased by the protocol.
|
% On the contrary, if the population decreases, the interblock delay will increase and the \target{.} has to be increased by the protocol.
|
||||||
|
|
||||||
% \diff{b} computes a value that depend on the given block \(b\).
|
% \diff{b} computes a value that depends on the given block \(b\).
|
||||||
% In such a system, a block \(b\) is {\em valid} if \(b\) meets application specification, and if \diff{b} satisfies the current interblock delay condition, \emph{i.e.}, if the following condition holds \diff{b} \(\leq\) \target{b}.
|
% In such a system, a block \(b\) is {\em valid} if \(b\) meets application specification, and if \diff{b} satisfies the current interblock delay condition, \emph{i.e.}, if the following condition holds \diff{b} \(\leq\) \target{b}.
|
||||||
% For the sake of simplicity, we consider that \diff{b} = \hash{b}.
|
% For the sake of simplicity, we consider that \diff{b} = \hash{b}.
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user