# US 2025/0053621 A1 · Decentralized trusted tokenization protocol for open-source software

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

- Number: US 2025/0053621 A1
- Document ID: US20250053621A1
- Status: Published application
- Kind: A1
- Application number: 18/720,616
- Filed: 2022-05-16
- Published: 2025-02-13
- Earliest claimed: 2022-04-13
- Assignees: The Blockhouse Technology Limited; Ssc Holding Company Ltd
- Applicants: The Blockhouse Technology Limited; Ssc Holding Company Ltd
- Inventors: Han LIU; Huafeng ZHANG; Zhiqiang YANG; Chao LIU; Feihu SONG; Bangdao CHEN
- Web page: https://patentgrep.com/patent/US20250053621A1

## CPC

- G06F 21/10: Protecting distributed programs or content, e.g. vending or licensing of copyrighted material (protection in video systems or pay television H04N7/16) {; Digital rights management [DRM]}
- G06F 8/427: {Parsing}
- G06F 8/433: {Dependency analysis; Data or control flow analysis}
- G06F 8/436: {Semantic checking}
- G06F 8/71: Version control (security arrangements therefor G06F21/57); Configuration management
- G06F 8/75: Structural analysis for program understanding
- G06F 8/77: Software metrics
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- G06Q 10/101: Collaborative creation, e.g. joint development of products or services
- H04L 9/3213: {using tickets or tokens, e.g. Kerberos (network architectures or network communication protocols for entities authentication using tickets in a packet data network H04L63/0807)}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention discloses a decentralized open-source software protocol for open-source software and developers globally. The protocol is based on a non-fungible token (NFT) associated with a commit of a source code developed in collaboration, such as an open-source software code. With this protocol, contributors of an open-source software code are incentivized to take on well-specified tasks and then claim their contributions to development in the form of the NFT. A trusted transparency centre (TC) is proposed in the present invention as a core technology to enable trusted software analysis so as to yield the fundamental information and value of a given commit in a repository.

## Claims

### Claim 1

A method of operating a trusted execution environment to generate a non-fungible token associated with a commit to a source code, the method comprising:
supplying the trusted execution environment with a first source code and a second source code, the second source code being a result of the first source code subject to the commit;
parsing the first and second source codes to respectively generate first and second structural representations therefrom;
compiling the first and second source codes to respectively generate first and second executable codes therefrom;
generating respective first and second control flow graphs from the first and second executable codes;
analysing the first and second structural representations and the first and second control flow graphs to determine structural information associated with the commit;
performing symbolic execution of the first and second control flow graphs to generate respective first and second semantic representations;
analysing the first and second semantic representations to determine semantic information associated with the commit;
generating a non-fungible token; and
associating the non-fungible token with the structural information and semantic information associated with the commit.

### Claim 2 (depends on 1)

The method as claimed in claim 1, wherein the source code is editable by a plurality of users.

### Claim 3 (depends on 1, 2)

The method as claimed in claim 1 or 2, wherein the first and second source codes are supplied directly to the trusted execution environment.

### Claim 4 (depends on 1, 2)

The method as claimed in claim 1 or 2, wherein the first source code and the commit are supplied directly to the trusted execution environment, the method further comprising generating the second source code by subjecting the first source code to the commit.

### Claim 5

The method as claimed in any preceding claim, wherein the first and second structural representations comprise first and second syntax trees respectively.

### Claim 6

The method as claimed in any preceding claim, wherein the step of analysing the structural representations to determine structural information associated with the commit comprises computing a first structural encoding, wherein the structural information comprises the first structural encoding.

### Claim 7

The method as claimed in any preceding claim, wherein the step of analysing the first and second control flow graphs to determine structural information associated with the commit comprises computing a second structural encoding, wherein the structural information comprises the second structural encoding.

### Claim 8

The method as claimed in any preceding claim, further comprising extracting data from a commit log associated with the commit.

### Claim 9 (depends on 8)

The method as claimed in claim 8, wherein the step of extracting data from a commit log associated with the commit comprises computing a first semantic encoding, wherein the semantic information comprises the first semantic encoding.

### Claim 10

The method as claimed in any preceding claim, wherein the step of analysing the first and second semantic representations comprises computing a second semantic encoding, wherein the semantic information comprises the second semantic encoding.

### Claim 11

The method as claimed in any preceding claim, further comprising extracting one or more intention labels from the commit and adding the one or more intention labels to the semantic information associated with the commit.

### Claim 12

The method as claimed in any preceding claim, wherein the non-fungible token comprises the structural information and semantic information associated with the commit.

### Claim 13

The method as claimed in any preceding claim, comprising storing the structural information and semantic information associated with the commit in a ledger, the structural information and semantic information being stored against an identifier associated with the non-fungible token.

### Claim 14 (depends on 13)

The method as claimed in claim 13, wherein the ledger comprises a blockchain ledger.

### Claim 15

The method as claimed in any preceding claim, comprising:
extracting data from one or more information fields associated with the commit; and
associating the data with the non-fungible token.

### Claim 16 (depends on 15)

The method as claimed in claim 15, wherein the one or more information fields comprise one or more of: user identity information; repository information; and/or a timestamp.

### Claim 17

A trusted execution environment configured to generate a non-fungible token associated with a commit to a source code, the trusted execution environment being configured to:
receive a first source code and a second source code, the second source code being a result of the first source code subject to the commit;
parse the first and second source codes to respectively generate first and second structural representations therefrom;
compile the first and second source codes to respectively generate first and second executable codes therefrom;
generate respective first and second control flow graphs from the first and second executable codes;
analyse the first and second structural representations and the first and second control flow graphs to determine structural information associated with the commit;
perform symbolic execution of the first and second control flow graphs to generate respective first and second semantic representations;
analyse the first and second semantic representations to determine semantic information associated with the commit;
generate a non-fungible token; and
associate the non-fungible token with the structural information and semantic information associated with the commit.

### Claim 18 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)

A non-transitory computer-readable medium comprising instructions that, when executed by a processor, cause the processor to carry out a method of operating a trusted execution environment as claimed in any of claims 1 to 16.
