Wladimir [ARCHIVE] on Nostr: 📅 Original date posted:2014-06-18 📝 Original message:On Tue, Jun 17, 2014 at ...
📅 Original date posted:2014-06-18
📝 Original message:On Tue, Jun 17, 2014 at 9:23 AM, Peter Todd <pete at petertodd.org> wrote:
> For my replace-by-fee implementation(1) I used service bit 26 to let
> preferential peering work so that replace-by-fee nodes could easily find
> each other. Of course, that's a temporary/experimental usage that can be
> dropped after wider adoption, so I included the following comment:
>
> // Reserve 24-31 for temporary experiments
> NODE_REPLACE_BY_FEE = (1 << 26)
>
> Service bits are never a guaranteed thing anyway, so occasional
> collisions can and should be tolerated by applications using these
> experimental service bits.
Anyhow -- back to the original proposal. I'm fine with setting aside
part of the service bit space for experiments.
Wladimir
📝 Original message:On Tue, Jun 17, 2014 at 9:23 AM, Peter Todd <pete at petertodd.org> wrote:
> For my replace-by-fee implementation(1) I used service bit 26 to let
> preferential peering work so that replace-by-fee nodes could easily find
> each other. Of course, that's a temporary/experimental usage that can be
> dropped after wider adoption, so I included the following comment:
>
> // Reserve 24-31 for temporary experiments
> NODE_REPLACE_BY_FEE = (1 << 26)
>
> Service bits are never a guaranteed thing anyway, so occasional
> collisions can and should be tolerated by applications using these
> experimental service bits.
Anyhow -- back to the original proposal. I'm fine with setting aside
part of the service bit space for experiments.
Wladimir