# Assessment 5 #### Node A has 2% of the network hash power, Node B has 49% of the network hash power and node C has 49% of the network hash power. Node A shares its transaction list, index and Merkle tree data with Node B who also shares the same data with Node A. Nodes A and B do not share any data with Node C nor does C share any real time data with them. Node C produces and proposes a block X at time (t). Node A produces and proposes a block Y at (t+5s). It takes 1 second for node B to validate A's block proposal and 10 seconds to validate node C's proposed block. Which node's block will most likely be the one to extend the chain with the majority of hash power working on that chain tip? * [x] Node A * [ ] Node B * [ ] Node C * [ ] It will be an orphan race. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://hub.bsvblockchain.org/higher-learning/bsv-academy/bitcoin-primitives-merkle-trees/merkle-trees-and-verifying-proof-of-work/assessment-5.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.