IP Library › Granted Patent US 12,101,401
Granted Patent B2
US 12,101,401 · App. 17/815,667 · Granted Sep 24, 2024

Digital forge systems and methods

Inventor: Brax Kinsey (Stuggart, DE)
H04L9/0869H04L9/16
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,101,401
App. No.
17/815,667
Granted
Sep 24, 2024
Kind
B2
Abstract

A system has a server and a processor electrically coupled to the server that receives an input binary string as an input and uses a decision matrix to determine via a plurality of cycles what a next state of a plurality of target cells being transformed will become to produce an output binary string that will be a cryptographic key.

Claims (31)

1. A system, comprising:

a server;

a processor electrically coupled to the server configured for receiving an input binary string as an input, the processor further configured for using a decision matrix to determine via a plurality of cycles what a next state of a plurality of target cells being transformed will become to produce an output binary string that will be a cryptographic key.

2. The system of claim 1 , wherein the output binary string is linked to the input binary string by the decision matrix and the plurality of cycles.

3. The system of claim 1 , wherein the next state of the plurality of target cells is dependent upon a plurality of surrounding cells.

4. The system of claim 1 , wherein a substructure includes the target cells and their surrounding neighbor cells.

5. The system of claim 1 , wherein a surface for performing the transformation is a bitCube, and the substructure is a unit bitCube.

6. The system of claim 1 , wherein a surface for performing the transformation is a bitSquare.

7. The system of claim 1 , wherein a surface for performing the transformation is a hyper bit cube.

8. The system of claim 1 , where a surface for performing the transformation is a bit penteract.

9. The system of claim 1 , wherein input binary string is converted from a hexadecimal number.

10. The system of claim 1 , wherein the binary string is transformed to a chose x-dimensional surface.

11. The system of claim 1 , wherein the processor is configured to select a decision matrix to transform the input binary string.

12. The system of claim 1 , wherein the processor is configured to transform the input binary string until an exit condition is met after an unknown plurality of cycles executed during transformation.

13. The system of claim 1 , wherein the processor is configured to store the decision matrix and the plurality of cycles executed during transformation.

14. The system of claim 1 , wherein the processor is further configured to transform an x-dimensional surface back into a binary string.

15. A method, comprising:

generating an input string by a server;

electrically coupling a processor to the server, receiving an input binary string as an input from the server, using a decision matrix to determine via a plurality of cycles what a next state of a plurality of target cells being transformed will become to produce an output binary string that is a cryptographic key.

16. The method of claim 15 , further comprising linking the output binary string to the input binary string by the decision matrix number and the plurality of cycles.

17. The method of claim 15 , further comprising determining a next state of the plurality of target cells, which is dependent upon a plurality of surrounding cells.

18. The method of claim 15 , further comprising identifying a substructure that includes the target cells and their surrounding neighbor cells.

19. The method of claim 15 , further comprising performing transformation using a bitCube, and the substructure is a unit bitCube.

20. The method of claim 15 , further comprising performing transformation using a bitSquare.

21. The method of claim 15 , further comprising performing transformation using a hyper bit cube.

22. The method of claim 15 , further comprising performing transformation using a penteract.

23. The method of claim 15 , further comprising converting the input binary string from a hexadecimal number.

24. The method of claim 15 , further comprising transforming the input binary string to a chosen x-dimensional surface.

25. The method of claim 15 , further comprising selecting a decision matrix to transform the input binary string.

26. The method of claim 15 , further comprising transforming the input binary string until an exit condition is met after an unknown plurality of cycles is executed during transformation.

27. The method of claim 15 , further comprising storing the decision matrix and the plurality of cycles executed during transformation.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 10, 2025
From: KINSEY, BRAX
To: NIDAVELLIR HOLDINGS, LLC
Reel/Frame 073077/0432 →
Continuity (1)
Related Publication 20240039716A1 · Feb 1, 2024