If you are interested in doing this in golang I wrote a library to avoid needing cgo: https://github.com/kevmo314/go-usb

I use this to access UVC devices correspondingly without cgo: https://github.com/kevmo314/go-uvc

And for Rust, https://github.com/kevinmehall/nusb

If someone else finds a cryptocurrency vulnerability, they too will reallocate as much of your allocation as they can and cash it out.

often, a mind capable of doing something like this is not the kind that gives a lot of sh*t about things like "money" so I would put a chance of your statement being true at ... 12.78% :)

A fool and their money are easily parted.

This might be some journalistic confusion. If you go to the CERN documentation at https://twiki.cern.ch/twiki/bin/view/CMSPublic/AXOL1TL2025 it states

> The AXOL1TL V5 architecture comprises a VICReg-trained feature extractor stacked on top of a VAE.

What is git if not a database for source code?

Meh, then filesystems are databases for bytes. Airplanes are buses for flying.

I could make that argument, but I wouldn’t believe it.

Both of those statements are true.

It is funny that the AI's counterarguments amount to "you're hallucinating"

Hahaha, probably right though.

Someone with the ability to register .gov domains is trying to make a sneaky buck.

It used to be anyone with a fax machine could register any .gov but they fixed that when there was a news report about it.

I was curious about this, so for anyone else who’s interested, here’s a KrebsOnSecurity article from 2019 about how easy it was to fraudulently register a .gov domain:

https://krebsonsecurity.com/2019/11/its-way-too-easy-to-get-...

I haven’t seen any follow-up reporting, but it looks like the process now requires some semblance of identity verification:

https://get.gov/domains/before/

Not a lawyer, but as I understand copyright is bound to distribution so if the person's perfect memorization of a book results in them reproducing it verbatim then probably yes.

I don’t even trust myself to not mess up my git repo

The core search algorithm is very simple though. 4KB engines may not run that fast if they do exhaustive search, but they’ll be quite accurate.

According to TCEC the time control is 30 mins + 3 sec, that’s a lot of compute!

If you look at the current winner [1], it does a lot more than just brute force tree search. The space state for chess is simply too big to cover without good heuristics. Deep Blue may have been a pure brute force approach to beat Kasparov after Deep Thought failed using the same core algorithm, but modern chess engines search far deeper on the tree with far fewer nodes than Deep Blue ever could thanks to better heuristics.

[1] https://github.com/MinusKelvin/ice4

I'm not suggesting that it's only brute force tree search, just that it's not very complicated to develop a theoretically perfect chess engine in direct response to the parent

> It's wild to think that 4096 bytes are sufficient to play chess on a level beyond anything humans ever achieved.