Nonce - Revision history

Jbaczuk: changed "leading zeros" to explain how it must meet the target. Removed confusing language mixing up the terms "target" and "difficulty"

2018-07-11T17:27:37Z

changed "leading zeros" to explain how it must meet the target. Removed confusing language mixing up the terms "target" and "difficulty"

← Older revision		Revision as of 17:27, 11 July 2018
Line 1:		Line 1:
	The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is ~~set~~ so that the [[hash]] of the block will ~~contain a run~~ of ~~leading zeros~~. The rest of the fields may not be changed, as they have a defined meaning.		The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is adjusted by miners so that the [[hash]] of the block will be less than or equal to the current [[target]] of the network. The rest of the fields may not be changed, as they have a defined meaning.

	Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash ~~containing~~ the ~~required number~~ of ~~zero bits~~ is found. The ~~number of zero bits~~ required is ~~set by~~ the [[difficulty]]~~. The resulting hash has to be~~ a ~~value less than the current~~ [[difficulty]] ~~and so will have to have~~ a ~~certain number of leading zero bits to be less than that~~. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash less than or equal to the current [[target]] of the network is found. The [[target]] required is also represented as the [[difficulty]], where a higher [[difficulty]] represents a lower [[target]]. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

	== Golden Nonce ==		== Golden Nonce ==
	A ''golden nonce'' in Bitcoin [[mining]] is a nonce which results in a [[block hashing algorithm\|hash]] value lower than the ~~target~~ [[~~difficulty~~]].		A ''golden nonce'' in Bitcoin [[mining]] is a nonce which results in a [[block hashing algorithm\|hash]] value lower than the [[target]].
	In many practical mining applications, this is simplified to any nonce which has 32 leading zeroes<ref>https://bitcointalk.org/index.php?topic=75609.msg837556#msg837556</ref>, with a secondary test checking if the actual value is lower than the target difficulty.		In many practical mining applications, this is simplified to any nonce which results in a block [[block hashing algorithm\|hash]] which has 32 leading zeroes<ref>https://bitcointalk.org/index.php?topic=75609.msg837556#msg837556</ref>, with a secondary test checking if the actual value is lower than the target difficulty.

	=== Etymology ===		=== Etymology ===

Geohump: clarifying the position and meaning of the "zeros' needed in the hash to validate the nonce.

2016-10-31T16:51:19Z

clarifying the position and meaning of the "zeros' needed in the hash to validate the nonce.

← Older revision		Revision as of 16:51, 31 October 2016
Line 1:		Line 1:
	The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of leading zeros. The rest of the fields may not be changed, as they have a defined meaning.		The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of leading zeros. The rest of the fields may not be changed, as they have a defined meaning.

	Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. The number of zero bits required is set by the [[difficulty]]. The resulting hash has to be a value less than the current [[difficulty]] and so will have to have a certain number of leading zero bits to be less than that. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

	== Golden Nonce ==		== Golden Nonce ==

Geohump at 16:45, 31 October 2016

2016-10-31T16:45:40Z

← Older revision		Revision as of 16:45, 31 October 2016
Line 1:		Line 1:
	The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.		The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of leading zeros. The rest of the fields may not be changed, as they have a defined meaning.

	Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

TheRealSteve at 21:35, 19 March 2015

2015-03-19T21:35:48Z

← Older revision		Revision as of 21:35, 19 March 2015
Line 2:		Line 2:

	Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

			== Golden Nonce ==
			A ''golden nonce'' in Bitcoin [[mining]] is a nonce which results in a [[block hashing algorithm\|hash]] value lower than the target [[difficulty]].
			In many practical mining applications, this is simplified to any nonce which has 32 leading zeroes<ref>https://bitcointalk.org/index.php?topic=75609.msg837556#msg837556</ref>, with a secondary test checking if the actual value is lower than the target difficulty.

			=== Etymology ===
			The term ''golden nonce'' most likely evolved from the term ''[http://en.wikipedia.org/wiki/Charlie_and_the_Chocolate_Factory#Plot golden ticket]'' as used to refer to a nonce satisfying the mining requirements as early as April 8th, 2011<ref>https://github.com/progranism/Bitcoin-JavaScript-Miner/blob/master/miner.js#L5</ref>

			== References ==
			<references />

	[[Category:Technical]]		[[Category:Technical]]
	[[Category:Vocabulary]]		[[Category:Vocabulary]]

Humilulo: "the the" --> "the"

2012-02-29T14:30:58Z

"the the" --> "the"

← Older revision		Revision as of 14:30, 29 February 2012
Line 1:		Line 1:
	The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.		The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.

	Any change to ~~the~~ the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

	[[Category:Technical]]		[[Category:Technical]]
	[[Category:Vocabulary]]		[[Category:Vocabulary]]

JohnTobey253: Soften "impossible" wrt breaking the hash function.

2011-06-30T13:05:34Z

Soften "impossible" wrt breaking the hash function.

← Older revision		Revision as of 13:05, 30 June 2011
Line 1:		Line 1:
	The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.		The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.

	Any change to the the block data (such as the nonce) will make the block hash completely different. Since it is ~~impossible~~ to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the the block data (such as the nonce) will make the block hash completely different. Since it is [[wikipedia:Cryptographic hash function\|believed infeasible]] to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

	[[Category:Technical]]		[[Category:Technical]]
	[[Category:Vocabulary]]		[[Category:Vocabulary]]

Prcarter at 00:56, 27 February 2011

2011-02-27T00:56:40Z

← Older revision		Revision as of 00:56, 27 February 2011
Line 1:		Line 1:
	The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.		The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.

	Any change to the the block data (such as the nonce) will make the block hash completely different. Since it is impossible to predict which combination of bits will result in ~~such a~~ hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].		Any change to the the block data (such as the nonce) will make the block hash completely different. Since it is impossible to predict which combination of bits will result in the right hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

	[[Category:Technical]]		[[Category:Technical]]
	[[Category:Vocabulary]]		[[Category:Vocabulary]]

Prcarter: Created page with "The "nonce" in a bitcoin block is a 32-bit (4-byte) field whose value is set so that the hash of the block will contain a run of zeros. The rest of the fields may not be ..."

2011-02-27T00:55:04Z

Created page with "The "nonce" in a bitcoin block is a 32-bit (4-byte) field whose value is set so that the hash of the block will contain a run of zeros. The rest of the fields may not be ..."

New page

The "nonce" in a bitcoin [[block]] is a 32-bit (4-byte) field whose value is set so that the [[hash]] of the block will contain a run of zeros. The rest of the fields may not be changed, as they have a defined meaning.

Any change to the the block data (such as the nonce) will make the block hash completely different. Since it is impossible to predict which combination of bits will result in such a hash, many different nonce values are tried, and the hash is recomputed for each value until a hash containing the required number of zero bits is found. As this iterative calculation requires time and resources, the presentation of the block with the correct nonce value constitutes [[proof of work]].

[[Category:Technical]]
[[Category:Vocabulary]]