Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
int08h
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
int08h
2mo ago
This is more a hybrid "physicist writes a cryptography/graph-theory paper". This paper takes secret sharing as a black box and asks the question: once you have your N shares, where on a network should you put them? The author
2.
▲
by
int08h
9mo ago
Right, I understand your meaning better. I agree with you: no matter how good of a job the code (by construction or types or otherwise) does of “making unsafe states unrepresentable”, that in no way makes a real world complex system “safe”
3.
▲
by
int08h
9mo ago
Hmm, it seems you actually agree with the OP: OP says (your quote): > [Most production incidents] are due to the code entering a state that should never have been possible. You say: > [...] it is more true that most production inciden
4.
▲
Roughenough 2.0 RFC-draft compliant cryptographic time sync
(github.com)
2 points
by
int08h
11mo ago
|
1 comments
5.
▲
by
int08h
11mo ago
I've released version 2.0 of roughenough, a Rust implementation of the draft IETF Roughtime protocol ( https://datatracker.ietf.org/doc/draft-ietf-ntp-roughtime/ ). The Roughtime protocol provides cryptographic
6.
▲
by
int08h
1y ago
> In that sense, Rust enables escapism: When writing Rust, you get to solve lots of 'problems' - not real problems, mind you, but fun problems. If this is true for Rust, it's 10x more true for C++! Lifetime issues are puzz
7.
▲
by
int08h
2y ago
Yes, the (IMHO) the easiest one to use is the Relacy Race Detector ( https://github.com/dvyukov/relacy and https://www.1024cores.net/home/relacy-race-detector ) It's been around a while and is
8.
▲
by
int08h
2y ago
Related: the notion of "safety" (refusing to discuss "harmful" content) is rather shallow and (relatively) easily undone: _Refusal in Language Models Is Mediated by a Single Direction_ [ https://arxiv.org/
9.
▲
by
int08h
2y ago
Sit in a Compare-and-Swap loop on `ping` and `pong` as uint32s. Go even faster in the shared memory case. Zoom zoom.
10.
▲
by
int08h
2y ago
The average duration between any two moon phases is 29.530589 days. Many watches use 29.5 days between phases for simplicity. This results in the watch's moon phase display being off by one day for every two years the watch operates. T
11.
▲
by
int08h
4y ago
Dmitry Vyukov has forgotten more about non-blocking synchronization (lock- and wait-free algorithms) that most developers presently remember.
12.
▲
by
int08h
9y ago
Re: getting tooling "right" and that driving adoption/popularity. I'll argue that Java and the JVM are very similar in this respect. Few will argue Java is a "good" language and the JVM has many shortcomings. H
13.
▲
Rust implementation of a Roughtime secure time sync server
(github.com)
3 points
by
int08h
9y ago
|
0 comments
14.
▲
A Roughtime server written in Rust
(github.com)
5 points
by
int08h
9y ago
|
0 comments
15.
▲
by
int08h
9y ago
Only looked at link [2], but wow. That state machine is brilliant. Don't know OCaml but am learning Rust and I see what you mean about the universality of how types make this possible. Thanks for pointing this out.
16.
▲
Roughtime Protocol Message Anatomy
(int08h.com)
16 points
by
int08h
9y ago
|
1 comments
17.
▲
by
int08h
9y ago
Thank you.
18.
▲
by
int08h
9y ago
I was typing up a response, but yours is great. You nailed it. The only thing to add is that a tlsdate-like approach will not work consistently with TLS 1.3 as the standard makes time in the handshake OPTIONAL.
19.
▲
Scalable, Lie-Detecting Timeserving with Roughtime
(int08h.com)
38 points
by
int08h
9y ago
|
12 comments
20.
▲
The Future Web: Minecraft or Call-Of-Duty?
(int08h.com)
2 points
by
int08h
9y ago
|
0 comments
21.
▲
Monospace Overchoice
(int08h.com)
2 points
by
int08h
9y ago
|
0 comments
22.
▲
Nearenough, a Java implementation of the Roughtime secure time sync protocol
(github.com)
1 points
by
int08h
10y ago
|
0 comments