I know this is silly so don't tell me it is silly.
I threw the code snippet together quickly so don't critique the code, it is for illustration purposes only.
I am willing to throw a small amount of BTC your way if you do this for me (I am too busy). Please PM me with your bid and a super short description of what technology you would use (Java, C++, database, etc.) to produce the result I want.
Here is what I want:
Scan through the entire blockchain and sort all the Bitcoin addresses found into "bins" by the first N letters. The number of possible bins is related to N as follows:
// Number of
// N possible bins
// - --------------
// 2 58
// 3 3,364
// 4 195,112
// 5 11,316,496
// 6 656,356,768
// 7 38,068,692,544
I think an N of 4 will be good as a first pass. If this turns out to be interesting then an N of 5 might be interesting.
For each bin 1111 through 1zzz I want to know how many addresses exit in that bin and how many of those addresses have positive balances. Here is a short code snippet to illustrate what I am looking for.
#include
using namespace std;
static const int N = 4;
// Number of
// N possible bins
// - --------------
// 2 58
// 3 3,364
// 4 195,112
// 5 11,316,496
// 6 656,356,768
// 7 38,068,692,544
char base58[] = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
int main (int argc, char *argv[])
{
cout << argv[1] << endl;
if (argv[1][0] == '1') {
int bin = 0;
for (int i=1; i
for (int j=0; j<58; ++j) {
if (argv[1][i] == base58[j]) {
bin = bin * 58 + j;
break;
}
}
}
cout << "Increment bin " << bin << endl;
// Here you would increment AdddressExists[bin]
// Here you would check to see if the address has a balance and if so
// increment HasBalance[bin]
} else {
cout << "Did not start with 1" << endl;
}
return 0;
}
At the end of the program produce a CSV file something like this:
0,"1111",5,2
1,"1112",0,0
...
195110,"1zzy",1,0
195111,"1zzz",2,1
