📅 Original date posted:2019-05-24
📝 Original message:On Thu, May 23, 2019 at 9:58 PM Pieter Wuille via bitcoin-dev <
bitcoin-dev at lists.linuxfoundation.org> wrote:
> If the difficulty can be directly observed by the script language, you
> would need to re-evaluate all scripts in unconfirmed transactions
> whenever the difficulty changes. This complicates implementation of
> mempools, but it also makes reasoning about validity of (chains of)
> unconfirmed transactions harder, as an unconfirmed predecessor may
> have conditions that change over time.
To deal with potentially wildly varying difficulty, could the value exposed
be the sum of accumulated PoW, or in other words the sum of each block's
difficulty value in the entire chain? This should be a value that will only
rise unless a reorg happens after a difficulty drop happens (only likely to
be the result of users manually blacklisting an otherwise valid block that
is several blocks back in the chain).
This mimics the effect of the block number which only grows. So if you're
starting at time A with difficulty X, then you'd estimate what you think
the accumulated PoW ought to be at time B with expected difficulty Y (as
compared to the current value at time A), and put that value into the
script.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20190524/2cdfd6bc/attachment.html>;
Natanael [ARCHIVE] /
npub179…lpmjt
2023-06-07 18:18:15
in reply to nevent1q…9l78
Author Public Key
npub1798ncudyucap9jzzujjsgufx8tdykm8auzfledjcs6f6wf4ekqvq8lpmjtPublished at
2023-06-07 18:18:15Event JSON
{
"id": "db0b481b0e912f79bc6aaf28cf75355f78eb12c654ff597fa0907fb1d0605f75",
"pubkey": "f14f3c71a4e63a12c842e4a50471263ada4b6cfde093fcb6588693a726b9b018",
"created_at": 1686161895,
"kind": 1,
"tags": [
[
"e",
"b72b1e530f79fa4fb81932af44198e28a4dcc369f9d5dfdf733984b5542ef714",
"",
"root"
],
[
"e",
"d8d632b5e17de27dde22fb3f528397ee7e0fd1d81ff3b34bfa2f6a9c16010224",
"",
"reply"
],
[
"p",
"c632841665fccdabf021322b1d969539c9c1f829ceed38844fea24e8512962d7"
]
],
"content": "📅 Original date posted:2019-05-24\n📝 Original message:On Thu, May 23, 2019 at 9:58 PM Pieter Wuille via bitcoin-dev \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\n\u003e If the difficulty can be directly observed by the script language, you\n\u003e would need to re-evaluate all scripts in unconfirmed transactions\n\u003e whenever the difficulty changes. This complicates implementation of\n\u003e mempools, but it also makes reasoning about validity of (chains of)\n\u003e unconfirmed transactions harder, as an unconfirmed predecessor may\n\u003e have conditions that change over time.\n\n\nTo deal with potentially wildly varying difficulty, could the value exposed\nbe the sum of accumulated PoW, or in other words the sum of each block's\ndifficulty value in the entire chain? This should be a value that will only\nrise unless a reorg happens after a difficulty drop happens (only likely to\nbe the result of users manually blacklisting an otherwise valid block that\nis several blocks back in the chain).\n\nThis mimics the effect of the block number which only grows. So if you're\nstarting at time A with difficulty X, then you'd estimate what you think\nthe accumulated PoW ought to be at time B with expected difficulty Y (as\ncompared to the current value at time A), and put that value into the\nscript.\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20190524/2cdfd6bc/attachment.html\u003e",
"sig": "b669a9a1b6afccd45b15354efc8c073d20b6425f3799c75d62ee1a69a7b973b01ec33da2a52b962087e275f9fad354c639af3fc13b52418ed2ee54fb967a3d52"
}