lang4d

https://news.ycombinator.com/item?id=48915709 one of the Connection Machines is in Jurassic Park. Really neat article!

Kalshi currently has the chances at 13% for full republican control of congress

clang-tidy has a check for this case

I'd be surprised if some combination of ASAN and UBSAN wouldn't catch this and similar dangling references

My go to for formatting would be clang-format, and for testing gtest. For more extensive formatting (that involves the compiler) clang-tidy goes a long way

Do you save photos and messages somewhere?

Should this be 18446744073709551615.org? Is it common to use signed integers for timestamps?

Maybe just semantics, but I think I would call that prediction. Even if you have perfect perception (measuring the current state of the world perfectly), it's nontrivial to predict the future paths of other actors. The prediction problem requires intuition about what the other actors are thinking, how their plans influence each other, and how your plan influences them.

Waymo is also in competition with non AV ride sharing companies. They'll need to make it more cost effective and/or (continue to) deliver higher quality rides

That would be one way to silence an unused variable warning

`git bisect run ...` Has been really nice for me when trying to find which which commit broke long running commands. It'll run atomically using the return code for good/bad determination.

Why is it slower compared to a normal list?

The near vacuum on the moon would be tough to construct elsewhere

Hopefully they have a few local benches to iterate on for testing.

I’d imagine contracts with record companies are expensive or difficult to get at a large scale.

I love these sort of debugging stories! It sounds like that timeout would be based on the round trip travel time to the remote host rather than the one way distance, wouldn’t that make a 250 mile cutoff?

The paper has not been peer-reviewed or published yet. But you can read a preprint version on arXiv, submitted on August 28.

Is it common to see these sorts of review articles published before the actual paper is peer reviewed/published? Strikes me as kind of odd, but maybe that’s normal.

The main content of the paper is trying to minimize the number of “russian peasant” multiplications that need to be performed. I would say those are the interesting parts. Section 2.3 claims dropping the number of additions by a factor of 6 from the naive algorithm.

Seems like doing the sorting, recursion, and alignment would have a nontrivial performance penalty, but it’s still a pretty interesting idea.

There are a few companies around the world working on that sort of solution to the public transit problem (called autonomous Personal Rapid Transit), and one or two systems similar to what you’re describing that have been built. Open road autonomy has to deal with all sorts of unexpected situations, still has to contend with traffic (until all cars are communicating with all other cars… very very far in the future), and still quite unprofitable for the driverless robotaxi use case. PRT - and what it sounds like you’re suggesting - get around these types of problems: By operating in dedicated (fenced off) lanes, the perception and planning problems become trivial (especially if you put sensors on the roadway). With one company building and operating the system, coordination between vehicles becomes possible (with no pedestrians and stations off of the mainline, this means little traffic and still high throughput). Small, lightweight vehicles with reduced sensing/compute requirements are cheaper and require less road space (meaning cheaper infrastructure too)

The main downsides I can think of being it would requiring walking to your final destination from the bus stop/station (but for public transit prices instead of Uber prices I’m sure that’d be an appealing option to many), and requires new (or at least dedicated) infrastructure which is a harder sell to companies and cities.

From Part 3, does malloc(PAGE_SIZE) actually guarantee a single full page is allocated or would the allocation be positioned arbitrarily and stretch across two pages?