# US 2022/0036455 A1 · Selection of cryptographic identifiers in a block

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

- Number: US 2022/0036455 A1
- Document ID: US20220036455A1
- Status: Published application
- Kind: A1
- Application number: 16/941,380
- Filed: 2020-07-28
- Published: 2022-02-03
- Earliest claimed: 2020-07-28
- Applicants: DMG Blockchain Solutions Inc.
- Inventors: Sheldon Bennett; Adrian Glover; James Stafford-Coyte
- Web page: https://patentgrep.com/patent/US20220036455A1

## CPC

- G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
- G06F 16/951: Indexing; Web crawling techniques
- G06Q 20/065: {using e-cash}
- G06Q 20/0655: {e-cash managed centrally}
- G06Q 20/3674: {involving authentication}
- G06Q 20/4016: {involving fraud or risk level assessment in transaction processing}
- G06Q 30/0185: {Product, service or business identity fraud}
- G06Q 50/265: {Personal security, identity or safety}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- G06F 40/40: Processing or translation of natural language (natural language analysis G06F40/20; semantic analysis G06F40/30)
- G06Q 2220/00: Business processing using cryptography
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for detecting and tracking tainted cryptographic wallets. The method measures a wallet's propensity to engage in criminal or suspicious activity. Naturally, transacting with a criminal is tantamount either to funding crime or laundering its proceeds, so it is in our collective interest to identify—and then monitor or quarantine—any wallet with criminal association. The method also automatically flags risky withdrawal requests in real-time for further review before committing them to the blockchain. In some embodiments, the exchange can quarantine wallets at a certain AddressScore.

## Claims

### Claim 1

A method of operating a pool of proof of work hashing processors (“hashing processors”) associated with a filter node and a filter node mempool comprising:
receiving, by the hashing processors of the filter node from a non-filter node mempool, a plurality of events each associated with a cryptographic identifier, wherein the hashing processors are configured to generate a block data structure that is appended to a blockchain data structure, the block data structure based on a subset of the plurality of events;
sorting the plurality of events based on each respective cryptographic identifier associated with each respective event of the plurality of events, wherein said sorting identifies events of the plurality of events to include in the subset where those events associated with a predetermined list of cryptographic identifiers are selectively excluded from the subset;
in response to association of events in the filter node mempool with the predetermined list of cryptographic identifiers, deleting those events from the filter node mempool;
propagating of events present in the filter node mempool post-deletion to other mempools;
generating, by the hashing processors, the block data structure based on the subset, wherein the block data structure is compatible with a blockchain network populated by the filter node and non-filter nodes; and
appending the block data structure to the blockchain data structure of the blockchain network populated by the filter node and non-filter nodes.

### Claim 2

(canceled)

### Claim 3 (depends on 1)

The method of claim 1, wherein the block data structure is a first block data structure, the method further comprising:
subsequent to generation of the first block data structure, sorting a remaining plurality of events to include in a second subset to include within a second block data structure; and
generating, by the hashing processors, the second block data structure including the second subset.

### Claim 4 (depends on 1)

The method of claim 1, wherein the predetermined list is based on an automated web crawler operating on a blockchain explorer.

### Claim 5 (depends on 1)

The method of claim 1, wherein the predetermined list is based on operations performed by mechanical turks.

### Claim 6 (depends on 1)

The method of claim 1, wherein the predetermined list is based on governmental entity list.

### Claim 7 (depends on 1)

The method of claim 1, wherein the predetermined list is based on a criminality score of the cryptographic identifier.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
generating the predetermined list of cryptographic identifiers based on a web crawler parsing text of websites for cryptographic identifiers paired with textual references to criminality.

### Claim 9 (depends on 1)

The method of claim 1, wherein each of the plurality of events include at least two cryptographic identifiers including a first cryptographic identifier and a second cryptographic identifier each associated with users.

### Claim 10 (depends on 9)

