Ant routing for the Lightning Network (with C. Grunspan) Ricardo P - - PowerPoint PPT Presentation

ant routing for the lightning network with c grunspan
SMART_READER_LITE
LIVE PREVIEW

Ant routing for the Lightning Network (with C. Grunspan) Ricardo P - - PowerPoint PPT Presentation

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN Ant routing for the Lightning Network (with C. Grunspan) Ricardo P erez-Marco @rperezmarco webusers.imj-prg.fr/ ricardo.perez-marco CNRS,


slide-1
SLIDE 1

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ant routing for the Lightning Network (with C. Grunspan)

Ricardo P´ erez-Marco @rperezmarco webusers.imj-prg.fr/∼ricardo.perez-marco CNRS, IMJ-PRG, Univ. Paris 7 Building on Bitcoin Lisbon ArXiv:1807.00151 (July 2018)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-2
SLIDE 2

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ant routing for the Lightning Network

1

Decentralized Networks

2

Lightning Network.

3

Biological ant routing

4

Basic ant routing for LN

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-3
SLIDE 3

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ant routing for the Lightning Network

1

Decentralized Networks

2

Lightning Network.

3

Biological ant routing

4

Basic ant routing for LN

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-4
SLIDE 4

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

The Lightning Network.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-5
SLIDE 5

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

The Lightning Network.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-6
SLIDE 6

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-7
SLIDE 7

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization:

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-8
SLIDE 8

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-9
SLIDE 9

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-10
SLIDE 10

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-11
SLIDE 11

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-12
SLIDE 12

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e Nodes follow the same protocol. ´ Egalit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-13
SLIDE 13

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e Nodes follow the same protocol. ´ Egalit´ e Ownership of nodes is well distributed. Diversit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-14
SLIDE 14

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e Nodes follow the same protocol. ´ Egalit´ e Ownership of nodes is well distributed. Diversit´ e Richly connected (thousands nodes). Diversit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-15
SLIDE 15

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e Nodes follow the same protocol. ´ Egalit´ e Ownership of nodes is well distributed. Diversit´ e Richly connected (thousands nodes). Diversit´ e Randomly connected. Diversit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-16
SLIDE 16

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e Nodes follow the same protocol. ´ Egalit´ e Ownership of nodes is well distributed. Diversit´ e Richly connected (thousands nodes). Diversit´ e Randomly connected. Diversit´ e All nodes check the information shared. V´ erificabilit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-17
SLIDE 17

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Libert´ e, ´ Egalit´ e, Diversit´ e, V´ erificabilit´ e

Necessary conditions for decentralization: Open and affordable access to the network. Libert´ e Nodes can process the information they want. Libert´ e Nodes have access to the same information. ´ Egalit´ e Nodes have the same power. ´ Egalit´ e Nodes follow the same protocol. ´ Egalit´ e Ownership of nodes is well distributed. Diversit´ e Richly connected (thousands nodes). Diversit´ e Randomly connected. Diversit´ e All nodes check the information shared. V´ erificabilit´ e Nobody trusts anyone, everyone verifies. V´ erificabilit´ e

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-18
SLIDE 18

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-19
SLIDE 19

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-20
SLIDE 20

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-21
SLIDE 21

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-22
SLIDE 22

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-23
SLIDE 23

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • Maximal volume.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-24
SLIDE 24

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • Maximal volume.
  • Instantaneous and anonymous (unrecorded) transactions.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-25
SLIDE 25

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • Maximal volume.
  • Instantaneous and anonymous (unrecorded) transactions.
  • Payment channels are composable (transitive property).
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-26
SLIDE 26

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • Maximal volume.
  • Instantaneous and anonymous (unrecorded) transactions.
  • Payment channels are composable (transitive property).

If Alice and Bob have a payment channel, and Bob and Charles have another, then Alice can pay Charles through Bob.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-27
SLIDE 27

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • Maximal volume.
  • Instantaneous and anonymous (unrecorded) transactions.
  • Payment channels are composable (transitive property).

If Alice and Bob have a payment channel, and Bob and Charles have another, then Alice can pay Charles through Bob.

  • Fee incentive for intermediaries.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-28
SLIDE 28

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Payment channels

  • Payment channels: Allow off-chain transactions.
  • One Initial Commitment Transaction and one Settlement

Transaction are the only on-chain transactions.

  • Unidirectional or bidirectional payment channels.

