mirror of
https://git.wownero.com/wownero/RandomWOW.git
synced 2024-12-22 07:48:54 +00:00
Updated readme with RandomX Sniffer
This commit is contained in:
parent
65fae68287
commit
e3561d661e
@ -63,6 +63,8 @@ RandomX was primarily designed as a PoW algorithm for [Monero](https://www.getmo
|
|||||||
* The key `K` is selected to be the hash of a block in the blockchain - this block is called the 'key block'. For optimal mining and verification performance, the key should change every 2048 blocks (~2.8 days) and there should be a delay of 64 blocks (~2 hours) between the key block and the change of the key `K`. This can be achieved by changing the key when `blockHeight % 2048 == 64` and selecting key block such that `keyBlockHeight % 2048 == 0`.
|
* The key `K` is selected to be the hash of a block in the blockchain - this block is called the 'key block'. For optimal mining and verification performance, the key should change every 2048 blocks (~2.8 days) and there should be a delay of 64 blocks (~2 hours) between the key block and the change of the key `K`. This can be achieved by changing the key when `blockHeight % 2048 == 64` and selecting key block such that `keyBlockHeight % 2048 == 0`.
|
||||||
* The input `H` is the standard hashing blob with a selected nonce value.
|
* The input `H` is the standard hashing blob with a selected nonce value.
|
||||||
|
|
||||||
|
RandomX was successfully activated on the Monero network on the 30th November 2019.
|
||||||
|
|
||||||
If you wish to use RandomX as a PoW algorithm for your cryptocurrency, please follow the [configuration guidelines](doc/configuration.md).
|
If you wish to use RandomX as a PoW algorithm for your cryptocurrency, please follow the [configuration guidelines](doc/configuration.md).
|
||||||
|
|
||||||
**Note**: To achieve ASIC resistance, the key `K` must change and must not be miner-selectable. We recommend to use blockchain data as the key in a similar way to the Monero example above. If blockchain data cannot be used for some reason, use a predefined sequence of keys.
|
**Note**: To achieve ASIC resistance, the key `K` must change and must not be miner-selectable. We recommend to use blockchain data as the key in a similar way to the Monero example above. If blockchain data cannot be used for some reason, use a predefined sequence of keys.
|
||||||
@ -108,7 +110,12 @@ Most Intel and AMD CPUs made since 2011 should be fairly efficient at RandomX. M
|
|||||||
* DDR4 memory is limited to about 4000-6000 H/s per channel (depending on frequency and timings)
|
* DDR4 memory is limited to about 4000-6000 H/s per channel (depending on frequency and timings)
|
||||||
|
|
||||||
### Does RandomX facilitate botnets/malware mining or web mining?
|
### Does RandomX facilitate botnets/malware mining or web mining?
|
||||||
Efficient mining requires more than 2 GiB of memory, which is difficult to hide in an infected computer and disqualifies many low-end machines such as IoT devices. Web mining is infeasible due to the large memory requirement and the lack of directed rounding support for floating point operations in both Javascript and WebAssembly.
|
|
||||||
|
Due to the way the algorithm works, mining malware is much easier to detect. [RandomX Sniffer](https://github.com/tevador/randomx-sniffer) is a proof of concept tool that can detect illicit mining activity on Windows.
|
||||||
|
|
||||||
|
Efficient mining requires more than 2 GiB of memory, which also disqualifies many low-end machines such as IoT devices, which are often parts of large botnets.
|
||||||
|
|
||||||
|
Web mining is infeasible due to the large memory requirement and the lack of directed rounding support for floating point operations in both Javascript and WebAssembly.
|
||||||
|
|
||||||
### Since RandomX uses floating point math, does it give reproducible results on different platforms?
|
### Since RandomX uses floating point math, does it give reproducible results on different platforms?
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user