algorithm_go1.7.go 2.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
  1. // Copyright 2017 The go-ethereum Authors
  2. // This file is part of the go-ethereum library.
  3. //
  4. // The go-ethereum library is free software: you can redistribute it and/or modify
  5. // it under the terms of the GNU Lesser General Public License as published by
  6. // the Free Software Foundation, either version 3 of the License, or
  7. // (at your option) any later version.
  8. //
  9. // The go-ethereum library is distributed in the hope that it will be useful,
  10. // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. // GNU Lesser General Public License for more details.
  13. //
  14. // You should have received a copy of the GNU Lesser General Public License
  15. // along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
  16. // +build !go1.8
  17. package ethash
  18. // cacheSize calculates and returns the size of the ethash verification cache that
  19. // belongs to a certain block number. The cache size grows linearly, however, we
  20. // always take the highest prime below the linearly growing threshold in order to
  21. // reduce the risk of accidental regularities leading to cyclic behavior.
  22. func cacheSize(block uint64) uint64 {
  23. // If we have a pre-generated value, use that
  24. epoch := int(block / epochLength)
  25. if epoch < len(cacheSizes) {
  26. return cacheSizes[epoch]
  27. }
  28. // We don't have a way to verify primes fast before Go 1.8
  29. panic("fast prime testing unsupported in Go < 1.8")
  30. }
  31. // datasetSize calculates and returns the size of the ethash mining dataset that
  32. // belongs to a certain block number. The dataset size grows linearly, however, we
  33. // always take the highest prime below the linearly growing threshold in order to
  34. // reduce the risk of accidental regularities leading to cyclic behavior.
  35. func datasetSize(block uint64) uint64 {
  36. // If we have a pre-generated value, use that
  37. epoch := int(block / epochLength)
  38. if epoch < len(datasetSizes) {
  39. return datasetSizes[epoch]
  40. }
  41. // We don't have a way to verify primes fast before Go 1.8
  42. panic("fast prime testing unsupported in Go < 1.8")
  43. }