You can chain microtransactions atomically, so with a star graph of payment channels you can route micropayments through a central processor without introducing

You can chain microtransactions atomically, so with a star graph of payment channels you can route micropayments through a central processor without introducing trust - taking the number of channels from O(N^2) to O(N) in the number of participants. I imagine a dynamic network of payment processing addresses could be chained in the same way, in order to provide a verified path between two participants using different channel operators. The above is subject to malleability-resistant payment channels, which will require a patch like Peter Todd's CHECKLOCKTIMEVERIFY (https://github.com/petertodd/bips/blob/checklocktimeverify/bip-checklocktimeverify.mediawiki https://github.com/petertodd/bips/blob/checklocktimeverify/b...)