Skip to content

Instantly share code, notes, and snippets.

View riperk's full-sized avatar

Ryan Perkins riperk

View GitHub Profile

Keybase proof

I hereby claim:

  • I am riperk on github.
  • I am riperk (https://keybase.io/riperk) on keybase.
  • I have a public key ASAmJVW4cIj0qoBXE-odED_ss0W9TuzAdhh_mYn31468owo

To claim this, I am signing this object:

% each participant (a and b) has a utxo set. We model each as an array of ints
array[int] of int: a_inputs = [ 200, 12300, 5000, 100, 20, 5000, 230, 23, 23000];
array[int] of int: b_inputs = [ 1050, 100, 100, 100, 100, 2000, 2834];
% the amount of satoshis of fees we need to pay to create a 2-output transaction (with no inputs)
% we have a min and max, because it helps a lot in creating a transaction.
int: minTransactionFeeConstOverhead = 10;
int: maxTransactionFeeConstOverhead = 20;