# US 2020/0396281 A1 · System architecture and method of processing data therein

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0396281 A1
- Document ID: US20200396281A1
- Status: Published application
- Kind: A1
- Application number: 17/006,211
- Filed: 2020-08-28
- Published: 2020-12-17
- Earliest claimed: 2016-11-19
- Assignees: Dfinity Stiftung
- Applicants: DFINITY Stiftung
- Inventors: DOMINIC WILLIAMS; TIMO HANKE
- Web page: https://patentgrep.com/patent/US20200396281A1

## CPC

- H04L 67/1044: {Group management mechanisms (management of multicast group membership H04L12/185; reconfiguring of node membership in a computing system to eliminate errors G06F11/1425)}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/0841: {involving Diffie-Hellman or related key agreement protocols}
- H04L 9/3073: {involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/3255: {using group based signatures, e.g. ring or threshold signatures}
- H04L 63/104: {Grouping of entities}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A software architecture encoded on a non-transitory computer readable medium, where the software architecture includes a first protocol, wherein the first protocol is configured to form a plurality of groups, wherein each group of the plurality of groups comprises a set of randomly selected nodes from a network. The software architecture further includes a second protocol, wherein the second protocol is configured to randomly select a first group from the plurality of groups formed by the first protocol. Additionally, the software architecture includes a third protocol, wherein the third protocol is configured to designate the first group to sign a first message by generating a first group signature. Furthermore, the software architecture includes a hash function, wherein the hash function is configured to generate a hash value from the first group signature.

## Claims

### Claim 1

A non-transitory computer-readable medium encoded with a computer-readable program, when executed by a processor, will cause a computer to execute a method of processing data, wherein the method comprises:
forming a plurality of groups, wherein each group of the plurality of groups comprises a set of randomly selected nodes from a network;
randomly selecting a first group from the plurality of groups formed by the first protocol;
designating the first group to sign a first message by generating a first group signature; and
generating a hash value from the first group signature.

### Claim 2 (depends on 1)

The method of claim 1, wherein the hash value is selects a second group, wherein the second group comprises a node from the network.

### Claim 3 (depends on 1)

The method of claim 1, wherein a size of the each group of the plurality of groups is a system parameter.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first group signature is generated by a threshold set of the first group, wherein a size of the threshold set is smaller than or equal to a size of the first group.

### Claim 5 (depends on 1)

The method of claim 1, wherein the first message comprises a value derived from a preceding group signature.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first message is a system parameter.

### Claim 7 (depends on 1)

The method of claim 1, further comprising interacting each node of a universal network with each other via a communication channel.

### Claim 8 (depends on 7)

The method of claim 7, wherein the communication channel comprises at least one of a peer-to-peer network, a broadcast network, or a gossip network.

### Claim 9 (depends on 1)

The method of claim 1, wherein the randomly selecting the first group from the plurality of groups formed by the first protocol comprises:
selecting the first group from the plurality of groups based on a seed.

### Claim 10 (depends on 9)

The method of claim 9, wherein the seed is derived from a preceding group signature produced by the third protocol.

### Claim 11 (depends on 10)

The method of claim 10, wherein the derivation of the seed from the preceding signature is by the hash function.

### Claim 12 (depends on 1)

The method of claim 1, further comprising establishing a group public key, by a setup protocol, for the first group of the plurality of groups formed by the first protocol, wherein the first group signature is validated by the group public key.

### Claim 13 (depends on 12)

The method of claim 12, wherein the first group signature is unique to the group public key and the first message.

### Claim 14 (depends on 13)

The method of claim 13, wherein the first group signature is based on at least one of bilinear pairings, bilinear pairings on elliptic curves, Gap Diffie-Hellman groups (GDH) or Boneh-Lynn-Shacham (BLS) signature scheme.

### Claim 15 (depends on 12)

The method of claim 12, wherein the setup protocol establishes an individual private key share for each node of the each group of the plurality of groups formed by the first protocol.

### Claim 16 (depends on 15)

The method of claim 15, wherein the individual private key shares of each of the nodes of a threshold set of the first group are used for generating the first group signature, wherein a size of the threshold set is smaller than or equal to a size of the first group.

### Claim 17 (depends on 1)

The method of claim 1, further comprising nominating a plurality of nodes, wherein the set of randomly selected nodes are part of the plurality of nodes.

### Claim 18 (depends on 17)

The method of claim 17, wherein the nominating the plurality of nodes is performed by adapting a methodology for nominating the plurality of nodes, wherein the methodology comprises at least one of a proof-of-work puzzle, an external third-party endorsement, or a validation of computational resources.

### Claim 19 (depends on 17)

The method of claim 17, wherein the nominating the plurality of nodes is performed by assessing a monetary value associated with each node of the plurality of nodes.

### Claim 20 (depends on 17)

The method of claim 17, further comprising detecting misbehavior of a select node of the set of randomly selected nodes.

### Claim 21 (depends on 20)

The method of claim 20, wherein the detecting misbehavior of the select node of the set of randomly selected nodes is followed by penalizing the select node.

### Claim 22 (depends on 20)

The method of claim 20, wherein the detecting misbehavior of the select node of the set of randomly selected nodes is followed by revoking a nomination of the select node.

### Claim 23 (depends on 1)

The method of claim 1, wherein the hash value selects a plurality of block makers.

### Claim 24 (depends on 23)

The method of claim 23, further comprising prioritizing each block among a plurality of blocks available for timestamping; and
designating the first group to timestamp a prioritized block of the plurality of blocks.

### Claim 25 (depends on 23)

The method of claim 23, further comprising designating the first group to timestamp a first block of a plurality of blocks.

### Claim 26 (depends on 25)

The method of claim 25, wherein generating the timestamp by a threshold set of the first group, wherein a size of the threshold set is smaller than or equal to a size of the first group.

### Claim 27 (depends on 25)

The method of claim 25, further comprising broadcasting at least one of the timestamp or a timestamped first block to the network.

### Claim 28 (depends on 23)

The method of claim 23, further comprising designating the first group to validate a first block of a plurality of blocks.

### Claim 29 (depends on 28)

The method of claim 28, further comprising broadcasting a notarization or a notarized first block.

### Claim 30 (depends on 23)

The method of claim 23, wherein each block maker of the plurality of block makers creates a plurality of blocks, wherein a block of the plurality of blocks references another block of the plurality of blocks.

### Claim 31 (depends on 30)

The method of claim 30, wherein the another block is at least one of timestamped or notarized.

### Claim 32 (depends on 30)

The method of claim 30, wherein the block comprises transactions collected by a block maker of the plurality of block makers.

### Claim 33 (depends on 23)

The method of claim 23, further comprising prioritizing each block maker of the plurality of block makers based on a ranking system.

### Claim 34 (depends on 33)

The method of claim 33, wherein the ranking system comprises:
deriving a rank for the each block maker of the plurality of block makers, wherein the rank is derived from the first group signature;
assigning a plurality of first weights, to each block associated with a respective block maker of the plurality of block makers, wherein each first weight of the plurality of first weights of the each block is based on the rank of the respective block maker of the plurality of block makers; and
assigning a second weight to at least one chain of blocks, wherein the second weight of the at least one chain of blocks is based on the each first weight of the each block in the at least one chain of blocks, wherein a block of the at least one chain of blocks references another block of the at least one chain of blocks.

### Claim 35 (depends on 34)

The method of claim 34, further comprising selecting a preceding block of a chain of blocks of the at least one chain of blocks based on a factor, wherein the factor comprises the first weight of the preceding block of the chain of blocks or the second weight of the chain of blocks.

### Claim 36

A non-transitory computer-readable medium encoded with a computer-readable program, when executed by a processor, will cause a computer to execute a method of processing data, wherein the method comprises:
forming a plurality of groups, wherein each group of the plurality of groups comprises a set of randomly selected nodes from a network;
randomly selecting a first group from the plurality of groups formed by the first protocol; and
designating the first group to sign a first message by generating a first group signature.

### Claim 37 (depends on 36)

The method of claim 36, further comprising generating a hash value from the first group signature.

### Claim 38 (depends on 36)

The method of claim 36, further comprising nominating a plurality of nodes, wherein the set of randomly selected nodes are part of the plurality of nodes.

### Claim 39 (depends on 36)

The method of claim 36, further comprising establishing a group public key for the first group of the plurality of groups formed by the first protocol, wherein the first group signature is validated by the group public key.

### Claim 40 (depends on 39)

The method of claim 39, wherein the first group signature is unique to the group public key and the first message.