The method of claim 9, wherein each event shifts a unique cryptographic object between the first cryptographic identifier and the second cryptographic identifier.

### Claim 11

A filter node system comprising:
a pool of hashing processors executing a filter node protocol and configured to receive, via a network interface, a plurality of events each associated with a cryptographic identifier, wherein the pool of hashing processors are configured to generate a block data structure that is appended to a blockchain data structure, the block data structure based on a subset of the plurality of events;
a filter node mempool associated with the pool of hashing processors, the filter node mempool storing the plurality of events, wherein at least a portion of the plurality of events were received by the filter node mempool from a non-filter node mempool;
a memory including a predetermined list of cryptographic identifiers and filter node protocol instructions that when executed cause the hashing processors to sort the plurality of events based on each respective cryptographic identifier associated with the plurality of events, wherein the sorting identifies events of the plurality of events to include in the subset where those events associated with the predetermined list of cryptographic identifiers are selectively excluded from the subset, and the instructions further cause the hashing processors to generate the block data structure based on the subset, wherein the block data structure is compatible with a blockchain network populated by the filter node and non-filter nodes, and wherein the memory further includes instructions that when executed delete events associated with the predetermined list of cryptographic identifiers from the filter node mempool in response to the association of those events with the predetermined list of cryptographic identifiers, thereby preventing propagation of the those events from the filter node mempool to other mempools; and
a network interface configured to append the block data structure to the blockchain data structure of the blockchain network populated by the filter node and non-filter nodes.

### Claim 12 (depends on 11)

The system of claim 11, wherein the pool of hashing processors comprise mining ASICs.

### Claim 13 (depends on 11)

The system of claim 11, wherein the predetermined list is based on an automated web crawler operating on a blockchain explorer.

### Claim 14 (depends on 11)

The system of claim 11, wherein the predetermined list is based on operations performed by mechanical turks.

### Claim 15 (depends on 11)

The system of claim 11, wherein the predetermined list is based on governmental entity list.

### Claim 16 (depends on 11)

The system of claim 11, wherein the predetermined list is based on a criminality score of the cryptographic identifier.

### Claim 17

A computer-readable storage medium storing instructions that, when executed by a computing system, cause the computing system to perform a process comprising:
receiving, by hashing processors of a filter node from a non-filter node mempool, a plurality of events each associated with a cryptographic identifier, wherein the hashing processors are configured to generate a block data structure that is appended to a blockchain data structure, the block data structure based on a subset of the plurality of events;
sorting the plurality of events based on each respective cryptographic identifier associated with each respective event of the plurality of events, wherein said sorting identifies events of the plurality of events to include in the subset where those events associated with a predetermined list of cryptographic identifiers are selectively excluded from the subset;
in response to association of events in a filter node mempool with the predetermined list of cryptographic identifiers, deleting those events from the filter node mempool;
propagating of events present in the filter node mempool post-deletion to other mempools;
generating, by the hashing processors, the block data structure based on the subset, wherein the block data structure is compatible with a blockchain network populated by the filter node and non-filter nodes; and
appending the block data structure to the blockchain network populated by the filter node and non-filter nodes.

### Claim 18 (depends on 17)

The computer-readable storage medium of claim 17, further comprising:
discarding, by the hashing processors, events including cryptographic identifiers included on the predetermined list of cryptographic identifiers from the plurality of events.

### Claim 19 (depends on 18)

The computer-readable storage medium of claim 18, wherein the block data structure is a first block data structure, the method further comprising:
subsequent to generation of the first block data structure, sorting a remaining plurality of events to include in a second subset to include within a second block data structure; and
generating, by the hashing processors, the second block data structure including the second subset.

### Claim 20 (depends on 17)

The computer-readable storage medium of claim 17, wherein each of the plurality of events include at least two cryptographic identifiers including a first cryptographic identifier and a second cryptographic identifier each associated with users.
