Final Assessment
Congratulations, you have now reached the final milestone for this course.
This is the final assessment, which will assess you on all that you have learned so far. Successful completion of this assessment is mandatory for receiving the certificate for the course.
Students must receive a score of 79/93 to proceed. All questions are multiple choice questions and there could be one or more possible correct answers.
Best of luck!Congratulations, you have now reached the final milestone for this course.
This is the final assessment, which will assess you on all that you have learned so far. Successful completion of this assessment is mandatory for receiving the certificate for the course.
Students must receive a score of 79/93 to proceed. All questions are multiple choice questions and there could be one or more possible correct answers.
Best of luck!
What are the traits of a node?
The ability to check for invalid transactions, generate proof-of-work, and earn transaction fees.
The ability to monitor and store all events that are occurring on the network in real-time.
The ability to collect transactions and propagate them to other nodes.
The ability to produce and distribute valid blocks, and validate blocks they receive. ✓
What is the main role of nodes on the network.?
Receiving transactions.
Authorizing transactions.
Timestamping transactions. ✓
Delivering transactions.
How does Proof of Work act as a gating function for nodes when building new blocks?
By ensuring each node has properly followed the block consensus rules in creating their block.
By linking new blocks to the chain leading back to the original genesis block.
By applying an up-front cost to a new block being proposed for validation by the network. ✓
All of the above.
Which of these is true?
Proof of work gives the network an ideal method to control block timing. ✓
Proof-of-work offers a superior method for nodes to identify each other. ✓
Proof-of-work requires an investment in network infrastructure. ✓
Proof-of-work can be wasted. ✓
What is the most efficient method for nodes to add transactions to a block?
Adding them wherever a node sees fit. This process makes it unnecessary for a node to recalculate the Merkle tree.
Appending them to the end of the block and recalculating to find a new Merkle root. ✓
Randomly, this allows for the block to automatically form a new Merkle tree.
The only way possible for nodes to add transactions into a block is by appending them to the end of the list of transactions in the block.
What is a Merkle tree?
The complete transaction history of every single input contained within the block back to the moment they were distributed in the form of a block reward.
A Hierarchical data structure that enables secure and fast verification of data. ✓
The process by which control over the funds being spent on the network is verified.
Hash based proof-of-work that links together the blocks to form an immutable record leading back to the Genesis block.
How is a Merkle tree formed?
By nodes as they form the blockheader for their new block.
By ASICs as they work on finding a solution to the proof of work puzzle that meets the difficulty target formed by network consensus.
Through network consensus as to the order of events as they occurred on the network.
By nodes recording the order of transactions as they receive them. ✓
When a transaction is spent, the spending party must attach a valid _____ to the outputs from the UTXO set?
scriptSig. ✓
Input.
Private key.
Public address.
What does a valid hash puzzle represent?
That the transactions contained within the block are also valid.
The key to unlock the block reward which consists of the subsidy and the transaction fees contained within the block.
A signal that is impossible to form without access to hashers in order to generate valid block proposals. ✓
An unbreakable encryption scheme that protects the ledger's immutability.
10. Which answer best describes the Bitcoin network's energy consumption regarding proof-of-work and transaction processing?
The energy consumed by proof-of-work is directly proportional to the amount of transactions on the network.
Bitcoin’s energy consumption will become increasingly less as more energy efficient hashing machinery and more effective means of harnessing renewable energy are used.
The energy expended to find a valid solution for a hash puzzle is independent from amount needed to gather and validate the transactions in each block. ✓
(a) and (b).
11. Why is it important for nodes to know who the other nodes are in the network?
In order to try to out compete each other at producing valid blocks.
To watch each other for attempts to double spend on the network.
To prevent each other from attempting a 51% attack.
To share transactions and block announcements with each other. ✓
12. The first step to run the network is which of the following?
All nodes must find a proof-of-work which matches the difficulty target.
New blocks are broadcasted to all nodes.
New transactions are broadcast to all nodes. ✓
None of the above.
13. The second step to run the network is which of the following?
Each transaction is entered into a block for validation.
Each node collects valid transactions into a block. ✓
Each node finds a difficult proof of work for its block.
Nodes accept the block only if all transactions in it are valid and not already spent.
14. The third step to run the network is which of the following?
Each node works on finding a difficult proof-of-work for its block. ✓
New transactions are broadcast to all nodes.
When a node finds a proof-of-work, it broadcasts the block to all nodes.
Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.
15. The fourth step to run the network is which of the following?
Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.
When a node finds a proof-of-work, it broadcasts the block to all nodes. ✓
Nodes accept the block only if all transactions in it are valid and not already spent.
Each node finds a difficult proof of work for its block.
16. The fifth step to run the network is which of the following?
Nodes accept the block only if all transactions in it are valid and not already spent. ✓
Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.
All nodes must find a proof-of-work which matches the difficulty target.
When a node finds a proof-of-work, it broadcasts the block to all nodes.
17. The Sixth step to run the network is which of the following?
Nodes accept the block only if all transactions in it are valid and not already spent.
Nodes with a valid block that is accepted by the network are rewarded with the disbursement of previously undistributed bitcoins along with the transaction fees contained within the block.
Nodes express their acceptance of a block by working on creating the next block in the chain by including the accepted block's hash in it's new block. ✓
Nodes express their acceptance of a block by working on creating the next block in the chain by including the accepted block's hash in it's new block.
18. What does the full data of a block consist of?
The transaction inputs, scriptSig, and public address of all the transactions being submitted.
The ordered list of transactions plus the block header. ✓
The nonce of the completed hash puzzle along with the transactions being submitted.
The inputs, outputs, and scriptSig of all the transactions contained within the block.
19. How often must a node update the Merkle root?
As frequently as possible.
Each time new transactions are added. ✓
It is unnecessary for nodes to update the Merkle root.
For each new block being worked upon.
20. How is a Pool Miner integral in the block building process?
Pool Miners search for new transactions to enter into the incomplete block and distribute information about those transactions to a node which updates the block template for the hashers to work on.
Once a valid proof-of-work is found by hashers, it is distributed to nodes which send it to Pool Miners in order to be proposed to the network as the valid record of events having occurred on the ledger.
Pool Miners operate nodes as a for profit service allowing those with ASICs to connect directly to a pool which automatically directs the block creation effort.
Nodes distribute information about the incomplete block to the pool miners which coordinate ASICs in the search for a valid proof-of-work. ✓
21. Which best describes the nature of the difficulty puzzle?
It’s difficulty is determined by the amount of nodes on the network at any given time, the more active nodes working to build blocks the more difficult the puzzle becomes.
It’s difficulty is proportional to the amount of transactions contained within the block. As the amount of transactions contained within blocks grows, the difficulty of the puzzle increases, requiring more and more hashpower to maintain an average of 10 minutes per block.
It has a random solution which is tuned to maintain a block discovery rate of approximately 10 minutes. ✓
It has a single unknown solution that needs to be found approximately every 10 minutes in order to maintain the network’s block frequency.
22. How do nodes express their acceptance of a block?
By working on a new block, using the accepted block’s hash. ✓
By recording it in their ledger.
By propagating it to the rest of the nodes on the ledger.
All of the above.
23. How are nodes incentivized to accept it’s competitors' blocks quickly?
Too long of a delay in validating competitors’ blocks could result in the node being disconnected from the network.
Nodes that accept competitors’ blocks quickly are seen as competent nodes that are worthwhile for other nodes to share information with.
The sooner it receives and validates a block from a competitor, the sooner it can begin building a new block with its hash. ✓
All of the above.
24. What is a mempool?
It retains transactions that are valid according to the network rules but not to the node’s local policy settings.
It is the early stages of a block that the node is in the midst of creating.
It is a security screening system that protects the node from accidentally incorporating an invalid transaction into a block or accepting an invalid block.
It contains valid transactions that the node has accepted but which have not been timestamped into a block. ✓
25. How do nodes determine if transactions or blocks they are receiving are valid?
By checking them against the protocol rules. ✓
There isn’t a need as the transactions and blocks are only able to be propagated if they are valid.
Finding if they have a correct proof-of-work by checking it against their own proof-of-work.
By attempting to build a new block upon them.
26. Which are the network rulesets?
Consensus rules. ✓
Block consensus rules. ✓
Transaction consensus rules. ✓
Script language rules. ✓
27. Which best describes the Bitcoin consensus rules?
Rules that can be altered by nodes given the correct impetus.
Unchangeable rules applied across the network. ✓
Provided enough consensus the rules can be altered.
Without consensus the rules cannot be adequately enforced to protect the network.
28. What are immutable rules?
Rules that define the format and restrictions that transactions and blocks must follow. ✓
Rules that dictate there must be no changes in any way to the operation of the Bitcoin network.
Rules that allow for Bitcoin to function. ✓
Rules that are decided by the majority of Bitcoin users.
29. What would happen if any changes were made to the immutable rules?
Any changes to these rules could cause dramatic alterations to the nature of Bitcoin. ✓
Any changes to these rules could cause a fundamental disagreement between nodes as to the nature of Bitcoin. ✓
Any changes to these rules could cause a chain split. ✓
There aren't any ramifications to changing the rules as long as the rule change has consensus.
30. How are agreements enforced?
Through the application of proof of work. ✓
By nodes building blocks. ✓
By developer run opt-in agreements.
By using Nakamoto consensus. ✓
31. Which are the node policies?
Standard local policies. ✓
Standard local signature policies.
Standard local script language policies. ✓
Standard local P2P network policies. ✓
32. Which of these describes the Block Size Rule?
A way for nodes to prevent attempts to create blocks that they cannot validate.
It is an economic limit imposed by nodes on the acceptable size of blocks in the network. ✓
A individually configured consensus rule that limits the acceptable block size based on bytes. ✓
A way to limit the amount of transactions the network is able to process per block allowing for the creation of a fee market and revenue for miners.
33. How is the block size limit determined?
By node operators based upon their expense at creating blocks and the amount of transactions being made on the network.
By the network automatically determining the capacity it is capable of.
By users creating more or less transactions.
By nodes processing the most transactions that other nodes can tolerate. ✓
34. How is the Block Subsidy Rule important to the network?
It subsidizes network growth. ✓
It allows for affordable transactions despite block size limitations.
It allows nodes to make a profit without having to put in much effort to build out the network.
It incentivizes the network to form in a fair and predictable way. ✓
35. What is the Proof of Work Target Adjustment Rule?
It is the rule that sets the limit on how many nodes are able to operate on the network by increasingly making it more difficult to find a proof-of-work.
It's how the network adjusts the difficulty target for the proof-of-work needed to prevent any one entity from obtaining 51% of the network hashpower.
It's how the network adjusts the difficulty target for the proof-of-work needed to maintain the average block discovery rate. ✓
All of the above.
36. Why does the network need to adjust the target difficulty?
To compensate for the increase or decrease of resources applying proof-of-work. ✓
To make bitcoin harder to mine and therefore more scarce, increasing both price and demand.
To help increase the supply of GPUs available on the market and prevent older hardware from becoming unusable.
To stop a chain death spiral if miners switch to a coin that's recently gone up in value.
37. The Genesis Block Rule states that blocks must be added to an _______ chain of ______ leading back to the genesis block
existing, blocks
unbroken, proof-of-work ✓
original, block hashes
unaltered, blocks
38. What feature directly benefits from the genesis block hash being preserved?
Proof-of-work.
Double Spend Detection.
Instant Transactions.
Simplified Payment Verification. ✓
39. What do the transaction consensus rules define?
How users are able to generate transactions.
How transactions are interpreted by the nodes. ✓
What a transaction is capable of being.
All of the above.
40. What does the nSequence fields of each input and the nLockTime field of the transaction determine?
Transaction format.
Transaction fee value.
Transaction finality. ✓
Transaction size.
41. Which answers describe a transaction which is “non-final”?
A transaction which cannot be valid. ✓
A transaction which can become valid at a later time. ✓
A transaction which can never be final.
A transaction which cannot be entered into a block. ✓
42. What can happen if a minor change is made in how a node processes opcodes?
Transactions that were committed to the ledger being rendered unspendable. ✓
Irreparable damage to the Bitcoin network’s trust and usability. ✓
Nodes would be forked off on separate chains.
Absolutely nothing, nodes are free to process opcodes as desired.
43. Who sets the Formal Grammar for Bitcoin Script?
Satoshi Nakamoto.
Users.
Node operators. ✓
Whoever has the most hashpower.
44. What do Script Language Policies apply to?
Stack memory usage.
The maximum length of a byte sequence considered a valid numeric value.
Script execution. ✓
All of the above.
45. The ______ is a setting that nodes use to discourage bitcoin users from creating outputs that contain fewer satoshis than it costs to on-spend them at the minimum fee rate. The goal of these policies is to prevent large numbers of low value outputs _______.
Transaction Evaluation Time Out, with large amounts of data from slowing down the network.
Dust Rule, clogging up the network. ✓
Minimum Fee Policy, being used to attack the Bitcoin network.
Minimum Transaction Size Policy, from costing more to process than their fees are worth.
46. What does the Stack Memory Usage Policy limit?
The amount of memory consumable on the stacks. ✓
The amount of transactions able to be processed simultaneously.
The sum of the memory used by the stack and the memory used by the alt-stack. ✓
The amount of stack memory allowed for the execution of the unlocking and locking script for an input. ✓
47. Nodes on the Bitcoin network are free to do what?
To connect or disconnect to any device, user or service. ✓
To reject or shut down connections as they see fit. ✓
To operate with very different connection policies than other nodes. ✓
To reject otherwise valid transactions or blocks without consequence.
48. What is a transaction that is submitted in a non-final state called?
An invalid transaction.
A transaction evaluation.
A non-standard transaction.
A payment channel. ✓
49. What can a payment channel be used for?
Streaming content. ✓
large data transfers inside a bitcoin transaction. ✓
Paying for ongoing services. ✓
Anonymous transactions.
50. In the future, how may nodes use version numbers to determine how they direct their efforts?
By validating transactions with version numbers which meet legal or regulatory requirements. ✓
By validating transactions with version numbers that individual nodes have the capacity for.
By validating transactions that use version numbers corresponding to their values.
By using version numbers to identify users based on their off network identity.
51. Match the data item: The output script in bytes, given as a 1-9 byte VarInt.
Value
Output script length ✓
Output script
52. Match the data item: Often referred to as the scriptPubKey. Each scriptPubKey defines locking/spending conditions of an output.
Value
Output script length
Output script ✓
53. Match the data item: An 8-byte little-endian value representing the quantity of satoshis held by the output.
Value ✓
Output script length
Output script
54. If the nLockTime field is less than or equal to 500,000,000, what does the nLockTime field represent?
The Block height. ✓
A UNIX epoch timestamp.
The transaction size.
The transaction fee.
55. If the nLockTime field is greater than 500,000,000, what does the nLockTime field represent?
The Block height at which the transaction becomes final.
A UNIX epoch timestamp. ✓
The transaction size.
The transaction fee.
56. What happens to a transaction with a future nLockTime and an nSequence field below 0xFFFFFFFF?
Since it is a final transaction it is accepted by nodes and included within a valid block.
It is held until nLockTime expiry or its input's nSequence has been finalized. ✓
Since it is a non-final transaction it is ignored until the payment channel is closed.
Nodes wait until the block height has passed before validating the transaction.
57. What occurs to the nLockTime if all the transaction inputs have the maximum nSequence value?
It is ignored and the transaction can be included within a block. ✓
The transaction becomes final and doesn't need to be added to a block.
The nLockTime becomes a UNIX epoch timestamp.
The transaction is invalid until it can be finalized.
58. Non-final transactions are replaceable with what?
Transactions with the same inputs but with a lower nSequence number.
Transactions with different inputs but the same nSequence number.
Transactions that include the same inputs and the same nSequence number.
Transactions that include the same inputs with a higher nSequence number. ✓
59. What happens once a payment channel closes?
Only the last non-final transaction is recorded on-chain.
Only the funding transaction is recorded on-chain.
Only the most recent version of the iterated transaction is recorded on-chain. ✓
All iterations of the transaction are recorded on-chain.
60. Which are the correct rules for comparing each new version of the iterated transaction with the previous version?
The previous outputs are the same set being spent by the transaction inputs. ✓
No more than one of those inputs can be submitted with a decreased nSequence number.
At least one input must have an increased nSequence number. ✓
None of those inputs can be submitted with a decreased nSequence number. ✓
61. BitcoinSV node client software provides which transaction pools to nodes?
Main mempool. ✓
Secondary mempool. ✓
Final mempool
Non-final mempool. ✓
62. What is held within the global UTXO set?
The outputs that meet both the global network rules and the local node policies.
Every spendable output which has not yet been used as an input to a transaction. ✓
The history of every transaction made on the network.
The Merkle proofs and transaction output scripts of all bitcoins.
63. How will the ability of nodes to be able to choose subsets of the network they want to manage help the network scale?
By making it easier for nodes with inadequate resources to perform minor transaction processing tasks.
By allowing more nodes to operate on the network.
By enabling the system to form separate specialized services and nodes. ✓
All of the above.
64. How are nodes able to minimize storage requirements?
By utilizing archival services.
By pruning elements that are unlikely to be used. ✓
By removing all transaction information from the ledger and just retaining the block headers.
All of the above.
65. A working blockchain allows for what?
The optimization of data storage for cost management.
Users can optimize the information they retain for their own needs.
Allows users to use a timestamp to provide provenance.
All of the above. ✓
66. What does the First Seen Rule dictate?
That the node that first sees a UTXO must broadcast it to the rest of the nodes on the network.
That whichever node first sees a transaction, it gets to place it into its block.
That each input contained within the UTXO of a transaction must be seen simultaneously by a node.
That a UTXO can only be spent in the first seen valid transaction that spends it. ✓
67. After the ______ has been hashed twice using the SHA256 algorithm, the output value, known as the _______, is appended to the Merkle tree data structure.
serialized binary string is, Transaction ID. ✓
TXID is, Merkle root.
Transaction ID is, serialized binary string.
UTXOs are Merkle trees’ leaves.
68. How could a node parallelize Merkle tree generation?
By combining the Merkle trees of transaction subsets contained within a candidate block to form a larger tree. ✓
By generating multiple possible Merkle trees providing ready made possibilities that can be automatically applied to the candidate block.
By connecting with other nodes to compare Merkle trees.
By building multiple block headers and combining them with the different Merkle roots.
69. Which blocks does the directed acyclic graph consist of?
Only blocks that contain UTXO’s that are spendable on the network.
The blocks since the node first connected to the network.
The blocks which a node has successfully added to the longest proof-of-work chain.
The genesis block to the current tip of the longest proof-of-work chain. ✓
70. Which forms the edge to the previous block that joins new blocks to the blockchain DAG?
hashMerkleRoot
hashPrevBlock ✓
Version
Time
71. How is a nonce used to generate proof-of-work?
By finding a nonce that once incorporated into the hash puzzle, the subsequent value must equal the difficulty target to be considered successful.
By cycling hash puzzles against the nonce until a hash puzzle is unlocked that meets the difficulty target of the network.
By passing single use values through the nonce field modulating the block header to form a hash that is successful if it is equal or less than the difficulty target. ✓
By searching for a nonce that when combined with the hash puzzle forms a number that matches the difficulty criteria.
72. Since the coinbase transaction doesn’t need to be propagated to the network until a block is found, what does it need to adhere to?
It doesn’t need to adhere to any rules.
Dust limits.
Minimum transaction fees.
Bitcoin’s immutable ruleset. ✓
73. How does the delay on spending a coinbase transaction benefit the network?
It stabilizes the market price by transparently delaying the sale of newly distributed bitcoins.
It acts as an incentive for miners to continue building blocks. ✓
It ensures that the funds aren’t involved in an orphan race. ✓
All of the above.
74. Which is BitcoinSV’s perspective on transaction fees?
As demand for bitcoins grows, network limitations raise the cost of sending transactions creating a greater incentive for node participation.
As transactions become cheaper nodes will need to find new ways of adding value to the network in order to increase the value of their block rewards.
With growing adoption, large value transactions will increase the fees available to nodes creating a greater incentive for node participation.
As the network accommodates more transactions the cumulative value of transaction fees becomes the dominant incentive for node participation. ✓
75. Which answer describes the long term block reward structure of Bitcoin most fully?
Once the subsidy distribution is complete, the incentive will be entirely transaction based.
As network usage increases the incentive will increasingly become more transaction based.
The subsidy may be extended if network usage fails to provide enough reward to incentivize node participation.
With the diminishing subsidy and increase of network usage, the incentive will increasingly become more transaction based. ✓
76. What does a mining candidate consist of?
A template with the prevHash, block version, difficulty value, Merkle root and timestamp included in the header. ✓
A set of transactions with a block header that includes the hashPrevBlock, the Nonce, and the Time.
A set of transactions with the full Merkle tree, the hash of the previous block, the Nonce, and the block version.
A full Merkle tree, the version number, a tracking code, the previous block hash, and the difficulty value.
77. ASIC mining machines ____ values through a supplied ____ and with each value the block header is hashed twice using SHA256. A block header is valid if the double hash is ______ and can be added to the chain.
Adds, block header, more difficult than the difficulty target.
test, hash function, equal to or less than the difficulty target.
hash, block, greater than the difficulty target.
increment nonce, block header, less than the difficulty target. ✓
78. What do pool-miners use their mining candidate for?
To generate unique block headers and coinbase transactions which they provide to their ASICs. ✓
Incrementally iterating a nonce as an input to the candidate header before hashing with the ASIC miners.
For their ASICs to perform 4.3 billion nonce cycles on, in order to generate proof-of-work.
All of the above.
79. What happens once a successful proof-of-work is found?
It is immediately broadcasted to the network by the pool-miner in order to prevent the chance of competing blocks emerging.
It is sent back to the node by the pool miner to be verified and then broadcasted to the network. ✓
It is verified by the pool-miner before being sent to the node to be immediately distributed.
It is retested multiple times to ensure that the block isn’t rejected and the hashing efforts lost.
80. What happens if two competing valid blocks are simultaneously discovered?
Each node applies the first seen rule.
The node that first sees both blocks simultaneously chooses which is valid.
Nodes validate each block to see which has a lower difficulty and then continues the chain upon it.
The block added to the longest proof-of-work chain is regarded as the true record of events. ✓
81. How does a node signal consensus?
By propagating a first seen block to the rest of the network.
By sending a first seen block to a pool-miner in order to be hashed into the next block it is forming.
By forming a block template using the new block’s hash for the prevHash field. ✓
By retaining a first seen block’s block header for its record.
82. How does an orphan block occur?
When a pool-miner continues proof-of-work on a surpassed block instead of updating to a newly validated one.
When a node hasn’t updated its candidate’s block header to include a newly proposed valid block.
When two valid blocks are propagated to the network simultaneously. ✓
When proof-of-work is wasted on a block that includes the hash of a first seen block that was invalidated through Nakamoto consensus.
83. What is an orphan race?
A race to extend the chain where more than one valid block is available to be used in the longest chain of proof of work. ✓
A race to get a proof-of-work from the pool-miner to the node for verification and then onto the network to prevent it from being orphaned.
A race to update a node’s mining candidate’s block header in order to prevent any wasted proof-of-work on an already surpassed block.
All of the above.
84. How is an orphan race usually resolved?
When one group of nodes building on a particular block is larger than the other.
By discarding both blocks and restarting the block building process.
When a block is found in one of the chains before the other. ✓
All of the above.
85. How are nodes disincentivized from submitting invalid blocks?
The wasted expense of proof-of-work and the missed opportunity to profit. ✓
Disconnection from the network impacts their opportunity to earn revenue. ✓
The loss of energy consumed by finding proof-of-work. ✓
Even when a block is invalid it still needs to pay the pool-miners.
86. Why do nodes spontaneously form a Small World Network?
The result of asymmetrical game theory.
The financial incentive to quickly and fully propagate transactions and blocks. ✓
The rules force them to or they will be disconnected from the network.
It is still unknown.
87. Which are strong incentives for nodes to have very low latency connections to nodes that are most likely to find a block?
The First Seen Rule. ✓
To be able to share and spread block information readily. ✓
The potential for wasting proof-of-work on an already surpassed previous block hash. ✓
The minimization of orphan blocks. ✓
88. Transaction inputs using particular ______ can be sorted into specific optimized pipelines. Once the inputs have been validated, _______and _______ to the block template.
scriptSig, the transactions is reassembled, its hash added.
template types, the transaction is valid, appended. ✓
Outputs, the inputs, outputs are added.
Templates, the templates are reassembled, added.
89. Match the mempool type with the description: This mempool contains transactions that don’t meet the node’s local policies for inclusion in a block, but may meet the requirements of other nodes on the network.
Main mempool.
Secondary mempool. ✓
Non-final mempool.
90. Match the mempool type with the description: This mempool contains transactions that have been accepted as valid and will be included in the nodes next block.
Main mempool ✓
Secondary mempool
Non-final mempool
91. Match the mempool type with the description: This mempool may store transactions such as the intermediate states of a payment channel.
Main mempool
Secondary mempool
Non-final mempool ✓
92. Which of the following are Transaction Consensus Rules? (Part 1)
nLockTime and nSequence. ✓
Maximum Input Size Rule.
Coinbase Payment Rule.
The sum of a transaction's inputs must be greater than, or equal to, that of it’s outputs. ✓
93. Which of the following are Transaction Consensus Rules? (Part 2)
Payment Channels.
Maximum Transaction Size Rule. ✓
Coinbase Maturity Rule. ✓
Transaction Format Rule. ✓
Last updated