IP Library › Granted Patent US 12,462,295
Granted Patent B2
US 12,462,295 · App. 18/483,515 · Granted Nov 4, 2025

Distributed computer system and method enabling application of autonomous agents

Inventors: Humayun Munir Sheikh (Bury St Edmunds, GB); Attila Bagoly (Bury St Edmunds, GB)
G06Q30/08G06Q20/02G06Q20/223G06Q30/0609H04L9/0618H04L9/3236H04L9/3239H04L9/3297H04L9/50H04L2209/56
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,462,295
App. No.
18/483,515
Filed
Oct 9, 2023
Granted
Nov 4, 2025
Kind
B2
Art Unit
3622
USPC
705/14.1
Abstract

The present disclosure provides a distributed computer system that comprises worker nodes that are coupled together via a data communication network to exchange data therebetween, wherein the worker nodes include computing arrangements and local databases to process and store data therein. The worker nodes are autonomous agents (AAs), wherein the distributed computer system is configured to use the worker nodes for fulfilling a service request. The distributed computer system also comprises a processing arrangement that generates a bloom tree, driven by cryptographic hash values, ensuring accurate autonomous agent functionality identification, while proof-based decision-making enhances task execution.

Claims (36)

1 . A distributed computer system for managing and recording the functionalities of a plurality of autonomous agents, the system comprises:

a plurality of worker nodes that are coupled together via a data communication network to exchange data therebetween, wherein the plurality of worker nodes include computing arrangements and local databases to process and store data therein, wherein the plurality of worker nodes are the plurality of autonomous agents (AAs), and wherein the distributed computer system is configured to use the plurality of worker nodes for fulfilling a service request;

a processing arrangement configured to generate a bloom tree comprising cryptographic hash values, wherein each cryptographic hash value represents a functionality of an autonomous agent of the plurality of autonomous agents, wherein the functionality of each of the autonomous agents of the plurality of autonomous agents is represented by an invertible bloom filter, wherein the bloom tree combines the invertible bloom filter with Merkle tree, wherein the bloom tree comprises leaf nodes associated with transaction hashes and non-leaf nodes associated with hashes formed from child nodes, and wherein a root hash of the bloom tree is obtained by hashing the non-leaf nodes,

a software framework, wherein the software framework comprises:

a client-agent device configured to receive the service request, to generate an objective associated with the service request, and to send the objective to at least one autonomous agent of the plurality of autonomous agents and

at least one machine-learning model comprised in the at least one autonomous agent of the plurality of autonomous agents, wherein the machine-learning model is configured to:

receive the objective from the at least one autonomous agent of the plurality of autonomous agents,

generate tasks related to the objective received from the at least one autonomous agent of the plurality of autonomous agents, and

send the generated tasks to the at least one autonomous agent of the plurality of autonomous agents,

wherein the at least one autonomous agent of the plurality of autonomous agents is configured to:

 execute a pre-processing operation to generate a plurality of proof values corresponding to the tasks and to send the plurality of proof values to the processing arrangement, wherein the pre-processing operation comprises multiple hashing of the tasks based on an invertible bloom filter size to generate a given proof value of the plurality of proof values, and wherein the given proof value of the plurality of proof values corresponds to an invertible bloom filter data elements for the task,

 execute instructions to configure the processing arrangement to identify a list of associated autonomous agents of the plurality of autonomous agents by mapping a the given proof value to the bloom tree, and

 receive from the processing arrangement the list of associated autonomous agents of the plurality of autonomous agents, wherein the associated autonomous agents of the plurality of autonomous agents are configured to perform the tasks required to fulfil the service request by executing at least one action.

2 . The distributed computer system of claim 1 , wherein the at least one autonomous agent of the plurality of autonomous agents is configured to execute a build executor module to compose each autonomous agent associated with the objective into a further autonomous agent.

3 . The distributed computer system of claim 1 , wherein the at least one autonomous agent of the plurality of autonomous agents is configured to execute a protocol generation module to generate at least one protocol specification for the execution of each task by the at least one autonomous agent of the plurality of autonomous agents associated with the task, and wherein the at least one protocol specification is generated using a domain-independent protocol specification language.

