# US 2023/0412359 A1 · Systems and methods for blockchains with serial proof of work

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

- Number: US 2023/0412359 A1
- Document ID: US20230412359A1
- Status: Published application
- Kind: A1
- Application number: 18/320,855
- Filed: 2023-05-19
- Published: 2023-12-21
- Earliest claimed: 2018-02-27
- Assignees: Mydream Interactive, Inc.
- Applicants: Mydream Interactive, Inc.
- Inventors: Andrew Jonathan LEKER; Matthew Drew BIRDER, II; Allison Phuong HUYNH; Mark Thomas WALLACE
- Web page: https://patentgrep.com/patent/US20230412359A1

## CPC

- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3218: {using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 63/00: {Network architectures or network communication protocols for network security (cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00; network architectures or network communication protocols for wireless network security H04W12/00; security arrangements for protecting computers or computer systems against unauthorised activity G06F21/00)}
- H04L 63/126: {the source of the received data}
- 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)

## Abstract

Techniques for updating blockchains using a proof of work determined serially include receiving a block of data for inclusion in a new block of a blockchain; deterministically determining an initial nonce, hashing a combination of the block of data and the initial nonce to create a hashed value; iteratively deterministically determining an updated nonce based on a combination of the hashed value and updating the hashed value by hashing the updated nonce until the updated hashed value satisfies a proof of work criteria; creating the new block based on the block of data, the initial nonce, and the updated hashed value that satisfies the proof of work criteria; and having the new block stored in the blockchain.

## Claims

### Claim 1

A computer-implemented method for updating a blockchain, the method comprising:
receiving a block of data for inclusion in a new block of a blockchain;
deterministically determining an initial nonce;
hashing a combination of the block of data and the initial nonce to create a hashed value;
iteratively deterministically determining an updated nonce based on the hashed value and updating the hashed value by hashing a combination of the updated nonce and the block of data until the updated hashed value satisfies a proof of work criteria;
creating the new block based on the block of data, the initial nonce, and the updated hashed value that satisfies the proof of work criteria; and
having the new block stored in the blockchain.
