How is this structure fundamentally different from the tangle, i.e. what IOTA is doing? What is the consensus model? How do you handle Double Spending? What are some of the various attacks that can be done with this model?
Thanks for questions.
This structure is fundamentally different in actually one aspect - abstract position of a node (tx or other native object) plays a role in further processing. Which is fundamental. Of course, down the line, all is being casted into graph of dependencies (and finally onto linear stream of bytes). Handy analogy here is in 3d emulation in games or other software. Some operations are first performed between 3d objects (like raycasting for instance), some are performed using graph representation of scene layout (FOV), finally all lands in some files. Each abstraction uses different properties of objects in question.
The consensus model that I prefer to apply is adjusted to this scheme PoS.
DS - as above.
Yet, I can change my mind in near future as I recently stumbled upon several interesting properties of my network that can be used to simplify consensus.
Attacks - depending on whether fully homomorphic entities work as expected, this network will not be forkable, thus no 51%. As to other attacks - Sybil is mainly a matter of chosen p2p base. I have to decide yet which one to use. Attacks based on mining would probably not apply. Also the time frame of confirmations from the network can render unconfirmed txs attacks futile. But the above is just an initial analysis that I can provide now, some factors can change situation in the future.
But at the same time it provides means for features like lattice encryption.
Can you expand on this? I don't see how lattice encryption can be achieved from this structure.
Lattice is a structure where distance plays a role. For instance, shortest one. Or rather determination which is the shortest provided having some basis initial vectors supplying initial conditions. My structure actually is L^2 vector space. And on many steps I can provide a set of non co-linear vectors to leverage SVP or its variations.
Up to the point that one of the features in my idea acts exactly as synapses and I also postulate homomorphically encrypted seeded entities acting as local authorities and being "hidden variables" of this network, something that can be compared to a primitive consciousness.
I'm having a hard time parsing this statement. What are the local authorities doing with HE? And why bring in hidden variables to the mix?
Bear in mind that I tried to answer questions you found in FAQ in simplest way I could. Not always succeeded
.
Local authorities are meant to be encrypted small programs that produce both encrypted and plain (or encrypted with known keys) output. As to hidden variables - they are meant to be the source of such variables. Variables that are intended to give incorruptible base for further operations.
In homomorphic transformations leading to certain arrangement of lattice[.]
What precise transformations?
Here again is a problem with 'lattice' and 'lattice' in two meanings, I suppose. Short, two points cannot occupy the same place in metric space. In such case they are equal. Moving a set of points by a vector in metric space preserves their structure. And so on...
Those who will need to know details will read the whitepaper and associated docs. All math will be there. The rest will have dev docs aimed at providing comfortable interface.
I hope that's true as the current math available to this idea is extremely lacking ...
I'd like to point out that this is very early announcement. And contrary to popular trend I prefer having fully functional and reliable scheme before publishing, instead of running all the time on beta versions
.
And when I'll be damn sure about my postulates, I'll publish all in detail.
