how can 0 be a repository

if you take 1 and replace it with 0 you can make a repository out of 0

01
10 <--save 0 and move it to a pile

0 <--pile zero
then take 1 and move it to another pile

1 <--pile 1
then take 0 and move it to the next position in a NEW pile

-----------------------------------------------------------------------------
__ <--transistion possible 0 <-- zero repository transition

so now we can divulge that 0 can be a formal repository

0 respose 0 repose 1 1 1
three repose 0 1 repose 1 respose 1
0 repose 1 align reposotory

alignment with 0 repository

00000000 <-- zero repository
1                 <-- one repository transistion in ZINCID plane

0 repostory 1 transition high order bit transition in respository
1 align repository 0 repose 1 order bit high in array tranistion SZ
one S or stream 1
one Z or compress respository 1sz low character bit in high order drain bit entropy field
one high entropy bit field
one low entropy bit repository
one low bit
one high bit
one high draft number
one low draft number
align low compresser aLrithm'im over time to high order bit drain low repository transition to new bit pos __aligntranistionxenundraft

in this instance a xenun draft is much like a term where the repository is a stream where the position of a bit is depending on a character array so'a in term the character array is in term symbian for xenun draft where possible'sza RARE bit/byte thqoursuse is term seliac orbein.



0 or 1
repository 01
0 orbein xenun tranistion draft aLrithm'm
0 align orbein transistion field byte culture 9cntensorsupportalign
1 orbein high order bit tranistion out of repository
0 high low order where repository is in high order where character byte culture 'a' is term or prime feedback MAL

in order M A is hive where high andject L is depth draft xenun possible transition 'a' in order repository
in M 'a' is term or where high in order characters the depth of possible transistion is in order hive shift andject  'a' ?

how one number is a

in a number qual 'a' is the term eil work no wall. in one term a is formal and in the sum of a letter the term of a number is a notion in order that a is not altogether a formal letter. in notions ide the formal weight of a is somewhat in a sense a number in that all formal letters are higher in order than original to many of amounts of terms before the litter of how a number is notion formal without the term in formals a hive notion that notion formal letters contain songs in a flat kermeliad in prime number shift orshifcht stream teganon or compression. in the term compression a letter is formal to move about the way of space where formally a number in term compression symbian for movement - 1 orare song in movement of space.

how to start on a good compression concept

if you take 0 and 1 and 1 and do this as follows:
0 1
1 0 <-- switch numbers simply
you get a good idea about how to possibly move around in a type of way in which binary numbers can be simply tangible.
here is somthing else:

01011010 <-- 8 bits for one character i.e. 'a'
01011010
10100101
01
1
0 <-- then you get a number without any bits now think about this:

101
010
101
010
101
010
101
010

the way about this comes to be difficult surrounding the way data can be compressed with binary orders

01010101
1
01 <-- take 0 and move it to the 8th place and you get

1 <-- take the first place and you get
0 <8th place> <transistion 1> [first place transition ghf or three dry nature high order number moxive array]
here we can place 2 binary numbers in 1 place with one whole character with 8 possibilities in a notion formal where the complex in the notion to 'bath' the character with another simple way to make it binary in a ema qual

if you take ema and 2 binary numbers you can wrap 3 ways to characterize how they are 3 streams in one number

e = 0 binary assumer
m = character high order bit entropy ema field
a = high order character stream compression result

a = 1 where m is a where 2 binary numbers assume a transistion
m = 0 where a is 1 character where 1 binary number assumes a field of 8 possible tranistions in a stream compression assumption
e = 2 1 a m 01 e-(minus the transition) where a character is dry in a field of compression possibleSZ where 1 number is a in a square assumption

if e in field of a and m is depth then 0 and 1 are depth field possible moxive character drain compression
in a depth, a is the square of m where e isnt likely to be the depth of a character but the term of a f where particularly fast in a type of way is how a number moves slowly in relation to how fast a depth is slowing down on the other side of a line assumption hyperbole called a qual field

for instance, 1 has two sides and zero can assume 1 flat depth where two sides are triangles where 0(zero) can dry the sides and 1 can push the sides in a term where charactervily the way about to push can be orderd in empti shifts or dry assumes dry always in empti triangles.

allow me to take a break....