1) The document discusses representing numbers in binary and partitioning the counting of numbers from 1 to infinity in a way that relates to the digits of pi. 2) It assigns scores of 0.5, 1.0, or null to partitions based on whether they contain an even or odd number of zeros, and sums these scores. 3) The partitions with null scores up to a given point correspond to prime numbers, suggesting prime numbers are fundamental building blocks in nature like atomic operations in a database.

1. PRIME NUMBERS
Counting 1,2,3,4,5,6,7,… in binary
1,10,11,100,101,110,111,1000, etc.
Removing the delimeter commas, we get,
110111001011101111000...
Enumerating the digits of pi, we get,
[3.]141592653589...
Treating the digits as virtual abstract bit positions to be filled in by actual bits,
1 has 1 bit
4 has 3 bits
1 has 1 bit
5 has 3 bits
9 has 4 bits...etc
Partitioning the count from 1 to infinity, likewise,
[1],[2,3]... : [1][101,1]...
Pi: [1],[4,1]…
The second partition has odd number of zeros. If a zero had a score 0.5
Then this would be 0.5. The first partition has no score or NULL.

2. Counting further,…
[4] … : [100]…
Pi: ...5...
The second partition has even number of zeros, score = 1.0
Counting further...
[5,6]: [101110]
Pi: ...92....
The third partition has even number of zeros , score = 1.0
Counting further...
[7]: ...[111]…
Pi: … 6 …
The fourth partition has no zero or NULL score
Score Set upto 4th
Partition = [0.5, 1.0, 1.0], Sum = 2.5
[8,9]: …[10001001]
Pi: … 535...
The fifth Partition has odd number of zeros, score = 2.5
[10]: [1010], Score : 1.0
Pi: ...8
[11] : [1011]: Score: 0.5
Pi: 9
[12,13,14]: 1100110111110: Score = 2.0
Pi: 79323
[15]: 1111, Score: NULL, Score Set: [2.5, 1.0, 0.5, 2.0] , Sum = 6
Pi: 8

3. [16, 17, 18, 19, 20, 21,…] 100001000110010100111010010101101101
4 6 2 6 4 3 3 8 3 2 7 9 50
Total Score Upto 0 in Pi: 19*0.5 = 9.5
This is an incomplete Partition.
The first Riemann Zero is 14.1314...
The second Riemann Zero is 21....
The first non null partition before the first zero in Pi is upto count 14.
The first zero in Pi is upto count 21.
When we start counting again after the first zero in Pi, we reset the count to 1
and count again 1,2,3,4,… upto next zero in Pi. However the score from the
incomplete partition is added to the next complete partition.
The Partitions upto the NULL score partitions which don’t have a 0.5 score are
the prime partitions: 2, 3, 5, 7, etc.
This is a fundamental science. It signifies, that Nature has building blocks for
everything. Prime Numbers have atomic operations like in a database. This is
not possible with Composite Numbers because they are at the 0.5 boundary.