IP Library Granted Patent US 12,724,976
Granted Patent B2
US 12,724,976 · App. 19/351,286 · Granted Sep 1, 2026

Persistent cognitive machine with multimodal processing capabilities

Inventor: Brian Galvin (Silverdale, WA)
Assignee: ATOM BEAM TECHNOLOGIES INC.
G06F40/30G06F16/3325G06F16/3329
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,724,976
App. No.
19/351,286
Filed
Oct 6, 2025
Granted
Sep 1, 2026
Kind
B2
Art Unit
2657
USPC
706/16
Abstract

A system and method for implementing persistent cognitive computation through geometric representation of thought in a dynamic latent manifold. The system encodes inputs into a curved space characterized by time-evolving metric tensors, compression pressure fields derived from Ricci curvature, and goal potential fields that shape attention flow. Cognition occurs through geodesic traversal of this manifold, with attention following paths that minimize cognitive action while balancing semantic density and goal relevance. A Cognitive Dynamics Engine maintains manifold geometry, computing optimal trajectories and managing thought bundle operations including consolidation, expansion, and higher-order abstraction. During idle periods, autonomous dreaming processes reorganize the manifold through perturbation, recombination, and topological surgery. This architecture enables persistent memory through geometric encoding, where frequently accessed concepts develop high-curvature regions and cognitive shortcuts emerge from usage patterns, transforming artificial intelligence from stateless computation to structured motion through shaped memory space.

Claims (33)

1 . A computer system comprising a hardware memory, wherein the computer system is configured to execute software instructions stored on nontransitory machine-readable storage media that:

maintain a latent manifold as a geometric substrate incorporating multiple dimensional representations for heterogeneous data modalities, wherein local curvature reflects semantic density within and across modalities;

encode inputs from multiple modalities into a unified geometric space while preserving modality-specific properties through dimensional constraints;

generate compression pressure fields that account for information density patterns across different modalities;

enable navigation across modal boundaries through geometric pathways that preserve semantic relationships during dimensional transitions;

synthesize unified representations spanning multiple modalities through geometric recombination of semantically aligned structures; and

update the manifold geometry to reinforce multimodal integrations and cross-modal pathways based on traversal patterns.

2 . The computer system of claim 1 , wherein the compression pressure fields comprise modality-specific pressure patterns.

3 . The computer system of claim 1 , wherein the software instructions further:

execute autonomous reorganization of the latent manifold during idle periods, including perturbation of existing structures, synthesis of new connections between disparate regions, and removal of unused or redundant structures.

4 . The computer system of claim 1 , wherein the software instructions further:

maintain a plurality of bidirectional attention fields within the latent manifold that support both forward exploration toward goals and reverse traversal along previously computed paths, enabling backtracking and path revision.

5 . The computer system of claim 1 , wherein the software instructions further:

establish a plurality of goal potential fields that create attractive forces within the latent manifold, guiding path computation toward semantically relevant regions for achieving specific objectives.

6 . The computer system of claim 1 , wherein the software instructions further:

implement hierarchical organization with multiple nested latent manifolds operating at different levels of abstraction, wherein paths can traverse between abstraction levels through geometric bridges.

7 . A method for a persistent cognitive computation with multimodal capabilities, comprising the steps of:

maintain a latent manifold as a geometric substrate incorporating multiple dimensional representations for heterogeneous data modalities, wherein local curvature reflects semantic density within and across modalities;

encode inputs from multiple modalities into a unified geometric space while preserving modality-specific properties through dimensional constraints;

generate compression pressure fields that account for information density patterns across different modalities;

enable navigation across modal boundaries through geometric pathways that preserve semantic relationships during dimensional transitions;

synthesize unified representations spanning multiple modalities through geometric recombination of semantically aligned structures; and

update the manifold geometry to reinforce multimodal integrations and cross-modal pathways based on traversal patterns.

8 . The method of claim 7 , further comprising the step:

computing modality-aware compression pressure fields derived from local curvature.

9 . The method of 7 , further comprising the step:

executing autonomous reorganization of the latent manifold during idle periods, including perturbation of existing structures, synthesis of new connections between disparate regions, and removal of unused or redundant structures.

10 . The method of claim 7 , further comprising the step:

maintaining a plurality of bidirectional attention fields within the latent manifold that support both forward exploration toward goals and reverse traversal along previously computed paths, enabling backtracking and path revision.

11 . The method of claim 7 , further comprising the step:

