Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
jsw
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
jsw
3mo ago
Interesting! We interact with the low-level APIs too vs the SDK, also: an IO scheduler for request batching and conn management, request hedging, full MVCC transactions, etc. We store raw bytes in DDB and manage schema/etc elsewhere. C
2.
▲
by
jsw
3mo ago
Curious how the DB startup with Dynamo at its core went. We use it heavily. The primary tricky thing for us at the moment is aligning pricing with workload value.
3.
▲
AWS ExtendDB, open-source DynamoDB API with pluggable backends
(aws.amazon.com)
3 points
by
jsw
4mo ago
|
1 comments
4.
▲
by
jsw
6mo ago
Do you have any of your fixes publicly available?
5.
▲
by
jsw
9mo ago
Regardless, that’s kind of the beauty of this project: term-keys generates the terminal config file based on all your bespoke keybindings for you. Would probably be easier to setup than you imagine.
6.
▲
by
jsw
9mo ago
MacOS user here. So many times over the last decade I’ve journeyed to get terminal Emacs working with my litany of weird keybindings. But I always end up back in the GUI. I switched to Colemak about 15 years ago and thought it would be a go
7.
▲
by
jsw
1y ago
For simple high-frequency time deltas, I've found this function wins on the perf front: //go:linkname nanotime runtime.nanotime func nanotime() int64
8.
▲
by
jsw
1y ago
Love the simplicity and elegance of the design to address this problem.
9.
▲
by
jsw
1y ago
I mentioned this in another place on this thread, but a simple AIMD algorithm paired with a token bucket is surprisingly effective at dynamically adjusting to available capacity, even across a fleet of services not sharing state other than
10.
▲
by
jsw
1y ago
I’ve found the AIMD algo (additive increase, multiplicative decrease) paired with a token bucket gives a nice way to have a distributed set of processes adapt to backend capacity without centralized state. Also found that AIMD is better tha
11.
▲
Show HN: A Go library to rate limit across millions of users
(github.com)
2 points
by
jsw
1y ago
|
0 comments
12.
▲
by
jsw
4y ago
Bazel is a fully reproducible and hermetic build system. A lot of painstaking work goes into it producing the exact same artifacts build after build. And that provides some interesting properties that you can leverage for artifact caching,
13.
▲
by
jsw
5y ago
I wish “Prevailing Time” would catch on. Eg PPT
14.
▲
by
jsw
5y ago
Mergify just introduced a “speculative merge queues[1]” feature that does something very similar. [1] https://blog.mergify.io/announcing-speculative-merge-queues
15.
▲
by
jsw
7y ago
That sweet, sweet traffic data.
16.
▲
by
jsw
7y ago
I've always been curious about the general directory structure they use for this. Does anyone have insight?
17.
▲
by
jsw
7y ago
I’m firmly on team monorepo, and I agree great tooling is an absolute requirement. We use Bazel + AWS CodeBuild with local caching. We have an average incremental CI build of our monorepo that’s under 45 seconds. Clean build 30+ minutes.
18.
▲
by
jsw
7y ago
The AWS Cognito User Pool Authentication Flow utilizes an augmented PAKE (SRP). I imagine there are a number of major sites that use Cognito along with the SRP auth flows baked into their std libs. I know I've used it a number of times
19.
▲
by
jsw
7y ago
TLA+ specs explore all state spaces of concurrent processes. Avoiding state explosions is something you need to be conscious of when building those. The modeling required also takes some learning investment. Curious if this can really pull
20.
▲
A Change Data Capture Pipeline from PostgreSQL to Kafka
(simple.com)
1 points
by
jsw
9y ago
|
0 comments