2

I want to use transaction batching to make BTC payments to multiple recipients.

In order to optimize transaction amount \ size, lets I'm making equal transfers of x BTC to N recipients, and that F(x, N) is the function representing the transaction fees.

How would this function look like? How can I calculate it in any given time, to optimize transaction fees?

1

The function would not work because the transaction fee is based upon the size of the transaction in bytes (well really its weight, which is based on the bytes). While the number of outputs is a factor in this, the other factor is the number of inputs, and what type of inputs they are. So given just the outputs (the value of the outputs doesn't even matter), you still cannot determine how much in transaction fees that you will need to pay. Thus your function F(x, N) would not work.

  • Can you please clarify what additional information is required? – Lizozom Jan 26 '18 at 17:20
  • The number of inputs and the type of those inputs. If you want to optimize the transaction fee, then your function needs to also be selecting those inputs, and it will get very complicated if you want to do that. – Andrew Chow Jan 26 '18 at 17:25
  • Going to google what input types are out there :) – Lizozom Jan 26 '18 at 17:27

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.