IP Library Granted Patent US 12,388,835
Granted Patent B2
US 12,388,835 · App. 18/662,793 · Granted Aug 12, 2025

Systems and methods for processing optimizations and templating using metadata-driven blockchain techniques

Inventor: Sanzib Khaund (Walnut Creek, CA)
Assignee: Live Nation Entertainment, Inc.
H04L63/105G06F16/2379H04L67/61G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,388,835
App. No.
18/662,793
Granted
Aug 12, 2025
Kind
B2
Abstract

The present disclosure generally relates to Blockchain-based systems configured to process access rights to resources in a computationally efficient manner. Certain embodiments of the present disclosure generally relate to systems and methods that generate distributed applications to represent digital access rights to resources. Additionally, certain embodiments of the present disclosure generally relate to systems and methods that enhance the processing of assigning access rights using a Blockchain-based system using metadata.

Claims (63)

1. A method for determining digital queue positions corresponding to a plurality of access right requests for reordering the plurality of access right requests before processing by a blockchain system, the method comprising:

receiving, at a first time, a first access right request of the plurality of access right requests to access a resource, wherein the first access right request includes first metadata;

receiving, at a second time, a second access right request of the plurality of access right requests to access the resource, wherein the second access right request includes second metadata;

storing the first access right request at a first position and the second access right request at a second position in a digital queue associated with a blockchain buffer of the blockchain system;

evaluating the first metadata and the second metadata, wherein the first metadata and the second metadata includes:

information corresponding a plurality of items associated with each of the first access right request and the second access right request, wherein:

each of the plurality of items is represented by a predefined bit of a plurality of bits of a priority byte, and

the plurality of items includes: a highest order bit, the resource start time, urgency associated with the first access right request, and a policy associated with the first access right request;

assigning a numerical value to each of the plurality of items based on a threshold corresponding to each of the plurality of items;

generating a first score for the first access right request and a second score for the second access right request based on a combination of the numerical value associated with each of the plurality of items;

determining, based on the first score and the second score, that the second score associated with the second access right request is greater than the first score associated with the first access right request;

reordering the blockchain buffer so as to move the second position associated with the second access right earlier or before the first position; and

transmitting, based on the reordered blockchain buffer, the second access right request to the blockchain system for the processing before the first access right request.

2. The method of claim 1 , wherein an item corresponding to the highest order bit of the plurality of bits is prioritized for determining priorities of each of the plurality of access right requests.

3. The method of claim 2 , wherein in case the first access right request and the second access right request has same numerical value of the highest order bit then the digital queue positions of the first access right and the second access right is determined based on next bit in the priority byte.

4. The method of claim 1 , wherein the policy associated with the first access right request includes restrictions on reassignment of the access right.

5. The method of claim 4 , wherein:

policy free access rights are assigned a low priority, and

access rights associated with policies are assigned a high priority.

6. The method of claim 1 , wherein positions of the plurality of bits of the priority byte are reconfigured to modify priority of an item of the plurality of items.

7. The method of claim 1 , wherein the resource start time indicates time when a live event associated with the resource starts.

8. The method of claim 1 , wherein one or more bits of the plurality of bits are unassigned.

9. A system for determining digital queue positions corresponding to a plurality of access right requests for reordering the plurality of access right requests before processing by a blockchain system, the system comprising:

one or more processors, connected with one or more memory, configured to:

receive, at a first time, a first access right request of the plurality of access right requests to access a resource, wherein the first access right request includes first metadata;

receive, at a second time, a second access right request of the plurality of access right requests to access the resource, wherein the second access right request includes second metadata;

store the first access right request at a first position and the second access right request at a second position in a digital queue associated with a blockchain buffer of the blockchain system;

evaluate the first metadata and the second metadata, wherein the first metadata and the second metadata includes:

information corresponding a plurality of items associated with each of the first access right request and the second access right request, wherein:

each of the plurality of items is represented by a predefined bit of a plurality of bits of a priority byte, and

the plurality of items includes: a highest order bit, the resource start time, urgency associated with the first access right request, and a policy associated with the first access right request;

assign a numerical value to each of the plurality of items based on a threshold corresponding to each of the plurality of items;

generate a first score for the first access right request and a second score for the second access right request based on a combination of the numerical value associated with each of the plurality of items;

