Komi_Hartman on Nostr: I have read that the "complexity" of the bitcoin "proof of work" function is: ...
I have read that the "complexity" of the bitcoin "proof of work" function is: O(2^(log n) / n) because the number of nonces you need to try is proportional to the number of nonces that give a difficulty less than the difficulty you are currently at.
But I’m not sure what that means or why it matters.
Could someone explain it to me ?
Published at
2023-01-20 16:07:53Event JSON
{
"id": "62a96ecea3c1163702a75ba70c9d85542a1094be6892d3b3b47c8245b550c765",
"pubkey": "81d38469313088cce52b8a860711c21e7408860286bb3834a4d74fab717cde2e",
"created_at": 1674230873,
"kind": 1,
"tags": [],
"content": "I have read that the \"complexity\" of the bitcoin \"proof of work\" function is: O(2^(log n) / n) because the number of nonces you need to try is proportional to the number of nonces that give a difficulty less than the difficulty you are currently at.\n\nBut I’m not sure what that means or why it matters. \n\nCould someone explain it to me ?",
"sig": "23492d51d7f003f6d972e8f0b714cb83954b0bc29d5ffe53baedf3be36f9f7b017e811f9ebe591eba895e9d914b7820abe16bb717208cddaac964f93643b8b9e"
}
