Observe as I encode some samples;

A=65
65=64+1
8-bit binary=01000001
6-bit binary=010000+010000
10000=16
16=QQ
A=(QQ==)

AA=6565
65=01000001
16-bit=0100000101000001
6-bit=010000+010100+000100
010000=16=Q
010100=20=U
000100=4=E
AA=(QUE=)

B=66
66=64+2
8-bit=01000010
6-bit=010000+100000
010000=16=Q
100000=32=g
B=(Qg==)

Blar
B=66, l=108, a=97, r=114
66=64+2, 108=64+32+8+2, 97=64+32+1, 114=64+32+16+2
32-bit=01000010011010110110000101110010
6-bit=010000+100110+101101+10001+011100+100000
010000=16=Q
100110=38=m
101101=49=x
100001=33=h
011100=28=c
100000=32=g
Blar=(Qmxhcg==)

As you have witnessed, I have cracked the code for the Base 64 system encryption by finding the ASCII values (thanks, google) of each individual character, and translating those into Base 2 in 8-bit clusters, meaning 8 digits of binary per character. The digit pattern is 128, 64, 32, 16, 8, 4, 2, 1. 
By converting the buffered stream of binary into 6-bit clusters, which follows the same pattern above, excluding 128 and 64, and adding zeros to fill in the closest divisor by 6, you get a set of 6-bit characters which each index a specific letter/number called the Base 64 Index, each adding a new letter/number to the encoded string. The equal signs are basically fillers, being that the encoded string length MUST be divisible by 4, thus to keep a balance alive that is hard to explain in this blog. 

Note: this code is a two-way code. It can be decrypted easily. And on another note, the above examples were all done in my head, except for the ASCII values. I have not yet tested the codes on a decryption yet. Feel free to test for me, for I would rather trust my own brain to further amaze people with my ability to think in the same logic as a computer. 

Now, I must rest. I am hearing a ringing in my ears right now, it's time for my mind to rest. 
Goodnight.