Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kcudrevelc
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
kcudrevelc
3y ago
Hey, Google go b-tree implementation author here. A few important things: - this implementation was done by me while I worked at Google and needed a good ordered tree. It is not and never was supported by Google, just open sourced by the
2.
▲
Show HN: Cabalī – Local, encrypted, ephemeral chat that doesn't use the internet
(cabalee.gram.co.nl)
6 points
by
kcudrevelc
6y ago
|
1 comments
3.
▲
by
kcudrevelc
6y ago
I've worked at Google for a while, and a few years ago I wanted to release an open-source project. Since the code was going on Git, it made sense to throw the design there too, so I just added a DESIGN.md to the top-level of the proje
4.
▲
by
kcudrevelc
10y ago
It's not a (provable, guaranteed) CP system. Bitcoin attempts to provide a global consensus across a large number of actors, but its attempt is based on proof of work, specifically that it's probably difficult to compute hashes w
5.
▲
by
kcudrevelc
10y ago
> Under Linux, some SECCOMP initialization and capability dances having to do with dropping root and closing off privilege-escalation attacks as soon as possible after startup. I was under the impression that these specific things were a
6.
▲
by
kcudrevelc
11y ago
Hey, would you mind if I added a link to this article from gopacket's README.md?
7.
▲
by
kcudrevelc
12y ago
I think the reason we're getting faster performance is that we tend to have packets clustered on disk, as you've surmised. Since packets with particular ports/IPs/etc tend to cluster in time, there's a good chance
8.
▲
by
kcudrevelc
12y ago
I blame blissful ignorance: I'm not at all familiar with DPDK. I'll definitely read up, though! I wonder if O_DIRECT writes can happen from DPDK memory space? If not, we don't gain anything, since we'd need to copy pa
9.
▲
by
kcudrevelc
12y ago
Hey, great questions! Query Performance: Right now, we've got test machines deployed with 8 500GB disks for packets + 1 indexing disk (all 15KRPM spinning disks). They keep at 90% full, or roughly 460GB/disk, about 1K files/
10.
▲
by
kcudrevelc
12y ago
Offline jobs are an interesting idea, but they weren't what we were really thinking of. Instead, we use stenographer more like a database of recent traffic. Consider this as a simple use case for intrusion detection: set up snort
11.
▲
by
kcudrevelc
12y ago
No corrections necessary, you're right on the money. This is a 20% project. While it's one we plan to use internally, it's not a "supported" Google product. It's just another open-source project along with th
12.
▲
by
kcudrevelc
12y ago
Hey, thanks! If you have any additional questions about the design process, internals, etc, feel free to ask. I'm the primary author of the project, and I'll be refreshing the HN post for the next hour or so trying to answer que
13.
▲
by
kcudrevelc
12y ago
Excellent! I'll try to send you a pull request sometime Monday or Tuesday.
14.
▲
by
kcudrevelc
12y ago
I run an open-source Go library that also does packet capture/encode/decode ( http://code.google.com/p/gopacket ). Would you be at all interested in adding results for gopacket to your benchmarks page? If so,
15.
▲
In-memory B-Tree in Go
(godoc.org)
12 points
by
kcudrevelc
12y ago
|
0 comments