Transaction Construction Algorithm (voting pools) - Revision history

Justusranvier: Redirected page to Category:Transaction Construction Algorithm (voting pools)

2014-10-22T14:55:07Z

2014-10-21T14:40:29Z

‎Sequence

2014-10-20T19:07:48Z

‎Output List Initialization

2014-10-03T09:38:13Z

Fix typo

2014-10-03T09:24:37Z

fix typing error

2014-10-02T17:16:45Z

‎Sequence

2014-10-02T17:07:55Z

‎Sequence

2014-10-01T06:53:16Z

‎Initial Conditions

2014-09-29T15:02:21Z

‎Initial Conditions

2014-09-23T17:53:24Z

‎Insufficient Inputs

@@ Line 71: / Line 71: @@
 ## Take the sum of both lists.
 ## If the sum of the outputs exceeds the sum of the inputs, remove outputs in descending size order until this is no longer true. Note this may result in the output list being an empty set.
 # If the output list is non-empty, sort it by <code>SHA256(server id, transaction number)</code> where the server id and transaction number come from the outBailmentID.
 ## Express the server id and transaction number as strings, and concatenate them prior to hashing

@@ Line 71: / Line 71: @@
 ## Take the sum of both lists.
 ## If the sum of the outputs exceeds the sum of the inputs, remove outputs in descending size order until this is no longer true. Note this may result in the output list being an empty set.
-# If the output list is non-empty, sort it by <code>outBailmentID</code>
+# If the output list is non-empty, sort it by <code>SHA256(server id, transaction number)</code> where the server id and transaction number come from the outBailmentID.
 # Move both the input lists and outputs lists into separate stacks by pushing them in reverse list order. The first input and first output should be on the top of their respective stacks.

@@ Line 117: / Line 117: @@
 ## If it is valid, add it to the transaction.
 ### Add a new entry to the <code>transaction</code> array for this output:
-###* <code>nxid</code>: nil
+###* <code>ntxid</code>: nil
 ###* <code>index</code>: next unused
 ###* <code>amount</code>: copied from [[Outputs (Voting Pool Wallet API)|outputs]] list.

@@ Line 163: / Line 163: @@
 # Loop through every (non-change) output in the transaction and update the [[withdrawal status]] object for the corresponding output.
 ## The withdrawal status object contain an entry for every output in the transaction, where each entry has an <code>transactions</code> object containing a nil <code>ntxid</code>, an <code>index</code> matching the output position index, and a matching <code>amount</code>.
-## Update the <code>nxid</code> value from nil to the ntxid for the transaction.
+## Update the <code>ntxid</code> value from nil to the ntxid for the transaction.
 # Add the fees from this transaction to the <code>fees</code> property of the withdrawal status object.
 # Move the transaction to the finished transaction list.
@@ Line 169: / Line 169: @@
 {{clear}}
 <hr>
 ===Update Signatures===

@@ Line 184: / Line 184: @@
 ** Within each transaction, loop through every input.
 *** Within each input, loop through every pubkey in the [[redeem script]].
-**** If the wallet has possesses the private key corresponding to the pubkey, create the appropriate signature.
+**** If the wallet possesses the private key corresponding to the pubkey, create the appropriate signature.
 ***** Add the signature to the transaction.
 ***** Add the signature to the [[siglist|signature list]] in the appropriate position.

@@ Line 121: / Line 121: @@
 ###* <code>amount</code>: copied from [[Outputs (Voting Pool Wallet API)|outputs]] list.
 # Check that the transaction does not exceed size limits. If it does, follow the [[Transaction Construction Algorithm (voting pools)#Oversize Transaction|Oversize Transaction]] procedure.
-# Compare the sum of the inputs to the sum of the inputs and required transaction fee to determine if more inputs are required.
+# Compare the sum of the inputs to the sum of the outputs and required transaction fee to determine if more inputs are required.
 ## If no more inputs are required, then update the <code>status</code> for this output to "success".
 # If more inputs are required, then check to see if any more are available.

@@ Line 83: / Line 83: @@
 ====Initial Conditions====
-* There are no pending transactions to in the process of being constructed, either because this is the first transaction of the algorithm or because a previous pending transaction has been moved to the finished transaction list.
+* There are no pending transactions in the process of being constructed, either because this is the first transaction of the algorithm or because a previous pending transaction has been moved to the finished transaction list.
 ====Sequence====

@@ Line 316: / Line 316: @@
 ===Insufficient Inputs===
-[[File:Transaction Construction Algorithm - Insufficient Inputs.png|500px|right|thumb]]
+<div style="float: right"><include iframe src="https://www.lucidchart.com/documents/embeddedchart/9b471e6e-0a62-408a-ad0e-a5d7c491aa43" width="150" height="500" frameborder="0" scrolling="yes" /></div>
 This procedure is followed when the [[#Output List Initialization|Output List Initialization]] step estimated that that the input list was sufficient to fulfill the valid outputs but, due to change and/or transaction fees, one or more outputs can not be fulfilled.