📅 Original date posted:2015-09-25
📝 Original message:
On Fri, Sep 25, 2015 at 09:56:02AM +0930, Rusty Russell wrote:
> [ Pieter Wuille Cc'd for pubkey recovery, search for "recovered" ]
> Mats Jerratsch <matsjj at gmail.com> writes:
> >> Indeed. Random selection helps, here, but analysis will be interesting.
> > How have you ended up with a number of beacons you need? 12 seems so
> > low, I can’t imagine so few nodes to support all transacting for even
> > 10 minutes..
> As we keep the last 100 sets of beacons, the load is spread a little.
Does that actually work? Old beacons don't do any good if the payee
doesn't use them when advertising a route; but old beacons also don't
get their fee updates propogated, and aren't known by people who only
just joined the network. I don't think you could usefully keep more than
the last 2 or 3 sets of beacons?
> To start, I was thinking you establish channels with 5 random nodes.
I think Barabasi-Albert graphs are probably pretty reasonable here --
you start by establishing channels to N nodes, selected randomly but
favouring nodes in proportion to how connected they already are.
https://en.wikipedia.org/wiki/Barab%C3%A1si%E2%80%93Albert_model
Cheers,
aj
Anthony Towns [ARCHIVE] /
npub17r…x9l2h
2023-06-09 12:44:35
in reply to nevent1q…cg3h
Author Public Key
npub17rld56k4365lfphyd8u8kwuejey5xcazdxptserx03wc4jc9g24stx9l2hPublished at
2023-06-09 12:44:35Event JSON
{
"id": "edcedc66d7ba9c30321ff66cc65107d73a8390215b34f38364e0b2afb3d81e19",
"pubkey": "f0feda6ad58ea9f486e469f87b3b9996494363a26982b864667c5d8acb0542ab",
"created_at": 1686314675,
"kind": 1,
"tags": [
[
"e",
"d508e26ae44d949f7c534399c4b1e4f82df043bc5ea4ea4a1d4d81571bfaec45",
"",
"root"
],
[
"e",
"8e8392a06857d03fecbc3ca8f46b456442870901e6c3e68595a8762284585b04",
"",
"reply"
],
[
"p",
"5cb21bf5d7f25a9d46879713cbd32433bbc10e40ef813a3c28fe7355f49854d6"
]
],
"content": "📅 Original date posted:2015-09-25\n📝 Original message:\nOn Fri, Sep 25, 2015 at 09:56:02AM +0930, Rusty Russell wrote:\n\u003e [ Pieter Wuille Cc'd for pubkey recovery, search for \"recovered\" ]\n\u003e Mats Jerratsch \u003cmatsjj at gmail.com\u003e writes:\n\u003e \u003e\u003e Indeed. Random selection helps, here, but analysis will be interesting.\n\u003e \u003e How have you ended up with a number of beacons you need? 12 seems so\n\u003e \u003e low, I can’t imagine so few nodes to support all transacting for even\n\u003e \u003e 10 minutes..\n\u003e As we keep the last 100 sets of beacons, the load is spread a little.\n\nDoes that actually work? Old beacons don't do any good if the payee\ndoesn't use them when advertising a route; but old beacons also don't\nget their fee updates propogated, and aren't known by people who only\njust joined the network. I don't think you could usefully keep more than\nthe last 2 or 3 sets of beacons?\n\n\u003e To start, I was thinking you establish channels with 5 random nodes.\n\nI think Barabasi-Albert graphs are probably pretty reasonable here --\nyou start by establishing channels to N nodes, selected randomly but\nfavouring nodes in proportion to how connected they already are.\n\nhttps://en.wikipedia.org/wiki/Barab%C3%A1si%E2%80%93Albert_model\n\nCheers,\naj",
"sig": "5bb14c5bf4c2de54ae8ae31a6f5fb4f722560b5b8355e00cf412d591cab2ec795de1ad0a52122814e239436137346731027d783cd21ccb78a9749ca82d27361d"
}