Is it possible to only be minable on 1? More to the point, the coins themselves are RSA keys, (p*q where p,q are both prime). There are two ways to add a coin to the chain, A) solve some problem, probably the same one bitcoin uses for mining, or B) prove that you you know p,q for some coin that already exists (you do not need to show which coin you know). 

The concept for spending a coin is that the receiver sends you p*q, and you use method B to add p*q as a coin to the chain, while providing a proof that you know (p,q) for a coin already in the chain, and some function of that coin so that you cannot spend it later.

The plan is to create a new chain entirely. The main reason we were interested in bitcoin was using its existing code base to handle the block chain (and probably mining). Seeing as how this is proving much more difficult than we expected, we are giving up on using bitcoind code, and will start from scratch.

Thanks for the link.
It looks like what they are doing is making is easier on the UI level to keep you bitcoin identities seperate. What we are working on is a protocol level change where you cannot determine the bitcoin identity of the sender in the first place.

We're trying to create a system were you can spend coins anonymously. We plan on doing this by adding OP_GEN_ANON_COIN and OP_VERIFY_AONON_COIN to the script op_codes, and then modifying the script to use them. We know how to do the first part, but have been unable to locate where the script is defined.

I am working on am anonomized version of bitcoin.
I have added an OP_CODE to script.cpp and script.h, however have been unable to figure out how to create my own script to utilize it.
grep`ing the source code for bitcoind and bitcoind-qt for select OP_CODES did not produce results outside of the script.* files.