Constraints and properties

  • Maximal volume.
  • Instantaneous and anonymous (unrecorded) transactions.
  • Payment channels are composable (transitive property).

If Alice and Bob have a payment channel, and Bob and Charles have another, then Alice can pay Charles through Bob.

  • Fee incentive for intermediaries.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-29
SLIDE 29

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-30
SLIDE 30

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-31
SLIDE 31

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • LN network of payment channels (weighted oriented graph).
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-32
SLIDE 32

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • LN network of payment channels (weighted oriented graph).
  • Decentralized network: Rich and randomly connected, etc
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-33
SLIDE 33

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • LN network of payment channels (weighted oriented graph).
  • Decentralized network: Rich and randomly connected, etc
  • On top of the LN network we have a richer and fast

communication network.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-34
SLIDE 34

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • LN network of payment channels (weighted oriented graph).
  • Decentralized network: Rich and randomly connected, etc
  • On top of the LN network we have a richer and fast

communication network.

  • Nodes reserve a mempool space for routing purposes.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-35
SLIDE 35

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • LN network of payment channels (weighted oriented graph).
  • Decentralized network: Rich and randomly connected, etc
  • On top of the LN network we have a richer and fast

communication network.

  • Nodes reserve a mempool space for routing purposes.

Main problem: Decentralized payment path finding algorithm.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-36
SLIDE 36

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

LN set up

(Nakamoto, Hearn, Spilman, Decker, Wattenhofer, Dryja, Poon, Prihodko, Ostrovskyi, Sahno, Zhigulin, Russell, Osuntokun,...)

  • LN network of payment channels (weighted oriented graph).
  • Decentralized network: Rich and randomly connected, etc
  • On top of the LN network we have a richer and fast

communication network.

  • Nodes reserve a mempool space for routing purposes.

Main problem: Decentralized payment path finding algorithm.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-37
SLIDE 37

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-38
SLIDE 38

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-39
SLIDE 39

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • Solutions based on “beacon nodes” with rich routing tables.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-40
SLIDE 40

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • Solutions based on “beacon nodes” with rich routing tables.
  • Beacon nodes or supernodes violate decentralization.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-41
SLIDE 41

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • Solutions based on “beacon nodes” with rich routing tables.
  • Beacon nodes or supernodes violate decentralization.

Some hints:

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-42
SLIDE 42

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • Solutions based on “beacon nodes” with rich routing tables.
  • Beacon nodes or supernodes violate decentralization.

Some hints:

  • Bitcoin network does not use routing tables. Information

(transactions) are propagated to the whole network.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-43
SLIDE 43

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • Solutions based on “beacon nodes” with rich routing tables.
  • Beacon nodes or supernodes violate decentralization.

Some hints:

  • Bitcoin network does not use routing tables. Information

(transactions) are propagated to the whole network.

  • Ant path finding algorithms are efficient and highly

decentralized.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-44
SLIDE 44

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Problems and difficulties

  • Global knowledge of the geometry of the network is a vector
  • f attack.
  • Solutions based on “beacon nodes” with rich routing tables.
  • Beacon nodes or supernodes violate decentralization.

Some hints:

  • Bitcoin network does not use routing tables. Information

(transactions) are propagated to the whole network.

  • Ant path finding algorithms are efficient and highly

decentralized.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-45
SLIDE 45

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ant paths

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-46
SLIDE 46

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ant paths

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-47
SLIDE 47

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-48
SLIDE 48

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-49
SLIDE 49

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-50
SLIDE 50

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-51
SLIDE 51

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • Marking paths with pheromones.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-52
SLIDE 52

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • Marking paths with pheromones.
  • Reinforcing paths with pheromones.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-53
SLIDE 53

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Goss et al. (1989)

  • Marking paths with pheromones.
  • Reinforcing paths with pheromones.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-54
SLIDE 54

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ariadne’s thread

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-55
SLIDE 55

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Ariadne’s thread

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-56
SLIDE 56

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-57
SLIDE 57

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-58
SLIDE 58

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • Alice’s pheromone seed S(A) = 0⌢R.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-59
SLIDE 59

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • Alice’s pheromone seed S(A) = 0⌢R.
  • Bob’s pheromone seed S(B) = 1⌢R.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-60
SLIDE 60

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • Alice’s pheromone seed S(A) = 0⌢R.
  • Bob’s pheromone seed S(B) = 1⌢R.
  • Derived seed: If S = X ⌢R, the derived seed is S′ = R.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-61
