# US 2020/0007314 A1 · On-chain governance of blockchain

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

- Number: US 2020/0007314 A1
- Document ID: US20200007314A1
- Status: Published application
- Kind: A1
- Application number: 16/025,535
- Filed: 2018-07-02
- Published: 2020-01-02
- Earliest claimed: 2018-07-02
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Meeta Vouk; Gari Singh; Jason K. Yellick; Gennaro A. Cuomo
- Web page: https://patentgrep.com/patent/US20200007314A1

## CPC

- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/3247: {involving digital signatures}
- H04L 63/102: {Entity profiles}
- H04L 63/12: {Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32)}
- H04L 63/20: {for managing network security; network security policies in general (filtering policies H04L63/0227)}
- H04L 67/104: Peer-to-peer [P2P] networks
- 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)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An example operation may include one or more of receiving a request to modify a governance policy of a blockchain, identifying a principal identity that controls the governance policy, determining an allowable combination of signatures of the principal identity required for modifying the governance policy based on a graph data structure storing signature policies for endorsing modifications to governance policies, and modifying the governance policy of the blockchain based on the request in response to an allowable combination of signatures being received.

## Claims

### Claim 1

A computing system comprising:
a network interface configured to receive a request to modify a governance policy of a blockchain; and
a processor configured to identify a principal identity that controls the governance policy, determine an allowable combination of signatures of the principal identity required for modification of the governance policy based on a graph data structure that stores signature policies for endorsement of modifications to governance policies, and modify the governance policy of the blockchain based on the request in response to receipt of an allowable combination of signatures.

### Claim 2 (depends on 1)

The computing system of claim 1, wherein the processor is further configured to read the graph data structure from a data block stored in a hash-linked chain of blocks on the blockchain.

### Claim 3 (depends on 1)

The computing system of claim 1, wherein the graph data structure comprises a directed acyclic graph in which the group of principal identities of the blockchain are mapped to a group of nodes arranged in a tree structure.

### Claim 4 (depends on 3)

The computing system of claim 3, wherein the tree structure comprises a hierarchical and recursive structure in which nodes closer to the root of the tree structure require greater signature agreement than nodes farther from the root of the tree structure.

### Claim 5 (depends on 3)

The computing system of claim 3, wherein a parent node in the tree structure represents a signature policy that requires satisfaction of a signature policy represented by a child node.

### Claim 6 (depends on 1)

The computing system of claim 1, wherein the principal identities comprise one or more of a certificate, a member, an administrator, and an organization unit.

### Claim 7 (depends on 1)

The computing system of claim 1, wherein the allowable combination of signatures comprises a quorum of users associated with the principal identity.

### Claim 8 (depends on 1)

The computing system of claim 1, wherein the request to modify the governance policy comprises one or more of a request to change a block size, a request to change a block hash algorithm, a request to change a block batch timeout of the blockchain, a request to change how new blockchain members are added, and a request to change an ability of a blockchain peer to transact on the blockchain.

### Claim 9

A method comprising:
receiving a request to modify a governance policy of a blockchain;
identifying a principal identity that controls the governance policy;
determining an allowable combination of signatures of the principal identity required for modifying the governance policy based on a graph data structure storing signature policies for endorsing modifications to governance policies; and
modifying the governance policy of the blockchain based on the request in response to an allowable combination of signatures being received.

### Claim 10 (depends on 9)

The method of claim 9, further comprising reading the graph data structure from a data block stored in a hash-linked chain of blocks on the blockchain.

### Claim 11 (depends on 9)

The method of claim 9, wherein the graph data structure comprises a directed acyclic graph in which the group of principal identities of the blockchain are mapped to a group of nodes arranged in a tree structure.

### Claim 12 (depends on 11)

The method of claim 11, wherein the tree structure comprises a hierarchical and recursive structure in which nodes closer to the root of the tree structure require greater signature agreement than nodes farther from the root of the tree structure.

### Claim 13 (depends on 11)

The method of claim 11, wherein a parent node in the tree structure represents a signature policy that requires a signature policy represented by a child node to be satisfied.

### Claim 14 (depends on 9)

The method of claim 9, wherein the principal identities comprise one or more of a certificate, a member, an administrator, and an organization unit.

### Claim 15 (depends on 9)

The method of claim 9, wherein the allowable combination of signatures comprises a quorum of users associated with the principal identity.

### Claim 16 (depends on 9)

The method of claim 9, wherein the request to modify the governance policy comprises one or more of a request to change a block size, a request to change a block hashing algorithm, a request to change a block batch timeout of the blockchain, a request to change how new blockchain members are added, and a request to change an ability of a blockchain peer to transact on the blockchain.

### Claim 17

A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform a method comprising:
receiving a request to modify a governance policy of a blockchain;
identifying a principal identity that controls the governance policy;
determining an allowable combination of signatures of the principal identity required for modifying the governance policy based on a graph data structure storing signature policies for endorsing modifications to governance policies; and
modifying the governance policy of the blockchain based on the request in response to an allowable combination of signatures being received.

### Claim 18 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein the method further comprises further comprising reading the graph data structure from a data block stored in a hash-linked chain of blocks on the blockchain.

### Claim 19 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein the graph data structure comprises a directed acyclic graph in which the group of principal identities of the blockchain are mapped to a group of nodes arranged in a tree structure.

### Claim 20 (depends on 19)

The non-transitory computer readable medium of claim 19, wherein the tree structure comprises a hierarchical and recursive structure in which nodes closer to the root of the tree structure require greater signature agreement than nodes farther from the root of the tree structure