4 . The distributed computer system of claim 2 , wherein the further autonomous agent is configured to implement at least one protocol specification to fulfil the service request by the client agent device.

5 . The distributed computer system of claim 1 , wherein the bloom tree is a tree structure where a node of the tree represents the invertible bloom filter data elements based on current functionality of the autonomous agent of the plurality of autonomous agents.

6 . The distributed computer system of claim 1 , wherein the list of associated agents corresponds to the autonomous agents of the plurality of autonomous agents that can be composed to fulfil the service request, or the list of autonomous agents of the plurality of autonomous agents that can work together to fulfil the service request or the list of autonomous agents of the plurality of autonomous agents whose functionalities need to be upgraded to fulfil the service request.

7 . The distributed computer system of claim 6 , wherein the autonomous agents of the plurality of autonomous agents whose functionalities need to be upgraded are restored back to original state using reverse operation of inverse bloom filter after fulfilment of the service request.

8 . The distributed computer system of claim 1 , wherein the service request is received from at least one of: a software application executing on a device of a user, a software application executing on a computing device that is communicably coupled to a device of a user, a cloud-based software application, a digital twin of a user, a digital representation of a user, an artificial intelligence model (AI-model) based on a Large Language Model (LLM).

9 . A method of operating a distributed computer system for managing and recording the functionalities of a plurality of autonomous agents that comprises a plurality of worker nodes that are coupled together via a data communication network to exchange data therebetween, wherein the plurality of worker nodes include computing arrangements and local databases to process and store data therein, wherein the plurality of worker nodes are the plurality of autonomous agents (AAs), and wherein the distributed computer system is configured to use the plurality of worker nodes for fulfilling a service request, the method further comprising:

executing a first set of instructions on a processing arrangement to generate a bloom tree comprising cryptographic hash values, wherein each cryptographic hash value represents a functionality of an autonomous agent of the plurality of autonomous agents, wherein the functionality of each of the autonomous agents of the plurality of autonomous agents is represented by an invertible bloom filter, wherein the bloom tree combines the invertible bloom filter with Merkle tree, wherein the bloom tree comprises leaf nodes associated with transaction hashes and non-leaf nodes associated with hashes formed from child nodes, and wherein a root hash of the bloom tree is obtained by hashing the non-leaf nodes,

receiving, at a client-agent device, the service request, generating an objective associated with the service request, and sending the objective to at least one autonomous agent of the plurality of autonomous agents, wherein a software framework is implemented, wherein the software framework comprises the client-agent device,

receiving, at a machine-learning model comprised in the at least one of the autonomous agent of the plurality of autonomous agents, the objective from the at least one autonomous agent of the plurality of autonomous agents, generating tasks related to the objective received from the at least one autonomous agent of the plurality of autonomous agents, and sending the generated tasks to the at least one autonomous agent of the plurality of autonomous agents,

configuring the at least one autonomous agent of the plurality of autonomous agents for:

executing a pre-processing operation to generate a plurality of proof values corresponding to tasks and sending the plurality of proof values to the processing arrangement, wherein the pre-processing operation comprises multiple hashing of the tasks based on an invertible bloom filter size to generate a given proof value of the plurality of proof values, and wherein the given proof value of the plurality of proof values corresponds to an invertible bloom filter data elements for the task,

executing a second set of instructions on the processing arrangement to identify a list of associated agents of the plurality of autonomous agents by mapping the given proof value to the bloom tree, and

receiving from the processing arrangement the list of associated autonomous agents of the plurality of autonomous agents, and

executing the instructions on the associated autonomous agents of the plurality of autonomous agents to perform the tasks required to fulfil the service request by executing at least one action.

10 . The method of claim 9 , further comprising executing a build executor module by the at least one autonomous agent of the plurality of autonomous agents to compose each autonomous agent associated with the objective into a further autonomous agent.