SLIDE 61

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • Alice’s pheromone seed S(A) = 0⌢R.
  • Bob’s pheromone seed S(B) = 1⌢R.
  • Derived seed: If S = X ⌢R, the derived seed is S′ = R.
  • Conjugate seed: If S = 0⌢R (resp. S = 1⌢R), the conjugate

seed is ¯ S = 1⌢R (resp. ¯ S = 0⌢R).

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-62
SLIDE 62

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • Alice’s pheromone seed S(A) = 0⌢R.
  • Bob’s pheromone seed S(B) = 1⌢R.
  • Derived seed: If S = X ⌢R, the derived seed is S′ = R.
  • Conjugate seed: If S = 0⌢R (resp. S = 1⌢R), the conjugate

seed is ¯ S = 1⌢R (resp. ¯ S = 0⌢R).

  • Alice, resp. Bob, propagates S(A), resp. S(B), to neighbors.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-63
SLIDE 63

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Pheromone seeds

  • Alice wants to pay Bob. They agree on a common random

number R.

  • Alice’s pheromone seed S(A) = 0⌢R.
  • Bob’s pheromone seed S(B) = 1⌢R.
  • Derived seed: If S = X ⌢R, the derived seed is S′ = R.
  • Conjugate seed: If S = 0⌢R (resp. S = 1⌢R), the conjugate

seed is ¯ S = 1⌢R (resp. ¯ S = 0⌢R).

  • Alice, resp. Bob, propagates S(A), resp. S(B), to neighbors.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-64
SLIDE 64

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-65
SLIDE 65

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • A node that receives a pheromone seed S notes from which

neighbor it arrived and checks if S or ¯ S was received before.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-66
SLIDE 66

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • A node that receives a pheromone seed S notes from which

neighbor it arrived and checks if S or ¯ S was received before.

  • If none was received, it stores S in the mempool and

propagates to other neighbors.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-67
SLIDE 67

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • A node that receives a pheromone seed S notes from which

neighbor it arrived and checks if S or ¯ S was received before.

  • If none was received, it stores S in the mempool and

propagates to other neighbors.

  • If S was already in the mempool but not ¯

S, nothing else needs to be done.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-68
SLIDE 68

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • A node that receives a pheromone seed S notes from which

neighbor it arrived and checks if S or ¯ S was received before.

  • If none was received, it stores S in the mempool and

propagates to other neighbors.

  • If S was already in the mempool but not ¯

S, nothing else needs to be done.

  • If S is not in the mempool but ¯

S is, then a matching occurs. The node constructs the matched seed Sm = 0⌢S(A) and propagates it to the neighbors that send the pheromone seeds S(A) and S(B).

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-69
SLIDE 69

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • A node that receives a pheromone seed S notes from which

neighbor it arrived and checks if S or ¯ S was received before.

  • If none was received, it stores S in the mempool and

propagates to other neighbors.

  • If S was already in the mempool but not ¯

S, nothing else needs to be done.

  • If S is not in the mempool but ¯

S is, then a matching occurs. The node constructs the matched seed Sm = 0⌢S(A) and propagates it to the neighbors that send the pheromone seeds S(A) and S(B).

  • If both S and ¯

S were already in the mempool then the matching occurred earlier and nothing needs to be done.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-70
SLIDE 70

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Propagation and matching

  • A node that receives a pheromone seed S notes from which

neighbor it arrived and checks if S or ¯ S was received before.

  • If none was received, it stores S in the mempool and

propagates to other neighbors.

  • If S was already in the mempool but not ¯

S, nothing else needs to be done.

  • If S is not in the mempool but ¯

S is, then a matching occurs. The node constructs the matched seed Sm = 0⌢S(A) and propagates it to the neighbors that send the pheromone seeds S(A) and S(B).

  • If both S and ¯

S were already in the mempool then the matching occurred earlier and nothing needs to be done.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-71
SLIDE 71

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Confirmation and payment

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-72
SLIDE 72

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Confirmation and payment

  • Alice waits for several matched seed to arrive, and chooses
  • ne and constructs the confirmed seed Sc = 0⌢Sm.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-73
SLIDE 73

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Confirmation and payment

  • Alice waits for several matched seed to arrive, and chooses
  • ne and constructs the confirmed seed Sc = 0⌢Sm.
  • Alice propagates the confirmed seed to the neighbor that

