Questions on: hash - страница 3

Doesn't the block hash or the transaction id provide enough entropy (for example, by using block_hash % 37 to generate a random number between 0 and 36)? Block Chain Roulette determines the lucky number as a function of the hash of newest block in th
I read that if sha-256 was compromised at some point in the future, or for any other reason, bitcoin could switch to a different algorithm can someone detail how exactly that would work, and what the implications to existing blocks would be? from my
To do this, we first take the first half of the data string: 0000000244de6ceba49e1c8d438c0d8c584eefd9c8590545bfdfbf380000025c00000000fb3a091de1b4bbe5dc7acfe6bdacbc3fc3bb09bf1030adef8e2854db We then reverse the endianness of each 32-bit unsigned int (
As explained by Gavin Andersen on the forum - in order to calculate the ID hash of the Tx that is used in the Merkle Tree, one needs to SHA hash the whole Tx message as defined in the Protocol Specification wiki page twice. For example, for the only
Are Bitcoin ASICs Optimized for Fixed Length Messages? It would really surprise me if they weren't
I set out to test the claim: "Every nonce has an equal chance of winning. " So, I plotted, with gnuplot, the nonce values vs. hashes for all the valid blocks in the blockchain:(Also, in the last plot, you can really visualize the change in the diffic
I'm trying to make certain I'm understanding the purpose behind the Quark algorithm. There are lots of devices that need secure algorithms but have severe power and processing constraints such as RFIDs (the chips found in everything from clothes to c
One compute-intensive part of the server work is creating new merkle roots. As mckoss mentions this becomes a lot faster if you only recalculate the merkle branch that is changed by the new generation transaction instead of recalculating the entire m
While the question isn't an exact duplicate, the answer essentially is, so I'm going to quote this answer by Pieter Wuille: As is normal when doing Elliptic Curve encryption, a private key is simply a random number. In the case of secp256k1, the elli
Even without the whole discussion about merkle trees, having two transactions with the same hash could create a fork that would not be resolved without manual intervention. As the transactions are also identified by their hash on the protocol the cli