📅 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
Wladimir [ARCHIVE] /
npub1xq…ymc2p
2023-06-07 15:22:58
in reply to nevent1q…52ec
Author Public Key
npub1xqshkqv2g7uea4xzqwvmgjcz7u8vfavw6aazs999v0azsv3w7u3qpymc2pPublished at
2023-06-07 15:22:58Event JSON
{
"id": "ae26a7adc9c80448deccc0207ed4dac2293a287109b2e27221bd4a043aef935a",
"pubkey": "30217b018a47b99ed4c20399b44b02f70ec4f58ed77a2814a563fa28322ef722",
"created_at": 1686151378,
"kind": 1,
"tags": [
[
"e",
"51755e520e5fac5e694b75add8f1aed031a6d31795ec0eb481e5e52e0d57e975",
"",
"root"
],
[
"e",
"66c9afcf4be3ef03607219a081437008786c1393ee390403b02f6db81e2c0246",
"",
"reply"
],
[
"p",
"30217b018a47b99ed4c20399b44b02f70ec4f58ed77a2814a563fa28322ef722"
]
],
"content": "📅 Original date posted:2014-06-18\n📝 Original message:On Tue, Jun 17, 2014 at 9:23 AM, Peter Todd \u003cpete at petertodd.org\u003e wrote:\n\u003e For my replace-by-fee implementation(1) I used service bit 26 to let\n\u003e preferential peering work so that replace-by-fee nodes could easily find\n\u003e each other. Of course, that's a temporary/experimental usage that can be\n\u003e dropped after wider adoption, so I included the following comment:\n\u003e\n\u003e // Reserve 24-31 for temporary experiments\n\u003e NODE_REPLACE_BY_FEE = (1 \u003c\u003c 26)\n\u003e\n\u003e Service bits are never a guaranteed thing anyway, so occasional\n\u003e collisions can and should be tolerated by applications using these\n\u003e experimental service bits.\n\nAnyhow -- back to the original proposal. I'm fine with setting aside\npart of the service bit space for experiments.\n\nWladimir",
"sig": "10839e48650cee6b92e802729814f13718991fac83139973cf23e49635f9a16021c6eb7f5d517e80ba640f3a56531c29ed747a52f4f461efa808b9b965b122fd"
}