send her the matched seed and waits for Bob the confirmation

  • f the path.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-74
SLIDE 74

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Confirmation and payment

  • Alice waits for several matched seed to arrive, and chooses
  • ne and constructs the confirmed seed Sc = 0⌢Sm.
  • Alice propagates the confirmed seed to the neighbor that

send her the matched seed and waits for Bob the confirmation

  • f the path.
  • Nodes that receive a confirmed seed propagate it back.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-75
SLIDE 75

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Confirmation and payment

  • Alice waits for several matched seed to arrive, and chooses
  • ne and constructs the confirmed seed Sc = 0⌢Sm.
  • Alice propagates the confirmed seed to the neighbor that

send her the matched seed and waits for Bob the confirmation

  • f the path.
  • Nodes that receive a confirmed seed propagate it back.
  • Once Bob receives the confirmed seed, he signals it to Alice

and the payment is initiated through that path.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-76
SLIDE 76

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Confirmation and payment

  • Alice waits for several matched seed to arrive, and chooses
  • ne and constructs the confirmed seed Sc = 0⌢Sm.
  • Alice propagates the confirmed seed to the neighbor that

send her the matched seed and waits for Bob the confirmation

  • f the path.
  • Nodes that receive a confirmed seed propagate it back.
  • Once Bob receives the confirmed seed, he signals it to Alice

and the payment is initiated through that path.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-77
SLIDE 77

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-78
SLIDE 78

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-79
SLIDE 79

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-80
SLIDE 80

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field. A current fee field initialized to 0.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-81
SLIDE 81

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field. A current fee field initialized to 0.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-82
SLIDE 82

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field. A current fee field initialized to 0.

  • Nodes only propagate pheromone seeds with an amount

compatible with the volume of the payment channels.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-83
SLIDE 83

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field. A current fee field initialized to 0.

  • Nodes only propagate pheromone seeds with an amount

compatible with the volume of the payment channels.

  • Nodes increase the current fee field with their fee.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-84
SLIDE 84

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field. A current fee field initialized to 0.

  • Nodes only propagate pheromone seeds with an amount

compatible with the volume of the payment channels.

  • Nodes increase the current fee field with their fee.
  • The node matching conjugate pheromone seeds updated the

amount of the fee field adding his fee to both fee amounts, and checks that is lower than the maximal fee.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-85
SLIDE 85

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Amount and fees

  • Alice and Bob enrich the pheromone seed by adding:

An amount field. A maximal fee field. A current fee field initialized to 0.

  • Nodes only propagate pheromone seeds with an amount

compatible with the volume of the payment channels.

  • Nodes increase the current fee field with their fee.
  • The node matching conjugate pheromone seeds updated the

amount of the fee field adding his fee to both fee amounts, and checks that is lower than the maximal fee.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-86
SLIDE 86

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-87
SLIDE 87

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-88
SLIDE 88

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • After a period τ0 nodes erase the data.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-89
SLIDE 89

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • After a period τ0 nodes erase the data.
  • Alice chooses her own waiting time τ1 and selection algorithm

for selecting matched seeds (minimum fee after the period τ1 is the obvious).

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-90
SLIDE 90

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • After a period τ0 nodes erase the data.
  • Alice chooses her own waiting time τ1 and selection algorithm

for selecting matched seeds (minimum fee after the period τ1 is the obvious).

  • Seeds of about 30 Bytes are probably acceptable.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-91
SLIDE 91

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • After a period τ0 nodes erase the data.
  • Alice chooses her own waiting time τ1 and selection algorithm

for selecting matched seeds (minimum fee after the period τ1 is the obvious).

  • Seeds of about 30 Bytes are probably acceptable.
  • τ0 of about 2 sec seem realistic depending on the speed of

communications.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-92
SLIDE 92

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • After a period τ0 nodes erase the data.
  • Alice chooses her own waiting time τ1 and selection algorithm

for selecting matched seeds (minimum fee after the period τ1 is the obvious).

  • Seeds of about 30 Bytes are probably acceptable.
  • τ0 of about 2 sec seem realistic depending on the speed of

communications.

  • A mempool space of a few Mb should be enough to process

thousands of Tx per second.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-93
SLIDE 93

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Mempool management

  • Nodes only store non-confirmed information for a few
  • seconds. Each node choses his treshold time τ0.
  • After a period τ0 nodes erase the data.
  • Alice chooses her own waiting time τ1 and selection algorithm

