40 karma · joined February 22, 2018
What makes you believe that YOU know how it should be done? I am not saying that people shouldn't be nice but over and over and over we see these tech companies embark on social justice missions to set guidelines that end up backfiring because they underestimate the complexity of the range of possible human behavior.
At best, rules generally dont get enforced equally and at worst they become a disaster that affects the inner workings of what made the site worth visiting in the first place.
And this right here tells me what to expect will happen in the future
> the nice thing about problems that relate to how people feel is that finding the truth is easy. Feelings have no “technically correct.”
I love stack overflow and would hate to see it devolve into something that deviates from what it truly is about: code.
I think about time in a similar manner. The delta between point A and point B is the mutation state and point A is the initial state that was mutated into B.
1) The problem supply can be tackled in many many ways.
2) The verification problem is exactly why I stated NP as a problem class where the verification process is often relatively simple and straight forward. Obviously if that isn't the case then perhaps the problem isn't that well suited for this kind of environment.
3) The bandwidth issue is not something that I had considered. Makes absolute sense when you put it that way.
Serious answer: Things would obviously have to be designed differently. This isn't about distribution of "economic power to the hands of the people" or some other Satoshi notion. The thought I have is more along the lines of Folding@Home
> you can easily adjust the difficulty.
For Prime Factorization for instance, which like you say, isn't even NP-complete. You can easily adjust the difficulty by increasing the size of the number in question.
Edit: I understand that your argument is about the average case and not the worst case.
I am fairly certain you can design your problem to behave in a similar manner or in some manner that increases the complexity based on some criteria
> Is checking that the solution is valid a very fast operation?
That's the NP part in my question. Plenty of scientific problems out there that are fast to verify hard to compute. Ex. Prime Factorization
> Are we sure that there is no "final" answer which would make the calculation unusable at some point?
I would argue, and I might be wrong due to my ignorance on the subject here, that we can never "know" that. That's why P=NP is still an open question
I'm looking for someone to help me understand why the above isn't possible.
I quit my job as a Head of R&D for a major tech/publishing company and started https://tradedash.io (crypto desktop trading platform) with an old friend of mine who also quit his job as one of the first employees in a major fintech unicorn. For both of us, it was hands down the best decision we've ever made career wise.
For years we were depressed, working jobs that we didnt value only for nothing other than the money and stability. Even though I make a whole lot less today, I haven't had a single night where I don't sleep like a baby. Quitting our jobs was the easy part once we figured out what it is that we wanted to do.
For anyone looking to quit their job: figure out what to do next. Once you know what you want to do, everything else will become much easier.
The JS ecosystem as a whole needs to improve but as far as Electron goes, I must say that I am pleasantly surprised with how well it has been doing even though we are handling data from multiple exchanges at a rate that is not so trivial.