Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ayende
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
by
ayende
2y ago
In most scenarios, you are no longer running with multiple users on the same machine. Either this is a server, which has an admin team, or a client machine, which _usually_ have a single user. That isn't 100% true, and local privilege
32.
▲
by
ayende
2y ago
That is a well structure system, yes Both cleanup for error and allocation happens in the same place That means you won't forget to call it, and the success flag is an obvious way to ha dle it
33.
▲
by
ayende
2y ago
Starting in v7.0, ravendb has ve tor search and ai integration Run on windows , linux and mac
34.
▲
by
ayende
2y ago
C# has both of those capabilities and more The answer doesn't make sense
35.
▲
by
ayende
2y ago
Chrome gives you what data it has, and you are expected to issue the next request to get the rest of the data. Consider a read() call in Linux if you ask to read 16kb and the cache has 4kb page ready, it may give you that. You'll nee
36.
▲
Performance Discovery: IOPS vs. IOPS
(ravendb.net)
1 points
by
ayende
2y ago
|
0 comments
37.
▲
by
ayende
2y ago
The problem with IVF is that you need to find the right centroids. And that doesn't work well if your data grow and mutate over time. Splitting a centroid is a pretty complex issue. As are clustering in an area. For example, let's
38.
▲
Debugging the Linux kernel using psychic powers
(ayende.com)
1 points
by
ayende
2y ago
|
0 comments
39.
▲
by
ayende
2y ago
Do you have a union in your business? If not, why not? If yes, what is the experience like?
40.
▲
Postmortem: 250% cluster-wide transaction speed improvement
(ravendb.net)
1 points
by
ayende
2y ago
|
0 comments
41.
▲
Implementing "Suggested Destinations" in a few lines of code
(ayende.com)
1 points
by
ayende
2y ago
|
0 comments
42.
▲
by
ayende
2y ago
If you wanted to share a bit of music, let's say a disc in MP3 format You could either schlep the hard disk or try to carry 20 - 30 floppies around With a high chance of at least some of them bring bad
43.
▲
by
ayende
2y ago
Yes, I addressed it a bit further in the post I was trying to explain how my 12 years old self saw that code And I had no other resource to turn to at the time
44.
▲
The code that lived in my head rent free for 30 years
(ayende.com)
21 points
by
ayende
2y ago
|
10 comments
45.
▲
by
ayende
2y ago
Thread local state You don't need it global Seed it once per thread from /dev/random and you are done
46.
▲
by
ayende
2y ago
Libsodium is actually really small It also has a lot of eyes on it and was reviewed by people whose job is to spot these sort of issues
47.
▲
by
ayende
2y ago
Sounds really interesting, and resources on that? Sounds like the other size of timing leaks that cryptographers are so worried about
48.
▲
by
ayende
2y ago
Actually, if you want that, go with a rapberry pi with a hidden Ssid All you need is to e loitering nearby, connect and drop the data then move But phyaical tracking is very much a threat
49.
▲
by
ayende
2y ago
You have bots that are ideally not controlled by the system. But remember that we rely on the lambda scheduler to run it That does boy have perfect accuracy, so that helps too Finally, you aren't publishing every 5 minutes, you execute
50.
▲
Building a serverless secured dead drop
(ayende.com)
121 points
by
ayende
2y ago
|
56 comments
51.
▲
by
ayende
2y ago
What do you mean, structure? The output here is indistinguishable from random data Note stenography will not actually help if your data is searched for. Obscurity isn't a protection method The idea is that you can't tell how many
52.
▲
Deniable Encryption
(ayende.com)
61 points
by
ayende
2y ago
|
12 comments
53.
▲
by
ayende
2y ago
You are missing knowledge (Spring, in your example). But you are saying that "I can grasp in on the job" ? Given a two years gap, you should invest the time and effort in learning whatever it is the market is seeing demand in. Con
54.
▲
by
ayende
3y ago
There is a simple trick to manage hash based partition growth Don't assign small number of tokens, but a much larger one If you have a million tokens, there is no need to re-shard, and you can re assign tokens to different nodes as you
55.
▲
Non fungible money in cloud accounting
(ravendb.net)
1 points
by
ayende
3y ago
|
0 comments
56.
▲
by
ayende
3y ago
As long as the cost for training a model is in the 7+ figures, that means that any such open model is bound to be tracked to someone with deep enough pockets to sue. Consider that you just spend a few millions on training a model on copyrig
57.
▲
by
ayende
3y ago
That assumes that you are actually doing all the work in a side buffer? The way we do it, all the operations are done on the actual buffers of the tree, so there is no actual way _to_ have more space (even temporarily). This way, you avoid
58.
▲
by
ayende
3y ago
To give some context, Battle of the Somme, lasted 4 months, total casualties: 1m+.
59.
▲
by
ayende
3y ago
Also doesn't help when you are running on virtual / networked hardware. Nothing ensure that what you think is a sector write would actually align properly with the hardware.
60.
▲
by
ayende
3y ago
Doesn't help when you work with pages :-) Assume 512 sectors ( I know those are rare ), but I don't think that there is any guarantees that 4KB page would be: * Written atomically * Written in a particular order
More ›