A link to the preprint. I'll do the actual math on how many transitions/second it works out to later and edit.

I've had an eye on this for like a decade, so I'm hyped.

Edit:

So, because of the structure of the crystal the atoms are in, it actually has 5 resonances. These were expected, although a couple other weak ones showed up as well. They give a what I understand to be a projected undisturbed value of 2,020,407,384,335.(2) KHz.

Then a possible redefinition of the second could be "The time taken for 2,020,407,384,335,200 peaks of the radiation produced by the first nuclear isomerism of an unperturbed ^229^Th nucleus to pass a fixed point in space."

Per the rules, this is the original headline. However, the interesting part is that he's preparing a Gaza offer that he says will be "final".

They've hewn very close to the whole "unconditional support" thing, so I'm curious what that means exactly.

The Wikipedia article on Steiner constructions mentions it, but doesn't explain it, and the source linked is a book I don't have. This has come up in a practical project.

In air. This seems like it should be incredibly basic information but I can't find it anywhere.

Just watched this and thought it was dope. I especially liked the Roman buffets and Foreman grills.

I've been playing with an idea that would involve running a machine over a delay-tolerant mesh network. The thing is, each packet is precious and needs to be pretty much self contained in that situation, while modern systems assume SSH-like continuous interaction with the user.

Has anyone heard of anything pre-existing that would work here? I figured if anyone would know about situations where each character is expensive, it would be you folks.

We have no idea how many there are, and we already know about one, right? It seems like the simplest possibility.

This is about exactly how I remember it, although the lanthanides and actinides got shortchanged.

Unfortunately not the best headline. No, quantum supremacy has not been proven, exactly. What this is is another kind of candidate problem, but one that's universal, in the sense that a classical algorithm for it could be used to solve all other BQP problems (so BQP=P). That would include Shor's algorithm, and would make Q-day figuratively yesterday, so let's hope this is an actual example.

Weirdly enough, they kind of skip that detail in the body of the article. Maybe they're planning to do one of their deep dives on it. Still, this is big news.