693 |
-one or more blocks are associated with a specific urn-5 |
-one or more blocks are associated with a specific urn-5 |
694 |
-support for location independent routing (urn-5 -> block(s)) |
-support for location independent routing (urn-5 -> block(s)) |
695 |
-data block can represent a link, document/part of document, transclusion |
-data block can represent a link, document/part of document, transclusion |
696 |
|
-must perform well under DDoS attacks |
697 |
|
|
698 |
|
|
699 |
3.3. Benefits |
3.3. Benefits |
700 |
From Benja's (plus antont and me) article |
From Benja's (plus antont and me) article |
725 |
-for every urn-5, there is one permanent ID |
-for every urn-5, there is one permanent ID |
726 |
-for every version of block, there is one permanent ID |
-for every version of block, there is one permanent ID |
727 |
-for every version of xu link, there is one permanent ID (does transclusion have different versions ?) |
-for every version of xu link, there is one permanent ID (does transclusion have different versions ?) |
728 |
-for every version xu transclusion, there is one permanent ID (does transclusion have different versions ?) |
-for every version xu transclusion, there is one permanent ID (does links have different versions ?) |
|
|
|
729 |
|
|
730 |
4. Gzz overview |
4. Gzz overview |
731 |
|
|
767 |
2. We see it as a DATA LAYER for a new rational system of computing. The grotesque inconsistencies and complications of files in their present form-- consider, for example, the issues of readdressing among downloaded HTML files-- may be replaced by a clean, table-like arrangement which keeps track of things more easily-- and which bright non-tekkies can deal with. |
2. We see it as a DATA LAYER for a new rational system of computing. The grotesque inconsistencies and complications of files in their present form-- consider, for example, the issues of readdressing among downloaded HTML files-- may be replaced by a clean, table-like arrangement which keeps track of things more easily-- and which bright non-tekkies can deal with. |
768 |
Tomorrow's computer environment will involve vast, constant media downloads. ZigZag structure offers a scalable, rational system of registration and storage which can handle this very cleanly. |
Tomorrow's computer environment will involve vast, constant media downloads. ZigZag structure offers a scalable, rational system of registration and storage which can handle this very cleanly. |
769 |
3. A new form of SPATIAL PROGRAMMING, table-driven in zzspace, may simplify programming and computer environments in general. |
3. A new form of SPATIAL PROGRAMMING, table-driven in zzspace, may simplify programming and computer environments in general. |
770 |
|
|
771 |
|
5. Security |
772 |
|
-Could we use SDSI/SPKI in our system (it's hierarchical), like in ConChord |
773 |
|
-is there any other implementations of SDSI/SPKI-like systems ? |
774 |
|
-SDSI/SPKI is not optimal for us, but somewhat working solution |
775 |
|
-in our model: trust = trust knowone |
776 |
|
-give a brief explanation of current techiques in accountability and trus |
777 |
|
|
778 |
|
Tuomas' example scenario (in finnish): |
779 |
|
|
780 |
|
jos joku sanoo, ett? urn-5 foo on blokeissa X |
781 |
|
ja j?tt?? blokit Y pois |
782 |
|
miten systeemi selviytyy ? |
783 |
|
eli kuinka pahasti pystyy mit?kin spooffaamaan, mill? todenn?k?isyyksill? |
784 |
|
tai jos vaan ei haluta antaa joillekin koneille jotakin blokkia |
785 |
|
niin miten helppoa on organisoida sellainen hy?kk?ys |
786 |
|
tai halutaan hukata verkosta tietyt blokit |
787 |
|
floodaamalla indeksi |
788 |
|
mutta sitten poistamalla ne serverit |
789 |
|
|
790 |
|
What will happen if, jyu's network connection is broken ? Inside jyu, how do we will self-organise ? |