US 12,412,171 B2
Short transaction identifier collision detection and reconciliation
Steven Patrick Coughlan, London (GB)
Assigned to nChain Licensing AG, Zug (CH)
Filed by nChain Licensing AG, Zug (CH)
Filed on Jul. 12, 2024, as Appl. No. 18/771,834.
Application 18/771,834 is a continuation of application No. 17/602,174, granted, now 12,073,391, previously published as PCT/IB2020/053436, filed on Apr. 10, 2020.
Claims priority of application No. 1905221.6 (GB), filed on Apr. 12, 2019.
Prior Publication US 2024/0370860 A1, Nov. 7, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. G06Q 20/38 (2012.01); G06Q 20/06 (2012.01); G06Q 20/22 (2012.01); H04L 9/32 (2006.01); H04L 9/00 (2022.01)
CPC G06Q 20/3827 (2013.01) [G06Q 20/065 (2013.01); G06Q 20/223 (2013.01); G06Q 20/3825 (2013.01); H04L 9/3239 (2013.01); H04L 9/3247 (2013.01); H04L 9/3265 (2013.01); H04L 9/50 (2022.05); H04L 2209/56 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method of resolving short transaction identifier collision in a blockchain network, comprising:
determining a set of short transaction identifiers corresponding to full transaction identifiers stored in a mempool and confirming that none of the short transaction identifiers in the set result in a collision within the mempool;
sending block data to a receiving node, including a block Merkle root and the set of short transaction identifiers;
receiving, from the receiving node, Merkle tree hashes from an intermediate layer of a Merkle tree;
comparing the received Merkle tree hashes with locally-generated Merkle tree hashes for the intermediate layer of the Merkle tree to identify which of the received Merkle tree hashes is incorrect; and
sending resolution data to the receiving node identifying which of the received Merkle tree hashes is incorrect and providing one or more full transaction identifiers to enable correction of the incorrect Merkle tree hash.