Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
fizx
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
45 ms
·
421.
▲
by
fizx
11y ago
Can you type LaTeX faster than you can write equations on a chalkboard? I can't.
422.
▲
by
fizx
11y ago
Doesn't work, though https://logo.clearbit.com/ycombinator.com does.
423.
▲
by
fizx
11y ago
It's mostly annoying in development when your mid-large Rails app takes 30s-2m to start-up and/or reload after an edit.
424.
▲
by
fizx
11y ago
https://en.wikipedia.org/wiki/Proof-of-stake
425.
▲
by
fizx
11y ago
To be honest, this sounds like a perfectly normal contract. The larger company quite reasonably wants not to have the employees of its 19 acquisitions to each all have completely different paperwork. Personally, I find that the easiest way
426.
▲
by
fizx
11y ago
Your phone runs a bunch of proprietary stuff that I as a hacker don't want. Additionally, it doesn't have (enough) USB ports, HDMI, a bunch of pinouts, ethernet, PWM, etc. http://www.ubuntu.com/phone plus an opti
427.
▲
by
fizx
11y ago
It's probably fully-loaded cost, so salary is 50-75% of that, but yes, doing a temporary and undesirable job for a large company in some remote barren location generally pays well.
428.
▲
by
fizx
11y ago
Our production thrift code generator (now at https://github.com/twitter/scrooge ) was JRuby for about a year, before Robey decided it was an abomination and rewrote it in scala. JRuby was easy because you can Maven requ
429.
▲
by
fizx
11y ago
Large queues can have problems. Perhaps your queue is effectively 30 seconds deep at times. But your clients time out around 10 seconds. Now every request in the queue is useless. If your clients retry, then now you have a feedback loop
430.
▲
by
fizx
11y ago
Why is auto-creating mappings flawed?
431.
▲
by
fizx
11y ago
Typically, you cache the last write somewhere close so that you can manually splice it into the corresponding page render. Then you engineer the rest of the system such that the log processing system is rarely/never falling behind.
432.
▲
by
fizx
11y ago
> saved yourself 5 minutes and shaken it Don't shake martinis or manhattans. It gets tiny ice chips in the drink. Bond was an idiot.
433.
▲
by
fizx
11y ago
It's sooo limited in what's implemented.
434.
▲
Ask HN: Has someone automated best practices for AWS?
4 points
by
fizx
11y ago
|
4 comments
435.
▲
by
fizx
11y ago
There's at least four mathematical representations of QM, ascribed to Shrödinger, Heisenberg, Dirac, and Bohm respectively, which are all mathematically equivalent. So you aren't really going to disprove only the Bohm picture, b
436.
▲
by
fizx
11y ago
I'm going to try to explain this in programming terms :) There's a longstanding interpretation that the wave-particle duality is actually caused by (e.g. electrons) being particles riding invisible waves. This interpretation (Boh
437.
▲
by
fizx
11y ago
It's very hard to ELI5 quantum mechanics. The only thing we can definitively constructively say is that we have a mathematical system that describes the universe very well at certain time/energy/distance scales. Trying to a
438.
▲
by
fizx
11y ago
Look into quadratic voting ( http://ericposner.com/quadratic-voting/ ) as a solution to e.g. the gay marriage problem.
439.
▲
by
fizx
11y ago
You'd implement the merkle trees yourself in the application layer. Alternately, you could use hash lists. It'd be somewhat similar to how you'd implement geohashing. Let's say you just take a SHA-X of each row repres
440.
▲
by
fizx
11y ago
> "My second point was that this — streaming a "non-lossy" database as a change log into one or more "lossy" ones — is such a common operation that it should be a solved problem. It certainly requires something m
441.
▲
by
fizx
11y ago
> Given that ElasticSearch is "eventually consistent", how do you know when it has caught up? That's nice, in practice, though, ElasticSearch, doesn't behave like an eventually consistent system--it behaves like a fla
442.
▲
by
fizx
11y ago
A logical "SELECT COUNT(*) WHERE updated_at < now()" is probably reasonably fast on your primary store and ElasticSearch.
443.
▲
by
fizx
12y ago
http://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis
444.
▲
by
fizx
12y ago
The Lucene team has been promising an end to corruption since the 2.9 days and before (~10 years). If you believe them that the problems are all fixed, and you need to be serious about it, I'd wait more than a month before declaring t
445.
▲
by
fizx
12y ago
Given that this is based on Elasticsearch, there will be a master node, which should be chosen explicitly in configuration to be away from the data nodes, because ES responds poorly to garbage collection on the master node. So you want to
446.
▲
by
fizx
12y ago
I think you could, but at this point you're butting up against the event loop assumption: that most of the work is IO. If you do compute on the edges, you then want threads, and you're re-engineering redis (Edit: I should have re
447.
▲
by
fizx
12y ago
Everyone might have to be an accredited investor, which the majority would not qualify for. Another potential problem is that companies want to keep their cap tables minimal for regulatory reasons. Also, how does the 10% vote in board dec
448.
▲
by
fizx
12y ago
A vector belongs to a vector space, which implies certain algebraic rules relating it to other vectors in the space ( http://en.wikipedia.org/wiki/Vector_space is probably enough reference). A multidimensional scalar i
449.
▲
by
fizx
12y ago
Apparently
450.
▲
by
fizx
12y ago
What you're hoping for is that some cacheable function of many documents is also a monoid. In an example, you're hoping that when you invalidate the query "SELECT COUNT(*) FROM foo WHERE x = 1" because a new document tha
More ›