kzor for XOR like saying KZOR URL is much more fluid.
I am also against GIF pronounced like its mispelled JIF… GIF is gif!
kzor for XOR like saying KZOR URL is much more fluid.
I am also against GIF pronounced like its mispelled JIF… GIF is gif!
Not just to save on typing! The shortening of commands as much as possible was really to save on precious bytes when writing scripts! Back when 1 KB was a big deal and there were quotas of just a few KB on people’s home directories and getting a quota increase meant prostrating yourself in front of the BOFH, bribery or - even worse - filling out a form.
Makes sense. The typing thing was something my lecturer said (many) years ago, and I never really questioned it. Related to a story told here: The real reason why UNIX commands are short
Did Chat GPT learn its “Scottish” accent from a BBC Comedy?
So pishy it could have come from the Sunday Post. Utter cringe
Lol I agree
Structuring Networks with XOR | MaidSafe I thought I remembered there being an article from @dirvine about XOR which I had glanced at one time years ago and said: ah that looks good, must get around to that. Here we are now, coming full circle.
@Tristen if you haven’t seen that article, have a look-see. Some lovely graphs there too.
https://pdos.csail.mit.edu/~petar/papers/maymounkov-kademlia-lncs.pdf The original paper is my next port of call. I keep getting waylaid by other life obligations so progress is slow with days of pause, but what can ya do, I’ll keep plugging away.
In case anyone is interested in the slightly more mathsy paper, there it is.
Here’s a fun thought from today’s learning (Shortest distance between two points is not always a straight line | Metaquestions)
In 2512 address space, things are so stupidly large, that if we imagine 8 billion humans, and each has 1,000 connected devices all with distinct node IDs, and we ask ourselves: but what if 1,000 isn’t enough? How many node IDs would we have left over in case of an emergency?
The answer is: very, very close to all of them. 1,000 node IDs per human takes up a percentage of ~0.{139-zeroes}6% of the whole space.
Conclusion being - 1000 devices each is basically nothing. Or in the seperate 2512 address space for data chunks, imagine each human generating literally 100s of trillions of data chunks over a lifetime, and it’s just absolutely nowhere near taking up a large part of the space. The “real world” is a weird place.
The website of Jonathan ‘smuggler’ Logan is unfortunately gone, but thanks to the Wayback Machine and the Internet Archive, we can continue enjoying the articles. Here’s his article on DBCs which I believe had some influence on MaidSafe considering them as an option? Not sure of the timeline though of how it all happened.
Sidenote: I recently started archiving websites myself on there, it’s easy to do and I recommend it to anyone who wants to ensure future access to a website (while we await The People’s Network, of course).
I’ve moved on to DBCs now anyway in terms of learning, having got at least a good starting grasp on XOR and Kademlia. I had started getting distracted by metric spaces and abelian groups and whatnot the last few days so definitely time to leave it there.
There’s plenty of information scattered around on the forum about DBCs, but it is pretty scattered. Anyone who wants to jump in with resources, or a summary of how they understand it, go for it.
SafeNetwork DBC Technical Series - #21 by mav cross-posting this, which I rediscovered there while reading and browsing. A great-looking collection
This video that @Nigel posted many moons ago (cheers Nigel) about Pedersen Commitment:
Comes with a very serious website from Bill, who seems to be an absolute gent: Pedersen Commitment
And one thing you’d have to say about Bill, is he treats you like a grown-up. The full details in all their mathematical reality, a demo of the thing you can play with plugging in examples, real code examples, a Python REPL built into the page, it’s the real deal. He also seems to have practically everything on there, from what I can tell so far.
Try it out!
The libp2p resources are great too! Which I suppose is no surprise, but I hadn’t actually checked them out. This one here is on the DHT implementation. The libp2p github is worth poking around too, they’ve really put the work in to the documentation.
It’s worth browsing just for the graphs, even if you already have a handle on this stuff, I would say.