Hi. why does bitcoin have a vulnerability in time? why is the algorithm not perfect?
why the number of nons that miners are looking for is limited in size? these parameters can expose bitcoin to a huge fork. what i mean. a small miner can mine bitcoin for example have 1-10% of the network from 4-40 exasheh of the entire network.
and when a block is found, not to send it to the network, and hold the solution of a new block for a while, and the new solved hash should be used to find a new block. for example, to find a block and leave the ready answer for 10 seconds and start looking for a new block, say, mine for the future. and after finding the first one to send then the second, with a difference of 9 seconds. and it does not contradict the rules. but you can go longer and divide miners to search each non separately. that is, 1 miner looking for this number in the range from 0-1000 second from 1001-2000 third 2001-3000 and so on it's a matter of luck)
Of course the solution is to shift the time in the algorithm. it will remove this glitch or bug, or whatever it is called ...
$elfish gene
npub1p5…srvet
2023-06-14 09:26:54
in reply to nevent1q…apd3
Author Public Key
npub1p59ss03a6wfn38njtljzhfvvdayyu4lawz8l0crafhqa8cxj27jqssrvetPublished at
2023-06-14 09:26:54Event JSON
{
"id": "66bb9b07e1f71b29d1fa0bb7b1569ea7c5f9c1c42a02e920f106b31b9a06a2ac",
"pubkey": "0d0b083e3dd393389e725fe42ba58c6f484e57fd708ff7e07d4dc1d3e0d257a4",
"created_at": 1686734814,
"kind": 1,
"tags": [
[
"e",
"59267b0f92e0dc622fe0829f0adf264e47714fea73fc8902e910a43db97c708f",
"",
"root"
],
[
"p",
"2c1a3e122beeb04d22815f650bfed597be4d2e6d71e3013efa2d59468caf6cf9"
]
],
"content": "Hi. why does bitcoin have a vulnerability in time? why is the algorithm not perfect? \nwhy the number of nons that miners are looking for is limited in size? these parameters can expose bitcoin to a huge fork. what i mean. a small miner can mine bitcoin for example have 1-10% of the network from 4-40 exasheh of the entire network.\nand when a block is found, not to send it to the network, and hold the solution of a new block for a while, and the new solved hash should be used to find a new block. for example, to find a block and leave the ready answer for 10 seconds and start looking for a new block, say, mine for the future. and after finding the first one to send then the second, with a difference of 9 seconds. and it does not contradict the rules. but you can go longer and divide miners to search each non separately. that is, 1 miner looking for this number in the range from 0-1000 second from 1001-2000 third 2001-3000 and so on it's a matter of luck)\nOf course the solution is to shift the time in the algorithm. it will remove this glitch or bug, or whatever it is called ...",
"sig": "1852c0451d520d22cb22b9891167313ad31a3566125b9a034006a65dc39823a179439a7286864f4d00945a71e956b1b04e96573a87cf1000f44c51cc497f855c"
}