Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
bshanks
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
27 ms
·
241.
▲
by
bshanks
10y ago
Huh, thanks for the info! Would you happen to have any hyperlinks to the discussions where people hated on the old scheme? I'd like to read up on this more.
242.
▲
by
bshanks
10y ago
I propose a variant versioning scheme that bumps the MINOR version for backwards incompatibilities and reserves MAJOR version bumps for subjectively "big" changes. http://www.bayleshanks.com/wiki.pl?proj-sanDiegoVe
243.
▲
Opaque Financial Contracting and Toxic Term Sheets in Venture Capital [pdf]
(faculty.mccombs.utexas.edu)
2 points
by
bshanks
10y ago
|
0 comments
244.
▲
by
bshanks
10y ago
Regarding the spam user deletions, I am not involved but my interpretation of what GitLab wrote ( https://gitlab.com/gitlab-org/gitlab-ce/issues/27581 https://gitlab.com/MrChrisW/gitlab-a
245.
▲
Man's pacemaker data used against him in arson case
(cbsnews.com)
1 points
by
bshanks
10y ago
|
0 comments
246.
▲
by
bshanks
10y ago
I think "attacker" and "harassment" are both accurate but I feel that they are too clinical/adult/long/abstract for people to get angry about. You want words that a 5-year-old understands, and you want wor
247.
▲
by
bshanks
10y ago
I quite agree with you. I'm only saying that when you talk about bullying to third parties using the word "troll", sometimes the third party will imagine something less serious than is actually happening.
248.
▲
by
bshanks
10y ago
> If 101 nodes isn't enough to win the vote then add more bogus nodes until I have 51% of the total nodes. You could do that, but it would be expensive. It's not the number of nodes that matters, it's the total computing p
249.
▲
by
bshanks
10y ago
Out of all of the people who would like to frequent message board, some of them can't stand boards with a lot of censorship; and others can't stand boards which don't have strong moderation. Surely some forum hosts will desir
250.
▲
by
bshanks
10y ago
Yes, one should help the targets of bullies to be resilient. In addition to that, one should make it clear that bullying is unacceptable. And, perhaps, depending on the forum and the degree of confidence that you have the whole story, one s
251.
▲
by
bshanks
10y ago
I think the problem is just that people use one word, "troll", for too many different things. We can keep using "troll" for people who are saying things to get people riled up [ http://www.flamewarriorsguide.co
252.
▲
by
bshanks
10y ago
Two remedies I've heard about in science fiction are: 1) "Gevulot" in the book Quantum Thief. There are laws that allow you to control the spread of information about you. Digital technology without the 'DRM' that e
253.
▲
by
bshanks
10y ago
Yes, if you imagine that the number of "votes" that each computer gets is proportional to its computational power ("hashing power" or hashpower). (if instead, each node got one vote, then it would be too easy for someone
254.
▲
by
bshanks
10y ago
Yes, you are correct. Proof-of-work blockchains are vulnerable to an adversary who has more computing power than the sum of the computing power of all of the honest miners. This is called a "51% attack". So baby blockchains are qu
255.
▲
by
bshanks
10y ago
The purpose of the blockchain is to be a shared append-only data structure. There are a number of nodes who have copies of what is supposed to be exactly the same data (but see below). The nodes are all constantly telling each other what th
256.
▲
by
bshanks
10y ago
The blockchain is supposed to be used as an append-only data structure. There are a number of nodes who have copies of what is supposed to be (or at least, converge to) exactly the same data. The nodes are all constantly telling each other
257.
▲
TechEmpower Web Framework Benchmarks Round 13
(techempower.com)
2 points
by
bshanks
10y ago
|
0 comments
258.
▲
Bonus antipatterns
(jimplush.com)
2 points
by
bshanks
10y ago
|
0 comments
259.
▲
Quasar Framework
(quasar-framework.org)
1 points
by
bshanks
10y ago
|
0 comments
260.
▲
by
bshanks
10y ago
i think the way you defined it, covariant and contravariant are identical; in your contravariant definition, swap the names of "A" and "B" and you get: if B >: A, then F[A] <: F[B] and B >: A means the sa
261.
▲
What's wrong with bootstrapping by consulting?
2 points
by
bshanks
10y ago
|
2 comments
262.
▲
Del.icio.us export disabled and support email down
26 points
by
bshanks
10y ago
|
9 comments
263.
▲
by
bshanks
10y ago
Approval Voting also has a simple multiwinner proportional aggregation procedure: * Each ballot is given an initial "weight" of 1. * The votes on the ballots are summed for each candidate, thus obtaining that candidate's tota
264.
▲
Voting Simulation Visualizations (2006)
(zesty.ca)
2 points
by
bshanks
10y ago
|
0 comments
265.
▲
by
bshanks
10y ago
Maybe, but I get the impression that overall the addition of a true runoff tends to make things better. For example, this guy compared a number of voting methods using his preferred metric, Bayesian regret; note that when a method and a var
266.
▲
by
bshanks
10y ago
As long as the same ballot will be used not just for the runoff but also for the initial election, people have an incentive not to write down their true preferences (this is implied by the https://en.wikipedia.org/wiki/
267.
▲
Legit: complementary command-line interface for Git
(git-legit.org)
1 points
by
bshanks
10y ago
|
0 comments
268.
▲
by
bshanks
10y ago
The paper on lower bounds for black-box quantum algorithms trying to solve NP appears to be https://arxiv.org/pdf/quant-ph/9701001.pdf (?)
269.
▲
Limitations of Quantum Computing Algorithms (2003) [pdf]
(siam.org)
18 points
by
bshanks
10y ago
|
3 comments
270.
▲
The history of the DAO and lessons learned
(blog.slock.it)
2 points
by
bshanks
10y ago
|
0 comments
More ›