Alright, the final strokes.
Decentralized P2P DNS System Design version 1.4.
Changelog1.
Non-linear block chain, block treeEach
Namespace will have its own block chain, its own activity, its own
PDiff, and thus, its own domain operation price.
Total namespaces isolation. I2P namespace and chain branch will not contain any data from Tor namespace and branch and any other. And visa-versa.
Small namespaces will have small domain operation price. Bigger namespaces will have bigger one.
Attack on single block chain branch will not affect other branches. And attack on whole DIANNA block tree will be just huge, difficult work.
2. Single
domain transaction contains only 1 input and only 1 output, and both about single domain. So 1 domain = 1 transaction. And nothing else.
Since miners process only domain transactions which were directly paid with fee for them, there is no need to include many domain operations in single transaction.
This also will make domain lookup easier. So the
authoritative domain reply lookup will be as follow:
For first, DNS client queries for particular domain and network returns a last domain transaction hash and block hash. Highest block wins - as always. Here client can verify that block hash is present in local headers chain and has a particular height.
For the second, client queries the network for Merkle Tree branch for needed domain transaction and transaction data itself. Here he can verify that transaction data are correct by reassembling Merkle Tree and comparing its root hash against local stored block header in chain.
Since client ensured that network returned *valid* *last* transaction for this domain, he can easily resolve domain into VALUE containing in transaction output.
Peace a cake
I need volunteers to code this tree of freedom. Primary, I need the project manager which will coordinate programmers. For the first steps I can be ideologist, project manager and programmer in one
But I really need a help.
