aboutsummaryrefslogtreecommitdiffstats
path: root/consensus
diff options
context:
space:
mode:
authorErnesto del Toro <ernesto.deltoro@gmail.com>2017-10-13 13:13:52 +0800
committerErnesto del Toro <ernesto.deltoro@gmail.com>2017-10-13 13:13:52 +0800
commit2e83c82f80f104e8073ec4a80c51800e10b37496 (patch)
treed75b0cdd513a7db4f6b62d584d8290da8b619c52 /consensus
parent8d8034fe59e40d606e6feea4c71b4798e7862e2f (diff)
downloaddexon-2e83c82f80f104e8073ec4a80c51800e10b37496.tar
dexon-2e83c82f80f104e8073ec4a80c51800e10b37496.tar.gz
dexon-2e83c82f80f104e8073ec4a80c51800e10b37496.tar.bz2
dexon-2e83c82f80f104e8073ec4a80c51800e10b37496.tar.lz
dexon-2e83c82f80f104e8073ec4a80c51800e10b37496.tar.xz
dexon-2e83c82f80f104e8073ec4a80c51800e10b37496.tar.zst
dexon-2e83c82f80f104e8073ec4a80c51800e10b37496.zip
ethash: fix typo
Diffstat (limited to 'consensus')
-rw-r--r--consensus/ethash/algorithm.go6
1 files changed, 3 insertions, 3 deletions
diff --git a/consensus/ethash/algorithm.go b/consensus/ethash/algorithm.go
index a737bc636..76f19252f 100644
--- a/consensus/ethash/algorithm.go
+++ b/consensus/ethash/algorithm.go
@@ -102,7 +102,7 @@ func generateCache(dest []uint32, epoch uint64, seed []byte) {
header.Cap *= 4
cache := *(*[]byte)(unsafe.Pointer(&header))
- // Calculate the number of thoretical rows (we'll store in one buffer nonetheless)
+ // Calculate the number of theoretical rows (we'll store in one buffer nonetheless)
size := uint64(len(cache))
rows := int(size) / hashBytes
@@ -187,7 +187,7 @@ func fnvHash(mix []uint32, data []uint32) {
// generateDatasetItem combines data from 256 pseudorandomly selected cache nodes,
// and hashes that to compute a single dataset node.
func generateDatasetItem(cache []uint32, index uint32, keccak512 hasher) []byte {
- // Calculate the number of thoretical rows (we use one buffer nonetheless)
+ // Calculate the number of theoretical rows (we use one buffer nonetheless)
rows := uint32(len(cache) / hashWords)
// Initialize the mix
@@ -287,7 +287,7 @@ func generateDataset(dest []uint32, epoch uint64, cache []uint32) {
// hashimoto aggregates data from the full dataset in order to produce our final
// value for a particular header hash and nonce.
func hashimoto(hash []byte, nonce uint64, size uint64, lookup func(index uint32) []uint32) ([]byte, []byte) {
- // Calculate the number of thoretical rows (we use one buffer nonetheless)
+ // Calculate the number of theoretical rows (we use one buffer nonetheless)
rows := uint32(size / mixBytes)
// Combine header+nonce into a 64 byte seed