Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Veserv
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
23 ms
·
181.
▲
by
Veserv
9mo ago
Say it is not so. Company that likes illegally discharging wastewater [1][2] run by man who leads companies to dump toxic waste into city water systems as soon as the inspectors leave [3][4][5] with a company that has multiple times the ind
182.
▲
by
Veserv
9mo ago
The proposal is more generic than that, it is throwing away translation of any kind. If all you do is replace virtual memory to physical memory translation with object ID to physical memory translation then you buy almost nothing in terms o
183.
▲
by
Veserv
9mo ago
What a impressively arrogant double-down. You once again present no technical argument for your extraordinary claims and position, let alone the extraordinary evidence required. You present no technical analysis of known problems or limitat
184.
▲
by
Veserv
9mo ago
Of course that sucks. Just enable full time-travel recording in production and then you can use a standard multi-program trace visualizer and time travel debugger to identify the exact execution down to the instruction and precisely identif
185.
▲
by
Veserv
9mo ago
You are describing a memory protection unit (MPU). Those are common in low-resource contexts that are too simple to afford a full memory management unit (MMU). The problem with scaling that up, especially in general-purpose environments wit
186.
▲
by
Veserv
9mo ago
If you have a hill then you can just put a water tank at the top and bottom and a pipe with a pump and a generator in-between. Even if your rolling mass was iron, you would only need a tank 8x larger than your rolling mass in volume (2x per
187.
▲
by
Veserv
9mo ago
And they addressed exactly none of the relevant points, instead supporting their arguments by waving in the general direction of outcompeted designs and speculative designs. CHERI is neat, but, as far as I am aware, still suffers from serio
188.
▲
by
Veserv
9mo ago
x86-64 call instruction decrements the stack pointer to push the return address. x86-64 push instructions decrement the stack pointer. The push instructions are easy to work around because most compilers already just push the entire stack f
189.
▲
by
Veserv
9mo ago
I did not say it was impossible. I said that mapping tables solve a lot of problems. There are very good reasons, as I explicitly outlined, for why they are a good solution to these classes of problems and why object stores fall down when t
190.
▲
by
Veserv
9mo ago
What a clueless post. Even ignoring their massive overstatement of the difficulty and hardware complexity of hardware mapping tables, they appear to not even understand the problems solved by mapping tables. Okay, let us say you have a phys
191.
▲
by
Veserv
9mo ago
That is utterly nonsensical. Are there HUGE tracts of land where 100 ton railcars or concrete blocks grow on trees? If not, then how are you getting them there? On a per-mass basis what do you think is easier to transport, railcars or water
192.
▲
by
Veserv
9mo ago
What exactly is that benchmark testing? Seems like a lot of cores to handle just 800 Gb/s; that is only ~12.5 Gb/s per core. Even with their ~19% headroom that is still only ~15 Gb/s per core. You can terminate encrypted tran
193.
▲
by
Veserv
10mo ago
Yep. We even have a free bit when writing hex numbers like 0x1234. Just flip that 0x to a 1x to indicate you are writing in little-endian and you get nice numbers like 1x4321 that are totally unambiguous little-endian hex representations. Y
194.
▲
by
Veserv
10mo ago
Foolishly, QUIC is not little-endian [1]. The headers are defined to be big-endian. Though, obviously, none of UDP, TCP, or QUIC define the endianness of their payload so you can at least kill it at that layer. [1] https://www.rf
195.
▲
by
Veserv
10mo ago
No. I am talking about multi-level security [1] which allows a single piece of hardware to handle top secret and unclassified materials simultaneously via software protection. This protection is limited to software attempts to access top se
196.
▲
by
Veserv
10mo ago
That is a artifact of implementation. Monolithic operating systems with tons of shared services expose lots to their tenants. Austere hypervisors, the ones with small API surface areas, basically implement a microkernel interface yet both e
197.
▲
by
Veserv
10mo ago
A headline that actually undersells the article. The 2,900,000,000 $ deal to 7,400 $ is not just a 99% reduction, it is actually over a 99.999% reduction. I guess that is one way to get the "march of nines" they keep promising.
198.
▲
by
Veserv
10mo ago
Yes, I meant all of that when I explicitly said feature parity at 100 Gb/core-second. Reliable delivery of multiple independent bytestreams (which is actually more than SCTP gives since SCTP still suffers from head-of-line blocking due
199.
▲
by
Veserv
10mo ago
While it is nice that it is faster, ~7 Gb/core-second using a in-process "virtual network", (thus only measuring the protocol implementation itself instead of the rest of the network stack) is not exactly a fast network proto
200.
▲
by
Veserv
10mo ago
No. They refuted the claim that "a static type check is just a stand-in for a unit test". That is a claim that you can just remove your type checks and replace them with unit tests at no loss. The comment stated that removing a ty
201.
▲
by
Veserv
10mo ago
The problem is actually that nobody uses the generic solution to these classes of problems and then everybody complains that the special-case for one set of parameters works poorly for a different set of parameters. Nagle’s algorithm is jus
202.
▲
by
Veserv
10mo ago
You do not even need to force water rights owners to list their rights on the open market. They already want to, it is just illegal for them to sell their water rights (separate from their land) to entitys with more productive uses of the w
203.
▲
by
Veserv
10mo ago
I prefaced all my statements with the assumption that the chosen logging system is not poorly designed and terribly inefficient. Sounds like their logging solutions are poorly designed and terribly inefficient then. It is, in fact, a self-f
204.
▲
by
Veserv
10mo ago
I already accounted for consumed resources when I said 10 million instead of 100 million. I allocated 10% to logging overhead. If your service is within 10% of overload you are already in for a bad time. And frankly, what systems are you us
205.
▲
by
Veserv
10mo ago
Saying they are all the same when no fidelity is lost is missing the point. The only distinction between logs, traces, and metrics is literally what to do when fidelity is lost. If you have insufficient ingestion rate: Logs are for events
206.
▲
by
Veserv
10mo ago
I do not see how logging could bottleneck you in a degraded state unless your logging is terribly inefficient. A properly designed logging system can record on the order of 100 million logs per second per core. Are you actually contemplatin
207.
▲
by
Veserv
10mo ago
Unary thinking has no place when considering software quality or security. Just because things have vulnerabilities does not mean that the category, severity, and frequency of them is a irrelevant consideration. The Log4j vulnerability was
208.
▲
by
Veserv
10mo ago
Wait, are you talking about Tesla? Since they are the ones who fabricated ridiculous claims like old versions of FSD using old hardware on arbitrary roads using untrained customers as safety drivers average ~5 million miles per collision an
209.
▲
by
Veserv
10mo ago
The most damning thing is that the most advanced version, with the most modern hardware, with perfectly maintained vehicles, running in a pre-trained geofence that is pre-selected to work well [1] with trained, professional safety drivers,
210.
▲
by
Veserv
10mo ago
Available QUIC implementations are very slow. MsQUIC is one of the fastest and can only reach a meager ~7 Gb/s [1]. Most commercial implementations sit in the 2-4 Gb/s range. To be fair, that is not really a problem of the protoco
More ›