i have worked with proof of work algorithms for a lot of the last 7 years and i know what i'm talking about when i say it can vary very widely
i even devised mechanisms to reduce that variance by quite a lot (using harmonics and multiple parallel targets and such) but it still only was a factor of maybe 10 reduction in variance for solution computation time, and it was an increase in the verification cost and that reduces the security, i think
the whole point is that the cost of computing it has a probable high time cost versus the verification
mleku / mleku™️
npub1fjq…leku
2024-07-04 15:24:27
in reply to nevent1q…ucdd
Author Public Key
npub1fjqqy4a93z5zsjwsfxqhc2764kvykfdyttvldkkkdera8dr78vhsmmlekuPublished at
2024-07-04 15:24:27Event JSON
{
"id": "c88997a12775d3dfef8cf2b2aacf224c454a35f689c41a9e2e6862dc54415161",
"pubkey": "4c800257a588a82849d049817c2bdaad984b25a45ad9f6dad66e47d3b47e3b2f",
"created_at": 1720099467,
"kind": 1,
"tags": [
[
"e",
"fd36982f0e784b18ae7fc279779020cc1e4a6e0bfa73be3996e0d8aa10329a56",
"wss://nproxy.kristapsk.lv/",
"root"
],
[
"e",
"78443e09fba501b0f4c6cf1fbc2f3933ca7e546f52bd2619114461c70710ed57",
"",
"reply"
],
[
"p",
"2755b492fbb0ffa5c327819a4699c7001341b9f7826a8367273549f1a58a4831",
"",
"mention"
]
],
"content": "i have worked with proof of work algorithms for a lot of the last 7 years and i know what i'm talking about when i say it can vary very widely\n\ni even devised mechanisms to reduce that variance by quite a lot (using harmonics and multiple parallel targets and such) but it still only was a factor of maybe 10 reduction in variance for solution computation time, and it was an increase in the verification cost and that reduces the security, i think\n\nthe whole point is that the cost of computing it has a probable high time cost versus the verification",
"sig": "0ccb76b39cb2b751e52a97c2dd4a218bb2923b260501815cb3bc38f59428d68f0b8e7e37bc19c93ddbcea50836d56f03b6a2a8d3a9350742226244a83d73ddd2"
}