determine, based on the first score and the second score, that the second score associated with the second access right request is greater than the first score associated with the first access right request;

reorder the blockchain buffer so as to move the second position associated with the second access right earlier or before the first position; and

transmit, based on the reordered blockchain buffer, the second access right request to the blockchain system for the processing before the first access right request.

10. The system of claim 9 , wherein an item corresponding to the highest order bit of the plurality of bits is prioritized for determining priorities of each of the plurality of access right requests.

11. The system of claim 10 , wherein in case the first access right request and the second access right request has same numerical value of the highest order bit then the digital queue positions of the first access right and the second access right is determined based on next bit in the priority byte.

12. The system of claim 9 , wherein the policy associated with the first access right request includes restrictions on reassignment of the access right.

13. The system of claim 12 , wherein:

policy free access rights are assigned a low priority, and

access rights associated policies are assigned a high priority.

14. The system of claim 9 , wherein positions of the plurality of bits of the priority byte are reconfigured to modify priority of an item of the plurality of items.

15. The system of claim 9 , wherein the resource start time indicates time when a live event associated with the resource starts.

16. The system of claim 9 , wherein one or more bits of the plurality of bits are unassigned.

17. A non-transitory computer-readable medium comprising instructions that are executable by a processing apparatus to cause the processing apparatus to perform operations for determining digital queue positions corresponding to a plurality of access right requests for reordering the plurality of access right requests before processing by a blockchain system, the operations comprising:

receiving, at a first time, a first access right request of the plurality of access right requests to access a resource, wherein the first access right request includes first metadata;

receiving, at a second time, a second access right request of the plurality of access right requests to access the resource, wherein the second access right request includes second metadata;

storing the first access right request at a first position and the second access right request at a second position in a digital queue associated with a blockchain buffer of the blockchain system;

evaluating the first metadata and the second metadata, wherein the first metadata and the second metadata includes:

information corresponding a plurality of items associated with each of the first access right request and the second access right request, wherein:

each of the plurality of items is represented by a predefined bit of a plurality of bits of a priority byte, and

the plurality of items includes: a highest order bit, the resource start time, urgency associated with the first access right request, and a policy associated with the first access right request;

assigning a numerical value to each of the plurality of items based on a threshold corresponding to each of the plurality of items;

generating a first score for the first access right request and a second score for the second access right request based on a combination of the numerical value associated with each of the plurality of items;

determining, based on the first score and the second score, that the second score associated with the second access right request is greater than the first score associated with the first access right request;

reordering the blockchain buffer so as to move the second position associated with the second access right earlier or before the first position; and

transmitting, based on the reordered blockchain buffer, the second access right request to the blockchain system for the processing before the first access right request.

18. The non-transitory computer-readable medium of claim 17 , wherein an item corresponding to the highest order bit of the plurality of bits is prioritized for determining priorities of each of the plurality of access right requests.

19. The non-transitory computer-readable medium of claim 18 , wherein in case the first access right request and the second access right request has same numerical value of the highest order bit then the digital queue positions of the first access right and the second access right is determined based on next bit in the priority byte.

20. The non-transitory computer-readable medium of claim 19 , wherein:

policy free access rights are assigned a low priority, and

access rights associated with policies are assigned a high priority.

Assignments (3)
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Feb 3, 2025
From: LIVE NATION ENTERTAINMENT, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS SUCCESSOR IN INTEREST TO U.S. BANK NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 070098/0018 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Feb 3, 2025
From: LIVE NATION ENTERTAINMENT, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS SUCCESSOR IN INTEREST TO U.S. BANK NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 070609/0313 →
SECURITY AGREEMENT Recorded Feb 3, 2025
From: LIVE NATION ENTERTAINMENT, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 070095/0508 →
Continuity (4)
Continuation 18304220 · Apr 20, 2023
Continuation 16869997 · May 8, 2020
Provisional Application 62846381 · May 10, 2019
Related Publication 20240372873A1 · Nov 7, 2024
References Cited (3)
US 20170230376A1 · McEwen · 2017 [cited by examiner]
US 20200311053A1 · Verma · 2020 [cited by examiner]
Hamdane et al, Oct. 2013 (Year: 2013). [cited by examiner]