Here is how i propose it will work:
A block has 6 segments
0. Block ID (sequential #)
1. Data
2. Public key
3. Address hash
4. Transactions (just like BTC or LTC)
5. Append
Two block chains exist, a full chain, which has the data block and a lite chain, which has no data block. A given node has full lite chain and as many blocks of full chain as user specified space allows.
Network will accept a request to "change block segments 1 through 3" only from the node that has address which is the result of hashing the published hash using the published key. (think RSA asymmetric keys here)
When ownership of the block is being transferred:
1. Owner, who currently has the private key generates such a hash that when encrypted with public key results in the address of the buyer. (basically owner has to decrypt new address using his 2 private primes)
2. Owner submits the block to the network for update.
3. Miners find such an "append" string that the contents of the parts 1 through 5 match a standard hash.
4. When append is found the block is now accepted by the network.
5. At this point the buyer can request the network to update the block again, but this time the new owner will provide new public key and new hash for his own address, which match his private keys. Owner can also provide new contents for the "Data" segment.
What yall think?
2 blockchains
Maybe you need to check with DTC developer.
Btw, to remove/change a data in any chain, you have to destroy the chain, not just change the block. Changing a block in a chain will changed the whole chain & in turn, split the chain.
Your suggestion is a bit different from my colored chains structure. Not sure about DTC's "personal chain" as not much news about it have been released.
For my "colored chains", there is a base chain where everyone operate on & the other "colored chains" are linked to the individual features. There will be a storage chain where the data is stored, & referenced to in the base chain transaction. To achieve "temporary storage" we will need to create sub colored chain which will be destroy when there is a removal/change of the data.