I think I’ll let someone better qualified take that ![]()
Yeah, hopefully. My sense is that it’s not an easy problem to solve, but if anyone can I’m sure it’s the Maidsafe team!
It looks like perfect distribution of nodes all over the world is unsolvable task.
First of all, because such perfection is even hard to describe.
So the goal is more like make chances of bad distribution is as low as possible.
If I’m understanding you right, would the cost of the computing power required be sufficient to put off an attacker who correctly performs the task before getting up to their nefarious business once on the network? It almost sounds like a mini version of the proof of resource which I believe is constantly happening on the network anyway.
What matters is a stable boot, rather than who that is - looking to those with skin in the game as MAID tokens or by extension those who are trusted and passed tokens, its an extension of Maidsafe doing it… rather than random crowd.
Personally I wonder the approach to take is that it’s booted and rebooted until it’s stable enough and then switches to a real network, with the liability that is for currency etc.
If a testnet becomes large enough… it becomes the network live… just needs that option to see updates action without reboot…
tldr; you don’t need a cold boot.
edit: just to note that this would require a fix to wipe data from the testnet perhaps.
It’s effectively a proof of work which is inherently centralising.
Ideally we need a function that is really cheap for an ordinary user on a PC but which gets expensive very quickly if you try to do it at scale. I think that’s a really hard problem! If not impossible ![]()
Apologies if this has been answered, this thread is a bit of a bear to stay on top of.
Are nodes going through resource proof for this test network? If so what are the requirements?
And … it works now, with UPnP enabled on the router.
Resource proof now is just some CPU work, it’s not like previous testnets where there was upload speed tests etc. The requirement is easily handled by any cpu (even pi), but it’s not nothing and that is important.
Go back and read it all you slacker! Consider it a proof of work ![]()
If you don’t read it awe yer no gettin in!!!
Pfffffft.
I was up at 4am yesterday to be home in time for release and I was up at 3.30am this morning to make up for being home early yesterday too.
Proof of work and then some!! ![]()
Proof of resilience.
Actually it’s one kind of approach that could work. A challenge set by one person in order to join, assigned to a random other also trying to join, which they must answer. By submitting two proofs, one of having set a question that’s answered correctly, and one of answering a question correctly you join the real queue.
Probably proof of I need a life ![]()
This is pretty similar to recaptcha, no?
Accept a slow clap ![]()
Partly just a guess, but it seems to me that the best defense against centralization would be to simply keep the entry requirements low and acceptance close to random.
Right now it would be a completely stupid waste of time to try and earn a Bitcoin by running an unmodified RPI (or any other commodity hw). But if a PI is all you need have a shot at getting in, the defense is the number of people who can afford something so simple.
Can I increase my chances of winning the raffle by buying up half the tickets? Sure, but if the tickets only cost a dollar there is still a 50% chance some other rando beats me out with pocket change.
Swamp evil doers with volume, is a nice idea - but requires a broad awareness that perhaps will not be there until established; so, bit of a catch22.
