Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
shachaf
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
Equity Is Worth More Than Cash Because of Optionality
(peter.website)
1 points
by
shachaf
1mo ago
|
0 comments
2.
▲
Expectation and Copysets
(buttondown.com)
2 points
by
shachaf
7mo ago
|
0 comments
3.
▲
The FLP Theorem
(shachaf.net)
3 points
by
shachaf
1y ago
|
0 comments
4.
▲
Show HN: Mustardwatch: Detect what files a program uses, rerun when they change
(github.com)
15 points
by
shachaf
1y ago
|
0 comments
5.
▲
Git Workflow Is Snapshot-Isolated
(buttondown.com)
2 points
by
shachaf
2y ago
|
0 comments
6.
▲
Constraining writers in distributed systems
(shachaf.net)
69 points
by
shachaf
2y ago
|
3 comments
7.
▲
by
shachaf
2y ago
I use signalfd when I can, and this argument doesn't make much sense to me. The main goal of most signals you'd use it with -- like SIGCHLD/SIGPIPE -- is to wake you up and tell you that something happened, not to give you al
8.
▲
by
shachaf
3y ago
The perspective I have in the post is that Multi-Paxos and Raft and so on are still doing pretty much exactly consensus for each log entry, they're just sharing lock IDs/ballots/terms across multiple log entries, and having t
9.
▲
by
shachaf
4y ago
Hmm, do you mean N+K+1 (to have enough points for both the data and parity shards)? Why isn't N+K sufficient, fitting a polynomial to N points and emitting K more?
10.
▲
by
shachaf
4y ago
I would suggest against relying too closely on this article in its current state. The "precedence climbing" code is needlessly complicated -- it has a nested loop which doesn't do anything, only one loop is necessary -- and i
11.
▲
Consensus Zoo
(shachaf.net)
11 points
by
shachaf
4y ago
|
0 comments
12.
▲
by
shachaf
6y ago
I didn't see this reply until today either. On laziness, I only mean that the language feature isn't important. You can certainly represent infinite data using laziness (and you must represent it as some form of codata, such as a
13.
▲
by
shachaf
6y ago
No, the article's p takes a function: > type Cantor = Natural -> Bit > (#) :: Bit -> Cantor -> Cantor > x # a = \i -> if i == 0 then x else a(i-1) (You could represent bit streams with something like data Stream =
14.
▲
by
shachaf
6y ago
Laziness isn't the essential thing here -- the article's construction specifically doesn't rely on laziness, and would work in a strict language (almost verbatim -- you might need to write "lambda i: f(i)" instead o
15.
▲
by
shachaf
9y ago
Is there any similar tool for string diagrams? They can be very expressive on paper, but it would be much more convenient to manipulate them on a computer.
16.
▲
by
shachaf
13y ago
The last part is backwards -- when F is a functor, the only law we need to check is the identity law, but checking the composition law isn't enough. For example, fmap _ _ = [] satisfies fmap f . fmap g = fmap (f . g), but not fm
17.
▲
by
shachaf
13y ago
On the "Random Thought": The GIF doesn't need to be animated. A GIF is made of multiple frames and each frame contains multiple image blocks. Each image block has its own coördinates and color table. You should be to use multiple image bloc
18.
▲
by
shachaf
14y ago
That's what Hoogle ( http://www.haskell.org/hoogle/ ) and Hayoo! ( http://holumbus.fh-wedel.de/hayoo/hayoo.html ) are for.
19.
▲
by
shachaf
15y ago
Not quite: Each image descriptor has its own Local Color Table, but the delays aren't set by the image descriptor, they're set by the Graphics Control Extension block, and you can have multiple image descriptors per GCE block. So the GIF ca
20.
▲
by
shachaf
15y ago
It's possible to make animated GIFs that use more than 256 colors per frame (although they'll probably be bigger than a format designed for that sort of thing).
21.
▲
by
shachaf
15y ago
Yes, but then the canonical URL would be on github.com.
22.
▲
by
shachaf
15y ago
This was meant as a proof-of-concept and has several big inefficiencies that could be fixed pretty easily if someone was actually going to use it for something. The UI could also be improved, and I think at least IE9 could be reasonably eas
23.
▲
by
shachaf
15y ago
OK, I put it up on GitHub. https://github.com/shachaf/jsgif
24.
▲
Show HN: jsgif: A GIF player in JavaScript
(slbkbs.org)
128 points
by
shachaf
15y ago
|
24 comments
25.
▲
by
shachaf
16y ago
_The Tao is Silent_, by Raymond Smullyan, comes to mind.
26.
▲
by
shachaf
16y ago
Things have gotten worse, though, it seems; when I signed up it took about a month before I got the invitation, and I know others who've been waiting ~two months now and still haven't gotten it.
27.
▲
by
shachaf
16y ago
If embedded MIDI isn't working, use javascript:window.location = document.getElementById('toneframe').contentWindow.document.getElementsByTagName('embed')[0].src To download the MIDI file directly.
28.
▲
by
shachaf
17y ago
Where does e come into this specifically? That is, why does 5^(i*pi) have an imaginary part?
29.
▲
by
shachaf
17y ago
I like to think that people vote on a comment based on the content, not on the (current) score. It is not particularly unlikely that twenty-four people thought: This is a worthwhile comment! It points out something that I did not realize,
30.
▲
by
shachaf
17y ago
What about letting people append to comments after the time limit? I've always thought that would be sensible: People could add to what they've said before in a visible way, but not "rewrite history". After all, additions are already freque
More ›