The code should replicate the behavior as listed here: http://firstbits.net/about.php
Basic logic should be as follows:
1) Gather all Bitcoin addresses from a block.
2) Compare first two characters of first address in the block to firstbits table.
3) If a match is found in the table, add another character of the address and repeat.
4) Once it is not found, add temporary firstbits into an array and move on to the next address.
5) At the end of the block, compare all temporary firstbits found from addresses in the block to each other. Resolve any conflicts by adding characters to conflicting addresses.
6) Add completed list of firstbits to firstbits table.
Other requirements:
- Must store data in a MySQL database
- Must use either PHP or python (or both)
- Must be able to connect to a bitcoin daemon (bitcoinQT) to gather the addresses
- Must be able to compute and store firstbits with additional length (i.e. 1sgtspike and 1sgtspike5 must both return 1SgTspiKe5HHkjdSeD72q9WsiJhRiaxf9)
- Must be publicly hosted to github upon completion
Bounty: $200 of BTC.
Now I realize the bounty is low for a job of this complexity, so if someone else wants to help chip in a bit more to the bounty, please do so! It would be greatly appreciated.
Any questions? Any volunteers who wish to code this?
ABE is open source and has this functionality
EDIT: Forgot to mention, I have someone who has set out to build the system and claim the bounty.