Difference between revisions of "Under Construction"
AlexGraham (talk | contribs) |
|||
| Line 2: | Line 2: | ||
Click back in your browser to go back to where you were or click [[Main Page|HERE]] to go back to the main page. | Click back in your browser to go back to where you were or click [[Main Page|HERE]] to go back to the main page. | ||
| + | |||
| + | Getminingcandidate | ||
| + | |||
| + | Getminingcandidate is a Remote Procedure call (RPC) program. The RPC calls are located at an SV node and are currently managed by Maestro software, though a number of software packages may perform these tasks. | ||
| + | |||
| + | getminingcandidate returns a mining candidate or candidate block to the node which originally requested it. The node requests a block to mine. Getminingcandidate is the program that obtains the block to mine. | ||
| + | |||
| + | The getminingcandidate program or call is a replacement for getblocktemplate program. The replacement requirement arose from the need to process bigger blocks with Merkle tree paths in the block header. The Merkle tree proof in the block header allows for confirmation of transactions rather than reading the transactions as a whole. Consequently there can be more transactions within a block and more efficient external processing of the block. | ||
Revision as of 08:01, 2 April 2020
The page you are looking for is under construction! Please check back soon
Click back in your browser to go back to where you were or click HERE to go back to the main page.
Getminingcandidate
Getminingcandidate is a Remote Procedure call (RPC) program. The RPC calls are located at an SV node and are currently managed by Maestro software, though a number of software packages may perform these tasks.
getminingcandidate returns a mining candidate or candidate block to the node which originally requested it. The node requests a block to mine. Getminingcandidate is the program that obtains the block to mine.
The getminingcandidate program or call is a replacement for getblocktemplate program. The replacement requirement arose from the need to process bigger blocks with Merkle tree paths in the block header. The Merkle tree proof in the block header allows for confirmation of transactions rather than reading the transactions as a whole. Consequently there can be more transactions within a block and more efficient external processing of the block.