jdoliner

66 ms·

661.
by jdoliner 11y ago
That story about the bicycle made me wonder if we're going to wind up with traffic deadlocks in the near future.
662.
by jdoliner 11y ago
From the TC article about Uber today: > This year, the firm expects to clock $10.84 billion in revenue which — calculating the 20 percent commission that it takes — should bring in around $2 billion in revenue for the year.
663.
by jdoliner 11y ago
Companies generally expect to get a lot more than just money from their early investors. This is definitely a nifty idea for giving people an incentive to participate in a nascent 2 sided market. However it's not quite a no brainer as
664.
Build your own Wayback Machine in 10 lines of code(medium.com)
16 points by jdoliner 11y ago|0 comments
665.
by jdoliner 11y ago
> And maybe that makes more sense to you (if you're into physics), or maybe it makes less sense to you. At least Linus can laugh about it as well.
666.
Light cone analogy for git-bisect (2006)(yarchive.net)
19 points by jdoliner 11y ago|4 comments
667.
by jdoliner 11y ago
Online games don't normally need much bandwidth since they're just communicating the player's positions, velocity gunfire etc. None of that data is particularly big. Latencies on the other hand are really important.
668.
by jdoliner 11y ago
This example seems really interesting, we should do it. Github issues would be a fine place I think. Or emailing me at jd@pachyderm.io if you'd prefer :)
669.
by jdoliner 11y ago
Hi! Good question. Datomic and pfs have very similar data models, we drew some inspiration for our architecture from them. They're targeting different use cases though. Datomic is a database so it's meant as the source of truth th
670.
by jdoliner 11y ago
Containers solve a few problems for us. They allow us to provide strong isolation guarantees for jobs and offer nice resource quota semantics (via cgroups.) They also serve as a good format for specifying jobs in because they can be easily
671.
by jdoliner 11y ago
Hi Guys, co-founder here. We'll be hanging out on this thread all day to answer any questions.
672.
by jdoliner 11y ago
I think the tracing tool [0] isn't go specific but rather just a general tracing tool that's been maturing for a while. The support for outputting compatible traces is new to 1.5 AFAIK but that would explain how they have such a n
673.
Pachyderm v0.7 Replication and Automatic Failover(medium.com)
3 points by jdoliner 11y ago|0 comments
674.
by jdoliner 11y ago
This is fairly common. I've done professional work with Go and C++ and this is one of the biggest reasons I like Go over C++. C++'s concurrency primitives aren't quite good enough so you always need to build something on top
675.
by jdoliner 12y ago
> AirBnB runs thousands of compute instances and handles hundreds of terabytes of data with only five IT staff. I'm not sure how they're measuring IT staff, but having worked at Airbnb I can't think of any sane definition
676.
by jdoliner 12y ago
> RethinkDB has no access to the structure of the source in order to analyze it statically and work out an optimal I/O read plan. Actually this isn't true. One of the really cool things about RethinkDB is that despite the fact
677.
by jdoliner 12y ago
It's not often I see compassion like this on HN. Good for you.
678.
A simple hack SQLite used to stop frivolous support calls(i.imgur.com)
3 points by jdoliner 12y ago|1 comments
679.
by jdoliner 12y ago
How do you feel about The Economist's publication style?
680.
by jdoliner 12y ago
This must be the new and improved "eventually consistent HN" that dang has been talking about.
681.
by jdoliner 12y ago
> This is a new kind of spying, unlike anything that has existed in the history of American society. I think it's a bit disingenuous to call this "a new kind of spying" all of the data they're using is publicly availa
682.
by jdoliner 12y ago
This was the leading hypothesis on r/chess. I'm pretty sure it's right Naka didn't hit this rating in 2014 as far as I know.
683.
by jdoliner 12y ago
Yup, this is another very valid criticism. I think the answer is probably to have a cutoff on the lower bound. Basically saying that for a move to be a blunder it has to leave below a certain absolute value, maybe +2 pawns, in addition to a
684.
by jdoliner 12y ago
This is a valid point. We're going to be publishing some data in a few days that will have everything you need to test this hypothesis.
685.
by jdoliner 12y ago
Give us a few days :p. We'll have exactly the dataset you need to answer these questions. (And we'll be releasing it publicly.)
686.
by jdoliner 12y ago
This is definitely the biggest limitation of our approach right now and there are certainly some things that we counted as blunders that aren't true blunders. We're working on rectifying this by doing another pass with a better en
687.
by jdoliner 12y ago
My hypothesis would be that GMs are much less likely to blunder when there's a winning move on the board. They're generally very good at finding such moves.
688.
by jdoliner 12y ago
Time definitely plays a huge roll in blunders. Actually if you look at the first graph there's a spike in blunders around 2800 which is entirely due to a single GM (Caruana) playing a string of blitz games this year in which he made se
689.
by jdoliner 12y ago
You're totally right about this. In general the efficacy of engines is different for different parts of the game. In the beginning players (and engines) are mostly playing from books so there's a lot fewer mistakes and what the en
690.
by jdoliner 12y ago
Hi guys, author here. I'll be monitoring this thread for the rest of the evening. Happy to answer any questions.

More ›