Ticket to Ride: Locally Steered Source Routing for the Lightning Network Article Swipe
Rene Pickhardt
,
Stefan Richter
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.4230/lipics.aft.2025.30
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.4230/lipics.aft.2025.30
Route discovery in the Lightning Network is challenging because senders observe only static channel capacities while real-time balances remain hidden. Existing locally steered schemes such as SpeedyMurmurs protect path privacy but depend on global landmark trees whose maintenance traffic and detours inflate latency and overhead. We present Ticket to Ride (T2R), a locally steered source-routing framework that encodes the set of channels a payment may traverse into a compact ticket - an approximate-membership filter keyed with per-hop Diffie–Hellman secrets. Each relay learns only whether its own outgoing edges are permitted, yielding the same incident-edge privacy as SpeedyMurmurs while eliminating the need to build and maintain global landmark trees or any other shared routing state. Extensive simulations on real snapshots - incorporating churn, silent shutdowns, and random channel saturation - show that T2R boosts end-to-end success by up to 9% and cuts median delay by 1.6× relative to SpeedyMurmurs, all with < 1 kB total overhead and no extra handshakes. Because tickets are processed hop-by-hop and can be prefixed by a trampoline, T2R remains lightweight enough for resource-constrained IoT nodes.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2107.05322
- https://arxiv.org/pdf/2107.05322
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4394643076
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4394643076Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.4230/lipics.aft.2025.30Digital Object Identifier
- Title
-
Ticket to Ride: Locally Steered Source Routing for the Lightning NetworkWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-01-01Full publication date if available
- Authors
-
Rene Pickhardt, Stefan RichterList of authors in order
- Landing page
-
https://arxiv.org/abs/2107.05322Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2107.05322Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2107.05322Direct OA link when available
- Concepts
-
Mathematical optimization, Computer science, Minimum-cost flow problem, Flow network, Generalization, Payment, Function (biology), Mathematics, Evolutionary biology, Biology, Mathematical analysis, World Wide WebTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4394643076 |
|---|---|
| doi | https://doi.org/10.4230/lipics.aft.2025.30 |
| ids.doi | https://doi.org/10.48550/arxiv.2107.05322 |
| ids.openalex | https://openalex.org/W4394643076 |
| fwci | 0.0 |
| type | preprint |
| title | Ticket to Ride: Locally Steered Source Routing for the Lightning Network |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10270 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9995999932289124 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1710 |
| topics[0].subfield.display_name | Information Systems |
| topics[0].display_name | Blockchain Technology Applications and Security |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C126255220 |
| concepts[0].level | 1 |
| concepts[0].score | 0.5812634229660034 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[0].display_name | Mathematical optimization |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.5121142864227295 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C99545648 |
| concepts[2].level | 3 |
| concepts[2].score | 0.49971508979797363 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2897180 |
| concepts[2].display_name | Minimum-cost flow problem |
| concepts[3].id | https://openalex.org/C114809511 |
| concepts[3].level | 2 |
| concepts[3].score | 0.4980480670928955 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1412924 |
| concepts[3].display_name | Flow network |
| concepts[4].id | https://openalex.org/C177148314 |
| concepts[4].level | 2 |
| concepts[4].score | 0.4885019063949585 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q170084 |
| concepts[4].display_name | Generalization |
| concepts[5].id | https://openalex.org/C145097563 |
| concepts[5].level | 2 |
| concepts[5].score | 0.42065536975860596 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1148747 |
| concepts[5].display_name | Payment |
| concepts[6].id | https://openalex.org/C14036430 |
| concepts[6].level | 2 |
| concepts[6].score | 0.41407930850982666 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q3736076 |
| concepts[6].display_name | Function (biology) |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.30978646874427795 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C78458016 |
| concepts[8].level | 1 |
| concepts[8].score | 0.0 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q840400 |
| concepts[8].display_name | Evolutionary biology |
| concepts[9].id | https://openalex.org/C86803240 |
| concepts[9].level | 0 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[9].display_name | Biology |
| concepts[10].id | https://openalex.org/C134306372 |
| concepts[10].level | 1 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[10].display_name | Mathematical analysis |
| concepts[11].id | https://openalex.org/C136764020 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q466 |
| concepts[11].display_name | World Wide Web |
| keywords[0].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[0].score | 0.5812634229660034 |
| keywords[0].display_name | Mathematical optimization |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.5121142864227295 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/minimum-cost-flow-problem |
| keywords[2].score | 0.49971508979797363 |
| keywords[2].display_name | Minimum-cost flow problem |
| keywords[3].id | https://openalex.org/keywords/flow-network |
| keywords[3].score | 0.4980480670928955 |
| keywords[3].display_name | Flow network |
| keywords[4].id | https://openalex.org/keywords/generalization |
| keywords[4].score | 0.4885019063949585 |
| keywords[4].display_name | Generalization |
| keywords[5].id | https://openalex.org/keywords/payment |
| keywords[5].score | 0.42065536975860596 |
| keywords[5].display_name | Payment |
| keywords[6].id | https://openalex.org/keywords/function |
| keywords[6].score | 0.41407930850982666 |
| keywords[6].display_name | Function (biology) |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.30978646874427795 |
| keywords[7].display_name | Mathematics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2107.05322 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2107.05322 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2107.05322 |
| locations[1].id | doi:10.48550/arxiv.2107.05322 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2107.05322 |
| locations[2].id | doi:10.4230/lipics.aft.2025.30 |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S7407052059 |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | Dagstuhl Research Online Publication Server |
| locations[2].source.host_organization | |
| locations[2].source.host_organization_name | |
| locations[2].license | cc-by |
| locations[2].pdf_url | |
| locations[2].version | |
| locations[2].raw_type | |
| locations[2].license_id | https://openalex.org/licenses/cc-by |
| locations[2].is_accepted | False |
| locations[2].is_published | |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | https://doi.org/10.4230/lipics.aft.2025.30 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5060747082 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Rene Pickhardt |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Rene Pickhardt |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5019967840 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-1188-8589 |
| authorships[1].author.display_name | Stefan Richter |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Stefan Richter |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2107.05322 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2024-04-10T00:00:00 |
| display_name | Ticket to Ride: Locally Steered Source Routing for the Lightning Network |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10270 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9995999932289124 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1710 |
| primary_topic.subfield.display_name | Information Systems |
| primary_topic.display_name | Blockchain Technology Applications and Security |
| related_works | https://openalex.org/W3141113327, https://openalex.org/W2080904092, https://openalex.org/W3035974271, https://openalex.org/W3161514703, https://openalex.org/W3207627914, https://openalex.org/W2270959725, https://openalex.org/W2151525839, https://openalex.org/W648253840, https://openalex.org/W2051329268, https://openalex.org/W2092572272 |
| cited_by_count | 0 |
| locations_count | 3 |
| best_oa_location.id | pmh:oai:arXiv.org:2107.05322 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2107.05322 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2107.05322 |
| primary_location.id | pmh:oai:arXiv.org:2107.05322 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2107.05322 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2107.05322 |
| publication_date | 2025-01-01 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.- | 70, 119, 128 |
| abstract_inverted_index.1 | 151 |
| abstract_inverted_index.< | 150 |
| abstract_inverted_index.a | 51, 62, 67, 169 |
| abstract_inverted_index.9% | 138 |
| abstract_inverted_index.We | 45 |
| abstract_inverted_index.an | 71 |
| abstract_inverted_index.as | 25, 95 |
| abstract_inverted_index.be | 166 |
| abstract_inverted_index.by | 135, 143, 168 |
| abstract_inverted_index.in | 2 |
| abstract_inverted_index.is | 6 |
| abstract_inverted_index.kB | 152 |
| abstract_inverted_index.no | 156 |
| abstract_inverted_index.of | 60 |
| abstract_inverted_index.on | 32, 116 |
| abstract_inverted_index.or | 108 |
| abstract_inverted_index.to | 48, 101, 137, 146 |
| abstract_inverted_index.up | 136 |
| abstract_inverted_index.IoT | 177 |
| abstract_inverted_index.T2R | 131, 171 |
| abstract_inverted_index.all | 148 |
| abstract_inverted_index.and | 39, 43, 103, 124, 139, 155, 164 |
| abstract_inverted_index.any | 109 |
| abstract_inverted_index.are | 88, 161 |
| abstract_inverted_index.but | 30 |
| abstract_inverted_index.can | 165 |
| abstract_inverted_index.for | 175 |
| abstract_inverted_index.its | 84 |
| abstract_inverted_index.may | 64 |
| abstract_inverted_index.own | 85 |
| abstract_inverted_index.set | 59 |
| abstract_inverted_index.the | 3, 58, 91, 99 |
| abstract_inverted_index.Each | 79 |
| abstract_inverted_index.Ride | 49 |
| abstract_inverted_index.cuts | 140 |
| abstract_inverted_index.into | 66 |
| abstract_inverted_index.need | 100 |
| abstract_inverted_index.only | 11, 82 |
| abstract_inverted_index.path | 28 |
| abstract_inverted_index.real | 117 |
| abstract_inverted_index.same | 92 |
| abstract_inverted_index.show | 129 |
| abstract_inverted_index.such | 24 |
| abstract_inverted_index.that | 56, 130 |
| abstract_inverted_index.with | 75, 149 |
| abstract_inverted_index.1.6× | 144 |
| abstract_inverted_index.Route | 0 |
| abstract_inverted_index.build | 102 |
| abstract_inverted_index.delay | 142 |
| abstract_inverted_index.edges | 87 |
| abstract_inverted_index.extra | 157 |
| abstract_inverted_index.keyed | 74 |
| abstract_inverted_index.other | 110 |
| abstract_inverted_index.relay | 80 |
| abstract_inverted_index.total | 153 |
| abstract_inverted_index.trees | 35, 107 |
| abstract_inverted_index.while | 15, 97 |
| abstract_inverted_index.whose | 36 |
| abstract_inverted_index.(T2R), | 50 |
| abstract_inverted_index.Ticket | 47 |
| abstract_inverted_index.boosts | 132 |
| abstract_inverted_index.churn, | 121 |
| abstract_inverted_index.depend | 31 |
| abstract_inverted_index.enough | 174 |
| abstract_inverted_index.filter | 73 |
| abstract_inverted_index.global | 33, 105 |
| abstract_inverted_index.learns | 81 |
| abstract_inverted_index.median | 141 |
| abstract_inverted_index.nodes. | 178 |
| abstract_inverted_index.random | 125 |
| abstract_inverted_index.remain | 18 |
| abstract_inverted_index.shared | 111 |
| abstract_inverted_index.silent | 122 |
| abstract_inverted_index.state. | 113 |
| abstract_inverted_index.static | 12 |
| abstract_inverted_index.ticket | 69 |
| abstract_inverted_index.Because | 159 |
| abstract_inverted_index.Network | 5 |
| abstract_inverted_index.because | 8 |
| abstract_inverted_index.channel | 13, 126 |
| abstract_inverted_index.compact | 68 |
| abstract_inverted_index.detours | 40 |
| abstract_inverted_index.encodes | 57 |
| abstract_inverted_index.hidden. | 19 |
| abstract_inverted_index.inflate | 41 |
| abstract_inverted_index.latency | 42 |
| abstract_inverted_index.locally | 21, 52 |
| abstract_inverted_index.observe | 10 |
| abstract_inverted_index.payment | 63 |
| abstract_inverted_index.per-hop | 76 |
| abstract_inverted_index.present | 46 |
| abstract_inverted_index.privacy | 29, 94 |
| abstract_inverted_index.protect | 27 |
| abstract_inverted_index.remains | 172 |
| abstract_inverted_index.routing | 112 |
| abstract_inverted_index.schemes | 23 |
| abstract_inverted_index.senders | 9 |
| abstract_inverted_index.steered | 22, 53 |
| abstract_inverted_index.success | 134 |
| abstract_inverted_index.tickets | 160 |
| abstract_inverted_index.traffic | 38 |
| abstract_inverted_index.whether | 83 |
| abstract_inverted_index.Existing | 20 |
| abstract_inverted_index.balances | 17 |
| abstract_inverted_index.channels | 61 |
| abstract_inverted_index.landmark | 34, 106 |
| abstract_inverted_index.maintain | 104 |
| abstract_inverted_index.outgoing | 86 |
| abstract_inverted_index.overhead | 154 |
| abstract_inverted_index.prefixed | 167 |
| abstract_inverted_index.relative | 145 |
| abstract_inverted_index.secrets. | 78 |
| abstract_inverted_index.traverse | 65 |
| abstract_inverted_index.yielding | 90 |
| abstract_inverted_index.Extensive | 114 |
| abstract_inverted_index.Lightning | 4 |
| abstract_inverted_index.discovery | 1 |
| abstract_inverted_index.framework | 55 |
| abstract_inverted_index.overhead. | 44 |
| abstract_inverted_index.processed | 162 |
| abstract_inverted_index.real-time | 16 |
| abstract_inverted_index.snapshots | 118 |
| abstract_inverted_index.capacities | 14 |
| abstract_inverted_index.end-to-end | 133 |
| abstract_inverted_index.hop-by-hop | 163 |
| abstract_inverted_index.permitted, | 89 |
| abstract_inverted_index.saturation | 127 |
| abstract_inverted_index.shutdowns, | 123 |
| abstract_inverted_index.challenging | 7 |
| abstract_inverted_index.eliminating | 98 |
| abstract_inverted_index.handshakes. | 158 |
| abstract_inverted_index.lightweight | 173 |
| abstract_inverted_index.maintenance | 37 |
| abstract_inverted_index.simulations | 115 |
| abstract_inverted_index.trampoline, | 170 |
| abstract_inverted_index.SpeedyMurmurs | 26, 96 |
| abstract_inverted_index.incident-edge | 93 |
| abstract_inverted_index.incorporating | 120 |
| abstract_inverted_index.SpeedyMurmurs, | 147 |
| abstract_inverted_index.source-routing | 54 |
| abstract_inverted_index.Diffie–Hellman | 77 |
| abstract_inverted_index.resource-constrained | 176 |
| abstract_inverted_index.approximate-membership | 72 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.00087377 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |