# US 11,029,877 B1 · Efficient primal computing system

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

- Number: US 11,029,877 B1
- Document ID: US11029877B1
- Status: Granted
- Kind: B1
- Application number: 17/114,387
- Filed: 2020-12-07
- Granted: 2021-06-08
- Earliest claimed: 2019-12-07
- Applicants: John J. LeTourneau
- Inventors: John J. LeTourneau
- Web page: https://patentgrep.com/patent/US11029877B1

## CPC

- G06F 3/0655: {Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices}
- G06F 7/60: Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations {, e.g. using difunction pulse trains, STEELE computers, phase computers (conversion of digital data to or from non-denominational form H03M5/00, H03M7/00)}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0676: {Magnetic disk device}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F 9/4401: Bootstrapping (security arrangements therefor G06F21/57)
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computing system and method. The inventive system comprises a user interface for providing user input and output and a RASP controller operationally coupled to the user interface. The RASP controller includes a central processing unit implemented with a microprocessor adapted to program instructions stored in a tangible medium and at least one RASP registers configured to store encoded data. A RASP formatter is operationally coupled to the RASP controller and a RASP memory operationally coupled to the RASP controller and the RASP formatter. A boot memory provides program instructions for execution by the central processing unit whereby computing system effects data storage and retrieval using a primal file structure. In a more specific implementation, an input buffer is included and adapted to store electrical signals representing an arbitrary finite data sequence. The RASP formatter is operationally coupled to the input buffer and includes a converter adapted to convert the sequence into a natural number. The RASP formatter further includes a divider (multiplier?) operationally coupled to the converter and adapted to factor the natural number. The RASP formatter further includes an adder operationally coupled to the divider and adapted to concatenate indices of the factored natural number to form a primary binary string and store the primary binary string in the RASP memory.

## Claims

### Claim 1

An efficient primal computing system comprising:
a user interface for providing user input and output;
a RASP controller operationally coupled to the user interface including::
a central processing unit implemented with a microprocessor adapted to program instructions stored in a tangible medium and
at least one RASP registers configured to store encoded data;
a RASP formatter operationally coupled to the RASP controller;
RASP memory operationally coupled to the RASP controller and the RASP formatter; and
a boot memory operationally coupled to the central processing unit and including program instructions for execution by the central processing unit,
whereby the RASP formatter and RASP memory operate under the control of the central processing unit to effect data storage and retrieval using a primal file structure, said primal file structure defining a B-tree structure and said B-tree structure being part of a forest of B-tree structures, wherein each root of said B-tree in said forest of B-trees is named by a prime natural number larger than two, said prime natural number being expressed in primal notation and further wherein said prime natural number is the left component of a primal ordered pair.

### Claim 2 (depends on 1)

The computing system of claim 1 including an input buffer adapted to store electrical signals representing an arbitrary finite data sequence.

### Claim 3 (depends on 2)

The computing system of claim 2 wherein the RASP formatter is operationally coupled to the input buffer and includes a converter adapted to convert the finite data sequence into a natural number.

### Claim 4 (depends on 3)

The computing system of claim 3 wherein the RASP formatter further includes a multiplier operationally coupled to the converter and adapted to factor the natural number.

### Claim 5 (depends on 3)

The computing system of claim 3 wherein the RASP formatter further includes an adder operationally coupled to the divider and adapted to concatenate indices of the factored natural number to form a primary binary string and store the primary binary string in the RASP memory.

### Claim 6 (depends on 1)

The computing system of claim 1 wherein each root of each B-tree structure is defined by a natural number expressed in primal notation.

### Claim 7 (depends on 6)

The computing system of claim 6 wherein each unique root of each B-tree structure is identified by a prime natural number larger than 2.

### Claim 8 (depends on 7)

The computing system of claim 7 wherein each unique root of each B-tree structure is stored as the left-hand element of an ordered pair.

### Claim 9 (depends on 8)

The computing system of claim 8 wherein said encoded data is comprised of binary primal strings forming a random access table.

### Claim 10 (depends on 9)

The computing system of claim 9 wherein said random access table uses fewer than O(2 k Log2(k)) bits to represent the first k elements of said random access table.

### Claim 11 (depends on 6)

The computing system of claim 6, wherein the first element of said random access table is the finite binary sequence <0>, and the second element of said random access table is the finite two-long binary sequence <10>.

### Claim 12 (depends on 7)

The computing system of claim 7, wherein said random access table is based on the natural number index wherein the kth element of said random access table <11> RAT(j), where RAT(j) is the jth element of said random access table, if q(j)=k, and RAT(j) is the 0/1 dual of a power of 2 when read from right to left.

### Claim 13 (depends on 8)

The computing system of claim 8, wherein said random access table is based on the natural number index wherein the kth element of said random access table <1> RAT(j), where RAT(j) is the jth element of said random access table, if q(j)=k, and RAT(j) is not the 0/1 dual of a power of 2 when read from right to left.

### Claim 14 (depends on 10)

The computing system of claim 10, wherein each root of said B-tree in said forest B-trees is named by a unique prime natural number larger than two, and wherein a binary primal sequence is associated with said unique root of said B-tree, and further wherein said binary primal sequence is stored as the marked position in the right-hand element of a primal ordered pair.

### Claim 15 (depends on 11)

The computing system of claim 11, wherein each root of said B-tree in said forest B-trees is named by a unique prime natural number larger than two, and wherein a finite multiset of binary primal sequence is associated with said unique root of said B-tree, and further wherein said binary primal sequence is stored as the marked positions in the right-hand element of a primal ordered pair.

### Claim 16

An efficient primal computing method, executed by an efficient computing system, comprising the steps of:
inputting, by a central processing unit implemented with a microprocessor adapted to program instructions stored in a tangible medium, a finite binary string;
converting, by the microprocessor, the finite binary string into a primal binary string;
storing, by the microprocessor, the finite binary string in a random access table; and
organizing and manipulating, by the microprocessor, primal binary strings in the table in accordance with operations allowed by the rules of a B-tree based programming language that allows only equality queries and the binary adjunction operation.