Tom Harding [ARCHIVE] on Nostr: 📅 Original date posted:2015-03-26 📝 Original message:On 3/25/2015 12:22 PM, ...
📅 Original date posted:2015-03-26
📝 Original message:On 3/25/2015 12:22 PM, Gregory Maxwell wrote:
>
> Verification with duplicate elimination requires O(N) storage (with N
> being the length of the history), since you need to track all the
> duplicates to reject.
>
I addressed that by limiting the duplicate check to an X-block segment.
X is hard-coded in this simple scheme (X=144 => "1-day addresses").
You could picture a selectable expiration duration too.
Published at
2023-06-07 15:32:13Event JSON
{
"id": "0b34a8bb0354240a54ca96eb90a824e1ce402e6ef7738570e6353ed4034367b6",
"pubkey": "dc329a02c970aabf03b87185ef51c86afe4586fe3a148508af898af3fabc56a3",
"created_at": 1686151933,
"kind": 1,
"tags": [
[
"e",
"13ba2dac7eec5154e8f99682c168a8cede79e5ef5e0b1fe726762657ed73749d",
"",
"root"
],
[
"e",
"f83d2a9f014d57762d85a3f889c59a4e123f0912a34790929010415a951156e8",
"",
"reply"
],
[
"p",
"4aa6cf9aa5c8e98f401dac603c6a10207509b6a07317676e9d6615f3d7103d73"
]
],
"content": "📅 Original date posted:2015-03-26\n📝 Original message:On 3/25/2015 12:22 PM, Gregory Maxwell wrote:\n\u003e\n\u003e Verification with duplicate elimination requires O(N) storage (with N\n\u003e being the length of the history), since you need to track all the\n\u003e duplicates to reject.\n\u003e\n\nI addressed that by limiting the duplicate check to an X-block segment. \nX is hard-coded in this simple scheme (X=144 =\u003e \"1-day addresses\"). \nYou could picture a selectable expiration duration too.",
"sig": "0a444d87247b28a999469d9543cb185829613e3ac1138f2b594960b03d6c318e275de370a053a8961646fcc55aed312e942dd04fda725f8894a89c9fd6b8758e"
}