Andy Parkins [ARCHIVE] on Nostr: 📅 Original date posted:2011-11-23 🗒️ Summary of this message: Nodes generate ...

📅 Original date posted:2011-11-23
🗒️ Summary of this message: Nodes generate the most difficult block they can, while listening for the most difficult block generated before time T, with T being the block generation rate.
📝 Original message:On 2011 November 23 Wednesday, Jorge Timón wrote:
> 2011/11/23, Andy Parkins <andyparkins at gmail.com>:
> > Let's abandon the idea of a target difficulty. Instead, every node just
> >
> > generates the most difficulty block it can. Simultaneously, every node
> > is listening for "the most difficult block generated before time T";
> > with T being
> > picked to be the block generation rate (10 minutes).
>
> A miner could try to obtain more difficulty out of time and cheat its
> reported datetime (T).

Just as with the current system.

The defence is that on receipt of a block, its timestamp is checked against
the node's own clock and averaged network clock. Blocks out of that band are
rejected.


Andy
--
Dr Andy Parkins
andyparkins at gmail.com
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 198 bytes
Desc: This is a digitally signed message part.
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20111123/87748873/attachment.sig>;