for selecting matched seeds (minimum fee after the period τ1 is the obvious).

  • Seeds of about 30 Bytes are probably acceptable.
  • τ0 of about 2 sec seem realistic depending on the speed of

communications.

  • A mempool space of a few Mb should be enough to process

thousands of Tx per second.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-94
SLIDE 94

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Self-improvement features

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-95
SLIDE 95

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Self-improvement features

  • The topology of the network is dynamical.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-96
SLIDE 96

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Self-improvement features

  • The topology of the network is dynamical.
  • Nodes can store historical performance of neighbors and

compute some weighting.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-97
SLIDE 97

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Self-improvement features

  • The topology of the network is dynamical.
  • Nodes can store historical performance of neighbors and

compute some weighting.

  • Comparison of historical weighting with short term one allows

to adjust to topology changes in the network.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-98
SLIDE 98

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Self-improvement features

  • The topology of the network is dynamical.
  • Nodes can store historical performance of neighbors and

compute some weighting.

  • Comparison of historical weighting with short term one allows

to adjust to topology changes in the network.

  • Best analysis will increase traffic and profitability.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-99
SLIDE 99

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Self-improvement features

  • The topology of the network is dynamical.
  • Nodes can store historical performance of neighbors and

compute some weighting.

  • Comparison of historical weighting with short term one allows

to adjust to topology changes in the network.

  • Best analysis will increase traffic and profitability.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-100
SLIDE 100

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Numerical simulations

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-101
SLIDE 101

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Numerical simulations

  • Warning! The paper ArXiv:1807.00151 is only a first draft.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-102
SLIDE 102

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Numerical simulations

  • Warning! The paper ArXiv:1807.00151 is only a first draft.
  • Numerical simulations are necessary to evaluate scalability,

and resources.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-103
SLIDE 103

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Numerical simulations

  • Warning! The paper ArXiv:1807.00151 is only a first draft.
  • Numerical simulations are necessary to evaluate scalability,

and resources.

  • Numerical simulations and dynamical study are necessary to

find out the best self-improvement parametrization.

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-104
SLIDE 104

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Numerical simulations

  • Warning! The paper ArXiv:1807.00151 is only a first draft.
  • Numerical simulations are necessary to evaluate scalability,

and resources.

  • Numerical simulations and dynamical study are necessary to

find out the best self-improvement parametrization.

  • Communication speed seems to be the main bottleneck.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-105
SLIDE 105

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Numerical simulations

  • Warning! The paper ArXiv:1807.00151 is only a first draft.
  • Numerical simulations are necessary to evaluate scalability,

and resources.

  • Numerical simulations and dynamical study are necessary to

find out the best self-improvement parametrization.

  • Communication speed seems to be the main bottleneck.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-106
SLIDE 106

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-107
SLIDE 107

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-108
SLIDE 108

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • Other nodes don’t know about transactions between Alice

and Bob. (Anonimity)

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-109
SLIDE 109

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • Other nodes don’t know about transactions between Alice

and Bob. (Anonimity)

  • Equal role for all nodes. (Decentralization)
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-110
SLIDE 110

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • Other nodes don’t know about transactions between Alice

and Bob. (Anonimity)

  • Equal role for all nodes. (Decentralization)
  • Scalability (pending numerical simulations).
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-111
SLIDE 111

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • Other nodes don’t know about transactions between Alice

and Bob. (Anonimity)

  • Equal role for all nodes. (Decentralization)
  • Scalability (pending numerical simulations).
  • Self-improvement features.
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-112
SLIDE 112

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • Other nodes don’t know about transactions between Alice

and Bob. (Anonimity)

  • Equal role for all nodes. (Decentralization)
  • Scalability (pending numerical simulations).
  • Self-improvement features.
  • Resilience to failure of part of the network. (Anti-fragility)
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-113
SLIDE 113

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Properties

  • No routing tables. No information about the network topology.
  • Other nodes don’t know about transactions between Alice

and Bob. (Anonimity)

  • Equal role for all nodes. (Decentralization)
  • Scalability (pending numerical simulations).
  • Self-improvement features.
  • Resilience to failure of part of the network. (Anti-fragility)
  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-114
SLIDE 114

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)

slide-115
SLIDE 115

Decentralized Networks Lightning Network. Biological ant routing Basic ant routing for LN

Thank for your attention!

  • R. P´

erez-Marco CNRS Ant routing for the Lightning Network (with C. Grunspan)