Improvements
-
Adjusted the Largest-First algorithm to pay for outputs collectively instead
of individually.The updated algorithm should now be successful at paying for any set of
outputs of total value v provided that the total value u of
available inputs satisfies u ≥ v.The cardinality restriction requiring the number of inputs to be greater than
the number of outputs has been removed.See the following commits for more details:
Fixes
-
Fixed a small issue with the migration algorithm that caused it to
occasionally return more change than actually available.This issue only occurred in extreme situations, where the total value of the
available UTxO set was less than the dust threshold value.See the following commits for more details:
14ef17a9647974a8
(PR #77)
Signatures
Name | Account | Role | Approval |
---|---|---|---|
Jonathan Knowles | @jonathanknowles | Software Engineer | ✔️ |
Matthias Benkort | @KtorZ | Technical Team Lead | ✔️ |
Piotr Stachyra | @piotr-iohk | QA Engineer | ✔️ |
Tatyana Valkevych | @tatyanavych | Release Manager | ✔️ |