📅 Original date posted:2019-10-11
📝 Original message:
Good morning,
> * Sub-payment - one or more attempts, each of which semantically pay
for "the same thing" for "the same value", set up in parallel.
> a sub-payment may have multiple attempts running in parallel, but only
one attempt will be claimable.
> * Payment - one or more sub-payments, each of which semantically pay
for "different parts of an entire thing", set up in parallel.
> a payment may have multiple sub-payments, and all sub-payments will be
claimed atomically.
This can be also thought of as:
Payment = ONE-OF(attempt_11, ..., attempt_m1) AND ... AND
ONE-OF(attempt_n1, ..., attempt_m'n)
Its dual also deserves some thought:
Payment = ONE-OF(attempt_11 AND ... AND attempt_m1), ..., (attempt_n1
AND ... AND attempt_m'n))
or in words, "A payment is an atomic value transfer through many paths,
each of which carry a part of the entire value -- many alternative
groups of paths are available to be used, but only one of the groups
eventually goes through."
Is there a reason to design in preference of one of the two?
Speaking of generalization, it would be nice to have arbitrary AND-OR
combinations, but this needs further exploration:
> If we want to create more complex access structures then we use
verifiable secret sharing where the discrete log of B is split up into
shares and distributed according the the desired structure.
One possible milestone of this generalisation would be to enable atomic
payments where the paying wallet says "there are all these known paths,
each with such and such capacity; I want some to go through such that
the desired value is transferred in aggregate, no more, no less
(possibly within a margin of error)".
Kindly ignore me if I'm regurgitating already discussed stuff.
Best,
Orfeas
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
Orfeas Stefanos Thyfronitis Litos [ARCHIVE] /
npub1h9…9dv32
2023-06-09 12:56:35
in reply to nevent1q…mggd
Author Public Key
npub1h9v94vzhwug6qdxzldyy8vfg4vyxhftwqhalec5vjwr8hfx0fnzst9dv32Published at
2023-06-09 12:56:35Event JSON
{
"id": "77b216ab43267d5d992f3bdd043dde1704f465c7ec21189e1741c05609deb357",
"pubkey": "b9585ab0577711a034c2fb4843b128ab086ba56e05fbfce28c93867ba4cf4cc5",
"created_at": 1686315395,
"kind": 1,
"tags": [
[
"e",
"9d4c70ce756cbbdc918a4040ba26aa2c165cce1ee731439cd288067127b88d9c",
"",
"root"
],
[
"e",
"6a031acad936d2d4933473f31c8768d48a0b82b741fb0674d0a61bed6a4d6fed",
"",
"reply"
],
[
"p",
"4505072744a9d3e490af9262bfe38e6ee5338a77177b565b6b37730b63a7b861"
]
],
"content": "📅 Original date posted:2019-10-11\n📝 Original message:\nGood morning,\n\n\u003e * Sub-payment - one or more attempts, each of which semantically pay\nfor \"the same thing\" for \"the same value\", set up in parallel.\n\u003e a sub-payment may have multiple attempts running in parallel, but only\none attempt will be claimable.\n\u003e * Payment - one or more sub-payments, each of which semantically pay\nfor \"different parts of an entire thing\", set up in parallel.\n\u003e a payment may have multiple sub-payments, and all sub-payments will be\nclaimed atomically.\n\nThis can be also thought of as:\n\nPayment = ONE-OF(attempt_11, ..., attempt_m1) AND ... AND\nONE-OF(attempt_n1, ..., attempt_m'n)\n\nIts dual also deserves some thought:\n\nPayment = ONE-OF(attempt_11 AND ... AND attempt_m1), ..., (attempt_n1\nAND ... AND attempt_m'n))\n\nor in words, \"A payment is an atomic value transfer through many paths,\neach of which carry a part of the entire value -- many alternative\ngroups of paths are available to be used, but only one of the groups\neventually goes through.\"\n\nIs there a reason to design in preference of one of the two?\n\nSpeaking of generalization, it would be nice to have arbitrary AND-OR\ncombinations, but this needs further exploration:\n\n\u003e If we want to create more complex access structures then we use\nverifiable secret sharing where the discrete log of B is split up into\nshares and distributed according the the desired structure.\n\nOne possible milestone of this generalisation would be to enable atomic\npayments where the paying wallet says \"there are all these known paths,\neach with such and such capacity; I want some to go through such that\nthe desired value is transferred in aggregate, no more, no less\n(possibly within a margin of error)\".\n\nKindly ignore me if I'm regurgitating already discussed stuff.\n\nBest,\nOrfeas\n\n-- \nThe University of Edinburgh is a charitable body, registered in\nScotland, with registration number SC005336.",
"sig": "0cdb41d1acb35ecbb96f9c39b8922a49ff3c8b7eb4a726c6d789c23894d0f33c76147993b9338cf394423d8a1490dab5ce702d7b1171c51914c146fd695cf670"
}