US 11,736,279 B2
Entangled links, transactions and trees for distributed computing systems
Paul Borrill, Palo Alto, CA (US)
Assigned to Eric Litak, Reno, NV (US)
Filed by Eric Litak, Reno, NV (US)
Filed on May 17, 2019, as Appl. No. 16/414,781.
Application 16/414,781 is a continuation of application No. 15/687,529, filed on Aug. 27, 2017, granted, now 11,516,007.
Application 15/687,529 is a continuation of application No. 14/331,225, filed on Jul. 14, 2014, granted, now 9,774,401, issued on Sep. 26, 2017.
Claims priority of provisional application 61/846,602, filed on Jul. 15, 2013.
Claims priority of provisional application 61/893,285, filed on Oct. 21, 2013.
Claims priority of provisional application 61/913,302, filed on Dec. 8, 2013.
Prior Publication US 2022/0393863 A1, Dec. 8, 2022
Int. Cl. H04L 12/00 (2006.01); H04L 9/08 (2006.01)
CPC H04L 9/0852 (2013.01) 20 Claims
OG exemplary drawing
 
1. A computer-implemented method for creating an entangled link between a first computing entity and a second computing entity comprising:
identifying, using one or more processors, the first computing entity;
discovering, using one or more processors, the second computing entity by the first computing entity;
connecting, using one or more processors, the first computing entity to the second computing entity; and
establishing an entanglement between the first computing entity and the second computing entity to create the entangled link as a single abstract computational entity, wherein the entangled link is maintained using a packet-exchange hot potato protocol mechanism between the first computing entity and the second computing entity.