11 . The method of claim 9 , further comprising executing a protocol generation module by the at least one autonomous agent of the plurality of autonomous agents to generate at least one protocol specification for the execution of each task by the at least one autonomous agent of the plurality of autonomous agents associated with the task, and wherein the at least one protocol specification is generated using a domain-independent protocol specification language.

12 . The method of claim 10 , further comprising configuring the further autonomous agent to implement at least one protocol specification to fulfil the service request by the client agent device.

13 . The method of claim 9 , wherein the bloom tree is a tree structure where a node of the tree represents the invertible bloom filter data elements based on current functionality of the autonomous agent of the plurality of autonomous agents.

14 . The method of claim 9 , wherein the list of associated agents corresponds to the autonomous agents of the plurality of autonomous agents that can be composed to fulfil the service request, or the list of autonomous agents of the plurality of autonomous agents that can work together to fulfil the service request or the list of autonomous agents of the plurality of autonomous agents whose functionalities need to be upgraded to fulfil the service request.

15 . The method of claim 9 , wherein the autonomous agents of the plurality of autonomous agents whose functionalities need to be upgraded are restored back to original state using reverse operation of inverse bloom filter after fulfilment of the service request.

16 . The method of claim 9 , wherein the service request is received from at least one of: a software application executing on a device of a user, a software application executing on a computing device that is communicably coupled to a device of a user, a cloud-based software application, a digital twin of a user, a digital representation of a user, an artificial intelligence model (AI-model) based on a Large Language Model (LLM).

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 9, 2026
From: SHEIKH, HUMAYUN MUNIR; BAGOLY, ATTILA
To: FETCH.AI LIMITED
Reel/Frame 074891/0337 →
NUNC PRO TUNC ASSIGNMENT Recorded Mar 26, 2024
From: FETCH.AI LIMITED
To: ASSMBL.AI LIMITED
Reel/Frame 066895/0001 →
SECURITY INTEREST Recorded Oct 25, 2023
From: FETCH.AI LIMITED
To: SHEIKH, HUMAYUN MUNIR
Reel/Frame 065337/0174 →
Continuity (5)
Continuation In Part 18318897 · May 17, 2023
Continuation In Part 17234932 · Apr 20, 2021
Continuation 16130218 · Sep 13, 2018
Provisional Application 62557841 · Sep 13, 2017
Related Publication 20240037646A1 · Feb 1, 2024
References Cited (26)
US 6144739A · Witt · 2000 [cited by examiner]
US 7676539B2 · Jhoney · 2010 [cited by examiner]
US 8041706B2 · Agrawal · 2011 [cited by examiner]
US 8224935B1 · Bandopadhyay · 2012 [cited by examiner]
US 8589574B1 · Cormie · 2013 [cited by examiner]
US 9380024B2 · Schmidt · 2016 [cited by examiner]
US 9419854B1 · Wang · 2016 [cited by examiner]
US 10579974B1 · Reed · 2020 [cited by examiner]
US 10951540B1 · De Kadt · 2021 [cited by examiner]
US 11741238B2 · Rioux · 2023 [cited by examiner]
US 20080065910A1 · Agrawal · 2008 [cited by examiner]
US 20100082513A1 · Liu · 2010 [cited by examiner]
US 20110087625A1 · Tanner, Jr. · 2011 [cited by examiner]
US 20120254286A1 · Harlow · 2012 [cited by examiner]
US 20130010950A1 · Kerschbaum · 2013 [cited by examiner]
US 20130073858A1 · Lim · 2013 [cited by examiner]
US 20150215350A1 · Slayton · 2015 [cited by examiner]
US 20150295720A1 · Buldas · 2015 [cited by examiner]
US 20160307117A1 · Yang · 2016 [cited by examiner]
US 20180007131A1 · Cohn · 2018 [cited by examiner]
US 20180117447A1 · Tran · 2018 [cited by examiner]
US 20180285979A1 · Chessell · 2018 [cited by examiner]
US 20180349879A1 · High · 2018 [cited by examiner]
US 20200026286A1 · Vozar · 2020 [cited by examiner]
US 20210240191A1 · Cesafsky · 2021 [cited by examiner]
WO WO2018126065A1 · 2016 [cited by examiner]