To divide one coin up into 10^36 of bits covered by special bytes.
Instead of the value of your bits remaining the same value the value of your bytes can very much act like a credit score.
The more you use the bytes and don't try and defraud you rating the better your chances.
Building associative trust is the name of the game here.
All of the coin is regularly checked to maintain parity of 100%.
If you do not use any of your trust^byte after a year your trust bits are re dealt into the pack and you have start again.
Trust^Bytes are not aimed at being useful for trading most products as their value would not be stable enough for years.
Trust^Bytes are aimed to act as a currency for micro-credit payment issues like buying small Wav files, PNG art, GIF Art Some app types or to pay you for certain web work that sort of thing including donations.
Trust^Bytes are fast to do transactions with and can work with the cloud.
Trust^Bytes would have a relative value to other currencies like all other valid currencies that people put on them.
Trust^Bytes can be expanded to represent new bounties to reward types of internet activity desired by the bounty offer.
Trust^Bytes can be used to verify your trustworthyness without revealing your true identity.
Trust^Bytes can adapt as computers get more powerful to maintain a degree of security but absoluteness of one coin in circulation can be keep with in a small margin of error.
Trust^Bytes could allow you to store data pieced out to people such to mitigate someone taking other crypto currencies off of your computer as a form of theft protecting and data banking with the crowd.
Trust^Bytes rely on information theory for security and User chosen asymmetric encryption.
So how do Trust^Bytes work.
Trust Bytes work like this is a trust byte in its most simple essence.
The communications of output 1 and output 2 carried via encryption every time you want to give some of your Trust^Bytes away where you keep back up with the trust network of the exact amount given away. Trust chains can be made using this technique using the same Trust^^Byte however much the users like and you can back track to prove you were given the money.
The coin data is shared with a second or third party to back your trust claim to the money as authentication. The bits in the bitkey encode step information as to how many steps have been use more steps = better security with more compute time needed to break it and only you and a selected few know the Bitkey you made during the transaction and original Input.
This encryption method can be back tracked properly if the key is shared with others during giving the Trust^Byte over.
Before you transact the coin you remodel the Trust^bytes to about the a Trust^Byte worth you want to give also a second Byte is made from networked connections which gives you a rating. this is transferred to trustworthy group of algorithmic choosing based on ratings. The rating systems are backtrack collectively every hour by the users to ensure
parity of the Main Coin. If you claim you have more than current trust coin node information suggests your value misinformation is noted in Distrust Bytes which are effectively coins that can go up in value and you don't want a lot of them it is collectively chosen relative to fraud and distrust coins count against your Trust^Bytes.
there are 2   's in the word Trust^Bytes because the 2 outputs allow verification which is key to the whole process.
for Share Information Bytes(Like bits of a bitcoin) can earn trust value or negative value allowing the network to choose over time what additional information should be stored.
If someone shares say all the bits of your bitcoin ect then they can automatically earn distrust points for using it and the Blockchain anyway should back you up also so Trust^Bytes can earn you distrust over block chain fraud and giving to different groups with high trust should prevent the groups from breaking trust plus you could have bit that are missing hidden or even written down in case of fraud.
As you can see Trust^Bytes are a very experimental idea and could be added to to improve security but they could be useful to spread love to all those little makers of little things on the net you want to donate and assist more for their efforts and they are not a very useful currency but they are quick to make use of.
The example encryption algorithm I would use here to test the concept.
5 step example
Would be this
input number converted to 2 input numbers where by you use number split pattern a or number split pattern b
N when 1=(1,1)^, 2=(1,2), 3=(2,1)^, 4=(1,3), 5=(2,2), 6=(3,1)^, 7=(1,4), 8= (2,3), 9=(3,2), 10=(4,1)^...ect
N when 1=(1,1), 2=(1,2), 3=(2,1), 4=(3,1), 5=(1,3), 6=(2,2), 7=(3,2), 8=(4,1), 9=(5,1), 10=(1,4),11=(2,3),12=(3,3),13=(4,2),14=(5,2),15=(6,1),16=(7,1) ...ect
Then for the 2 outputs of the last step you use pattern a or pattern b.
Then for the 4 outputs of the last step you use pattern a or pattern b
Then for the 8 outputs of the last step you use pattern a or pattern b
Then for the 16 outputs of the last step you use pattern a or pattern b
now you have 32 data fields take these data fields and go in reverse picking the opposite methods than what was chosen for leading down to 32 data fields as you come back 5 steps up to one data field.
With your input and output given it's hard to work out the key with out that data to hand and with only the output given its
hard to know original input without the key.
The more steps you use the harder it gets due to more and more data loss depending on the size of the input number and there are many ways to tweak this technique to get even better results..