establishing a plurality of goal potential fields that create attractive forces within the latent manifold, guiding path computation toward semantically relevant regions for achieving specific objectives.

12 . The method of claim 7 , further comprising the step:

implementing hierarchical organization with multiple nested latent manifolds operating at different levels of abstraction, wherein paths can traverse between abstraction levels through geometric.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 3, 2026
From: GALVIN, BRIAN
To: ATOMBEAM TECHNOLOGIES INC.
Reel/Frame 073961/0668 →
Continuity (8)
Continuation In Part 19321173 · Sep 6, 2025
Continuation In Part 19284115 · Jul 29, 2025
Continuation 19051193 · Feb 12, 2025
Provisional Application 63847082 · Jul 19, 2025
Provisional Application 63847096 · Jul 19, 2025
Provisional Application 63847091 · Jul 19, 2025
Provisional Application 63847101 · Jul 19, 2025
Related Publication 20260236690A1 · Aug 13, 2026
References Cited (98)
US 9942254B1 · Averbuch · 2018 [cited by examiner]
US 10706356B1 · Doyle · 2020 [cited by examiner]
US 10984030B2 · Bordawekar · 2021 [cited by examiner]
US 11037531B2 · Kaplanyan · 2021 [cited by examiner]
US 11082438B2 · Peinador · 2021 [cited by examiner]
US 11218498B2 · Hajimirsadeghi · 2022 [cited by examiner]
US 11234006B2 · Wang · 2022 [cited by examiner]
US 11436246B2 · Lee · 2022 [cited by examiner]
US 11451565B2 · Zhou · 2022 [cited by examiner]
US 11770984B2 · Hendrickson · 2023 [cited by examiner]
US 11847536B2 · Chawla · 2023 [cited by examiner]
US 11934752B1 · Nordmark · 2024 [cited by examiner]
US 11989657B2 · Chavoshi · 2024 [cited by examiner]
US 12223456B1 · Manohar et al. · 2025 [cited by applicant]
US 20020091801A1 · Lewin et al. · 2002 [cited by applicant]
US 20070063548A1 · Eipper · 2007 [cited by examiner]
US 20100251101A1 · Haussecker · 2010 [cited by examiner]
US 20150262372A1 · Cardoso · 2015 [cited by examiner]
US 20160005281A1 · Laska · 2016 [cited by examiner]
US 20160239969A1 · Davatzikos · 2016 [cited by examiner]
US 20170351941A1 · Mishra · 2017 [cited by examiner]
US 20180018557A1 · Esser · 2018 [cited by examiner]
US 20190174514A1 · Ramesh et al. · 2019 [cited by applicant]
US 20190179896A1 · Anisimovich · 2019 [cited by examiner]
US 20190213277A1 · DeLuca · 2019 [cited by examiner]
US 20190325342A1 · Sikka · 2019 [cited by examiner]
US 20200081445A1 · Stetson · 2020 [cited by examiner]
US 20200143259A1 · Lindsley · 2020 [cited by examiner]
US 20200234446A1 · Mischi · 2020 [cited by examiner]
US 20200336562A1 · Luft · 2020 [cited by applicant]
US 20200351344A1 · Das Gupta et al. · 2020 [cited by applicant]
US 20200410164A1 · Seow · 2020 [cited by examiner]
US 20210012162A1 · Huang · 2021 [cited by examiner]
US 20210027862A1 · Wei · 2021 [cited by examiner]
US 20210073808A1 · Gu et al. · 2021 [cited by applicant]
US 20210103733A1 · Jiang · 2021 [cited by examiner]
US 20210125583A1 · Kaplanyan · 2021 [cited by examiner]
US 20210158184A1 · Weber · 2021 [cited by examiner]
US 20210350620A1 · Bronstein · 2021 [cited by examiner]
US 20210406224A1 · Neufeld et al. · 2021 [cited by applicant]
US 20220138156A1 · Wang et al. · 2022 [cited by applicant]
US 20220253633A1 · Bertasius · 2022 [cited by examiner]
US 20220307819A1 · Kadambi · 2022 [cited by examiner]
US 20220318831A1 · Marvaniya · 2022 [cited by examiner]
US 20230118401A1 · Xu · 2023 [cited by examiner]
US 20230142467A1 · Kaplanyan · 2023 [cited by examiner]
US 20230177281A1 · Kamath · 2023 [cited by examiner]
US 20230229722A1 · Ishii · 2023 [cited by examiner]
US 20230306162A1 · Mehr · 2023 [cited by examiner]
US 20230316006A1 · Tunstall-Pedoe et al. · 2023 [cited by applicant]
US 20230325678A1 · Fradkin · 2023 [cited by examiner]
US 20240036599A1 · Bowen · 2024 [cited by examiner]
US 20240046318A1 · Muriqi · 2024 [cited by examiner]
US 20240086493A1 · Lee · 2024 [cited by examiner]
US 20240104391A1 · Higgins et al. · 2024 [cited by applicant]
US 20240126811A1 · Law · 2024 [cited by examiner]
US 20240127041A1 · Smith · 2024 [cited by examiner]
US 20240160955A1 · Zhao et al. · 2024 [cited by applicant]
US 20240161933A1 · Baharloo · 2024 [cited by examiner]
US 20240193419A1 · Liang · 2024 [cited by examiner]
US 20240296665A1 · Nissenboim · 2024 [cited by examiner]
US 20240354320A1 · Procter et al. · 2024 [cited by applicant]
US 20240386015A1 · Crabtree · 2024 [cited by examiner]
US 20240411809A1 · Najafirad et al. · 2024 [cited by applicant]
US 20240428008A1 · Abraham et al. · 2024 [cited by applicant]
US 20250028882A1 · Ataei et al. · 2025 [cited by applicant]
US 20250094455A1 · Bista et al. · 2025 [cited by applicant]
US 20250131284A1 · Guillot · 2025 [cited by examiner]
US 20250156633A1 · Auchar · 2025 [cited by examiner]
US 20250165865A1 · Ardis · 2025 [cited by examiner]
US 20250249585A1 · Rozo · 2025 [cited by examiner]
US 20250259043A1 · Crabtree · 2025 [cited by examiner]
US 20250259085A1 · Crabtree · 2025 [cited by examiner]
US 20250259724A1 · Crabtree · 2025 [cited by examiner]
US 20250306680A1 · Zhou · 2025 [cited by examiner]
US 20250328754A1 · Srinivas · 2025 [cited by examiner]
US 20250363593A1 · Li · 2025 [cited by examiner]
US 20250371354A1 · Kamkari · 2025 [cited by examiner]
US 20250378647A1 · Elgort · 2025 [cited by examiner]
US 20260023955A1 · Fortkort · 2026 [cited by examiner]
US 20260044212A1 · Zhou · 2026 [cited by examiner]
US 20260046317A1 · Crabtree · 2026 [cited by examiner]
US 20260148163A1 · Crabtree · 2026 [cited by examiner]
AU 2021105030A4 · 2022 [cited by examiner]
CN 112732939A · 2021 [cited by examiner]
CN 112905807A · 2021 [cited by examiner]
CN 113297395B · 2021 [cited by examiner]
CN 114860884A · 2022 [cited by examiner]
CN 116885844A · 2023 [cited by examiner]
CN 118051793A · 2024 [cited by examiner]
CN 116311503B · 2025 [cited by examiner]
Mei et al., title={GeoMM: On Geodesic Perspective for Multi-modal Learning}, booktitle={Proceedings of the Computer Vision and Pattern Recognition Conference}, Jun. 2025 pp.={4776-4786}, year={2025} (Year: 2025). [cited by examiner]
Song et al., title={Cross-modality manifold adaptive network for industrial multimode processes and its applications}, journal={IEEE Transactions on Automation Science and Engineering}, vol.={22}, pp.={7845-7854}, 2024,… [cited by examiner]
Sarfati et al., title={Lines of thought in large language models}, journal={arXiv preprint arXiv:2410.01545}, year={2024}, pp. 1-20 (Year: 2024). [cited by examiner]
Gao, Hang & Zhang, Yongfeng; “Memory Sharing for Large Language Model Based Agents”, arXiv:2404.09982v2, Jul. 5, 2024. [cited by applicant]
Gim, In, et al; “Prompt Cache: Modular Attention Reuse for Low-Latency Inference”, arXiv:2311.04934v2, Apr. 2024. [cited by applicant]
Ramirez, Guillem, et al; “Cache & Distil: Optimising API Calls to Large Language Models”, arXiv:2310.13561v1, Oct. 20, 2023. [cited by applicant]
Schroeder, Luis Gaspar; “VectorQ: Advanced Semantic Prompt Caching with Dynamic Thresholds and Performance-Based Clustering”, Technical University of Munich, Nov. 26, 2024. [cited by applicant]