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.
📝 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.