Have read that the complexity of #Bitcoin PoW function is "O(2^(log n) / n)" because number of nonces you need to try is relative to the number of nonces that give a difficulty less than difficulty you are currently at.
What that means & why it matters?
Could someone explain it to me ?
Komi_Hartman /
npub1s8…07p4z
2023-04-24 12:32:33
Author Public Key
npub1s8fcg6f3xzyveeft32rqwywzre6q3pszs6ansd9y6a86kutumchqa07p4zPublished at
2023-04-24 12:32:33Event JSON
{
"id": "1bc44e8db6da2c2276dfff6f23a353e91a075ac6f32e206ab8929483c7bd2500",
"pubkey": "81d38469313088cce52b8a860711c21e7408860286bb3834a4d74fab717cde2e",
"created_at": 1682339553,
"kind": 1,
"tags": [
[
"t",
"bitcoin"
]
],
"content": "Have read that the complexity of #Bitcoin PoW function is \"O(2^(log n) / n)\" because number of nonces you need to try is relative to the number of nonces that give a difficulty less than difficulty you are currently at.\n\nWhat that means \u0026 why it matters? \n\nCould someone explain it to me ? ",
"sig": "0f5a7b87f78238486f49c89863b8886d76dfdf99f4c92c0337854e428eb3aa11bb755da35ecb3f388c73a0bdf61e6c161f8b62ae814b6447e3007396972d4f67"
}