Commit 4b5e7972 authored by Péter Szilágyi's avatar Péter Szilágyi Committed by GitHub

Merge pull request #15287 from ernestodeltoro/typo_thoretical

ethash: fix typo
parents 8d8034fe 2e83c82f
...@@ -102,7 +102,7 @@ func generateCache(dest []uint32, epoch uint64, seed []byte) { ...@@ -102,7 +102,7 @@ func generateCache(dest []uint32, epoch uint64, seed []byte) {
header.Cap *= 4 header.Cap *= 4
cache := *(*[]byte)(unsafe.Pointer(&header)) 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)) size := uint64(len(cache))
rows := int(size) / hashBytes rows := int(size) / hashBytes
...@@ -187,7 +187,7 @@ func fnvHash(mix []uint32, data []uint32) { ...@@ -187,7 +187,7 @@ func fnvHash(mix []uint32, data []uint32) {
// generateDatasetItem combines data from 256 pseudorandomly selected cache nodes, // generateDatasetItem combines data from 256 pseudorandomly selected cache nodes,
// and hashes that to compute a single dataset node. // and hashes that to compute a single dataset node.
func generateDatasetItem(cache []uint32, index uint32, keccak512 hasher) []byte { 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) rows := uint32(len(cache) / hashWords)
// Initialize the mix // Initialize the mix
...@@ -287,7 +287,7 @@ func generateDataset(dest []uint32, epoch uint64, cache []uint32) { ...@@ -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 // hashimoto aggregates data from the full dataset in order to produce our final
// value for a particular header hash and nonce. // value for a particular header hash and nonce.
func hashimoto(hash []byte, nonce uint64, size uint64, lookup func(index uint32) []uint32) ([]byte, []byte) { 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) rows := uint32(size / mixBytes)
// Combine header+nonce into a 64 byte seed // Combine header+nonce into a 64 byte seed
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment