@@ -102,7 +102,7 @@ func generateCache(dest []uint32, epoch uint64, seed []byte) {
102
102
header .Cap *= 4
103
103
cache := * (* []byte )(unsafe .Pointer (& header ))
104
104
105
- // Calculate the number of thoretical rows (we'll store in one buffer nonetheless)
105
+ // Calculate the number of theoretical rows (we'll store in one buffer nonetheless)
106
106
size := uint64 (len (cache ))
107
107
rows := int (size ) / hashBytes
108
108
@@ -187,7 +187,7 @@ func fnvHash(mix []uint32, data []uint32) {
187
187
// generateDatasetItem combines data from 256 pseudorandomly selected cache nodes,
188
188
// and hashes that to compute a single dataset node.
189
189
func generateDatasetItem (cache []uint32 , index uint32 , keccak512 hasher ) []byte {
190
- // Calculate the number of thoretical rows (we use one buffer nonetheless)
190
+ // Calculate the number of theoretical rows (we use one buffer nonetheless)
191
191
rows := uint32 (len (cache ) / hashWords )
192
192
193
193
// Initialize the mix
@@ -287,7 +287,7 @@ func generateDataset(dest []uint32, epoch uint64, cache []uint32) {
287
287
// hashimoto aggregates data from the full dataset in order to produce our final
288
288
// value for a particular header hash and nonce.
289
289
func hashimoto (hash []byte , nonce uint64 , size uint64 , lookup func (index uint32 ) []uint32 ) ([]byte , []byte ) {
290
- // Calculate the number of thoretical rows (we use one buffer nonetheless)
290
+ // Calculate the number of theoretical rows (we use one buffer nonetheless)
291
291
rows := uint32 (size / mixBytes )
292
292
293
293
// Combine header+nonce into a 64 byte seed
0 commit comments