|
|
|
|
|
|
|
|
|
Uniquely attributable fault
| Глоссарий по криптовалютам и блокчейну |
A fault such that there exists clear evidence which can be used to determine exactly which validator committed the fault. for example, liveness faults are not uniquely attributable because if a message from a fails to reach b, it could be because a failed to send that message, or because b failed to listen to it, whereas equivocation faults are uniquely attributable.
|
|
Attributable, английский
Относящийся,благодаря
Equivocation, английский
- A validator sending two messages that contradict each other, or more precisely a validator sending two messages that a validator running the correct algorithm could only send if it sends one message, "rewinds" its internal state to some point before sending that message, then at some future point in time sends the other message. one simple example is a transaction sender sending two transactions with the same nonce.
- Неопределенность
- The reducti.on of variety in a communication channel by classification, simplification, generalization or condensation of the signals or messages sent. equivocation occurs when different signals are no longer differentiated by the receiver. information theory quantitatively decomposes the sender`s statistical entropy into a quantity of transmitted information and the quantity of equivocation. equivocation is the logical complement of noise and undesirable from the sender`s perspective.
|
Hash, английский
- A hash function (or hash algorithm) is a process by which a piece of data of arbitrary size (could be anything; a piece of text, a picture, or even a list of other hashes) is processed into a small piece of data (usually 32 bytes) which looks completely random, and from which no meaningful data can be recovered about the document, but which has the important property that the result of hashing one particular document is always the same. additionally, it is crucially important that it is computationally infeasible to find two documents that have the same hash. generally, changing even one letter in a document will completely randomize the hash; for example, the sha3 hash of "saturday" is , whereas the sha3 hash of caturday is . hashes are usually used as a way of creating a globally agreed-upon identifier for a particular document that cannot be forged.
- [1] nautical slang for food. [2] originally a specific cooking term covering leftovers from the joint, chopped, mixed with cooked vegetables and re-heated, usually baked or browned. [3] slang term for cannabis.
- Блюдо из мелко нарезанного мяса (преимущественно оставшегося от обеда и т.п.) и овощей старая мысль или неоригинальное высказывание, выдаваемое за новое
- Numerous, small indications appearing on the viewing screen of the ultrasonic instrument indicative of many small inhomogeneities in the material and/or background noise; also known as grass.
- See background noise.
Patricia tree (or trie), английский
A data structure which stores the state of every account. the trie is built by starting from each individual node, then splitting the nodes into groups of up to 16 and hashing each group, then making hashes of hashes and so forth until there is one final "root hash" for the entire trie. the trie has the important properties that (1) there is exactly one possible trie and therefore one possible root hash for each set of data, (2) it is very easy to update, add or remove nodes in the trie and generate the new root hash, (3) there is no way to modify any part of the tree without changing the root hash, so if the root hash is included in a signed document or a valid block the signature or proof of work secures the entire tree, and (4) one can provide just the "branch" of a tree going down to a particular node as cryptographic proof that that node is indeed in the tree with that exact content. patricia trees are also used to store the internal storage of accounts as well as transactions and ommers. see here for a more detailed description.
|
|
|
|
|
|
|
