[Lightning-dev] Ionization Protocol: Flood Routing
matsjj at gmail.com
Wed Sep 23 07:56:08 UTC 2015
> 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.. And it’s very difficult to estimate how much bitcoin they might need for that timeframe, as some people might want to transact only few satoshi, while others send multiple bitcoin. We can abstract the network towards two nodes at each end and N beacon nodes in the middle doing all the transacting. The two nodes at either side are separate networks then, which need to figure out their own routing.
Furthermore, I don’t really see the big advantage in this scheme. We still need to find a route towards these beacons, and often one might not be interested in the cheapest one, but would want to add more privacy. I think propagating the node-map is pretty efficient in general…
> Short term I'm thinking we'll have an IRC channel (a-la early bitcoin)
> and everyone will advertise their channels there. This is design for
> the next, more ambitious phase.
Hm I think this would be a wasted effort. While there are probably good libraries to do the job out there, it would still need some implementation. As soon as we can solve the node discovery (and if we want to go with a central server, we might just as well hard-code some reliable nodes into the code for now), we can communicate over the network..
>> Furthermore, we can also include
>> some byte for a reputation / web-of-trust system. It is completely
>> optional, if you are able to figure out how to route the payment
>> across your nodes you are not forced to use this system, and I don't
>> think it will have severe privacy problems.
> I think reputation systems will become an overlay, if the basic system
> proves vulnerable. It's nicer if we don't have to though, as reputation
> is both hard to encode in normal behaviour, and deeply centralizing.
Yea centralisation is an issue with reputation, we might want to have it rather limited. Have it some way, such that there isn’t much difference between a big node that has been around for long and a relatively new node, as long as both are
(1) low latency
(2) highly available
>> Is there any plan how we handle connections currently? I am thinking
>> about sending the current IP address with this update, such that nodes
>> can connect to each other after one broke down again, and it would
>> further support dynamic IPs as well. Could be possible to extend this
>> to hidden service notation, although this would need some more bytes
>> to store.
> So, I'm assuming the basic network comms is organized along channel
> lines; you have to communicate to the other end of the channel anyway,
> so that makes sense.
> This doesn't solve "how do I connect to the network" or "how do I start
> a channel with this particular node", though. For that, I've floated
> the idea of reusing the bittorrent DHT, which has extensions to allow
> just this.
Yea exactly, we can squeeze these information in there. The packages are very small. If we end up in a situation where they impede the payment transactions, we might want to have some priority mechanism..
The ‘how to connect to the network’ can be solved with basic peer discovery schemes, like IRC or stable-nodes. Having received the topology of the mesh, you can decide which nodes you want to create a channel with (maybe we should add a flag somewhere, whether this node wants to open a channel with strangers and under which conditions). He can directly connect to that node and open a channel with him, or am I missing something?
> You can squeze some more bytes out of you want:
> 1) Signature should be 64 bytes (never DER encode).
> 2) Pubkey can be hashed bitcoin-address style, and recovered from sig.
You can recover the pubkey from the hash and the sig? Why are we putting the pubkey in the scriptSig then? ;)
> If we're using protobufs, they're extensible, so you can add reputation
> later if we need it.
> You also want two signatures, I think: one from each side. Though it
> makes sense to have a separate teardown message which only needs one
Yea was thinking about this as well, I thought as both nodes will propagate their own message, other nodes can puzzle it out, whether the channel has been confirmed by both parties. It saves one signature too..
>> These two would be spread as one message.
>> This allows to keep two separate databases, and be able to bootstrap
>> new nodes with this information, while we do not have to store old
>> beacon data.
>> As reputation will be stored for quite some time, we should really
>> save them with separate signatures. (This will make it more difficult
>> / costly to share the complete database with new nodes, and we need to
>> store old data (reputation should be stored for some time) to validate
>> the signatures.
> Unclear what reputation means, here?
I was thinking about storing reputation for some time for all nodes. I’m not sure this is a good idea anymore, as it may lead to some amount of centralization.. It would be beneficial in this case to have the reputation data along with the signature only, to be efficient. That way you can always recover the reputation data of all nodes of the network for a new node, as you can send along all signatures..
> BTW I've not been separating nodes and clients in my head-design. Of
> course, some nodes might not ever generate payments, and some nodes
> might never route others' payments, but it increases privacy vastly if
> they *can*, so I'm trying to think about them that way.
For me it is more a connection issue. Nodes should have a 99+% uptime and allow for direct incoming connections. Still have to figure it out, but of course as a node provider you can always issue a payment directly (I think for any outsider, there is no difference between the node issuing the payment or some client connected to that node)
> Yes, reputation is hard.
> What do you think about the idea of using the anchor transactions in the
> blockchain as a map of the network? You could use an OP_RETURN to stash
> two pubkeysx, that is the two node IDs.
Hm isn’t this difficult to prove? Anyone could have put those pubkeys in there, so unless we further put a signature in there, this information holds little value I think.. I like the idea in general, as it would make fake-nodes more difficult, but I think it is difficult to implement in the bitcoin blockchain. Furthermore, how do you plan to have the scriptPubKey for the anchor tx then? Ultimately it is still P2SH, so no one is really able to recover any data from it..
As a plus, I am currently working on some simulation project for lightning. A lot of the metrics are very difficult to estimate (let alone calculate), and often we want to depend on random selection. We will be able to deduct a lot of properties from it, and be able to determine, whether we need something like the reputation system at all, and how many dishonest nodes it takes for some attacks, and how efficient routing is, all the good stuff...
PS.: This was the last time I opened a new thread incidentally -.- Just disabled the digest option… ;) Sorry for the inconvenience...
More information about the Lightning-dev