On Wed, Aug 30, 2000 at 10:56:06AM -0500, david at aminal.com wrote: > On Tue, Aug 29, 2000 at 09:08:06PM +0700, Oskar Sandberg wrote: > > > > <snip> > > > > I agree about making optimizing routing high priority, though I think that > > "- decentralized node discovery " (which you have listed as 0.6) is > > actually a big part of that since I believe the "backwards" only nature of > > reference created through inform, and the fact that inserts are reversing > > the datastore vector, hurts routing. > > > > <snip> > > > > I don't understand what you mean by 'reversing the datastore vector'. If > you have time, could you expand on that a bit?
When requesting, the reference in the datastore is set back towards the source of the data. This reference is towards a node that was achieved after more sets of routing then the current node. When inserting, it currently sets the reference back to the node the data came from. This node towards a node that was achieved after less routing then the current node. Besides not being ideal for routing, I also see this as a security issue, since it makes it easier to retroactively track data back the inserting node. > I've been thinking a lot about the datastore, and I'd like to document its > current behavior, and then perhaps try some Serapis experiments. Given that > datasore behavior is so critical, I think it's worth spending some time > on it. Yeah, me too. It was my intention to get to that after finishing 0.3 but before going back to school, but school starts on Monday, so I don't see that happening. But the whole "fail out of University" thing never seemed to hinder me before, so... > > David Schutt > > > _______________________________________________ > Freenet-dev mailing list > Freenet-dev at lists.sourceforge.net > http://lists.sourceforge.net/mailman/listinfo/freenet-dev > -- \oskar _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
