dom0

93 ms·

961.
by dom0 10y ago
So? I claimed neither.
962.
by dom0 10y ago
> I want my office to be quiet. The loudest thing in the room – by far – should be the occasional purring of the cat. Any reasonably well built desktop PC does that. It's a matter of applying a modest amount of care when selectin
963.
by dom0 10y ago
Well, and the airflow looks a lot like "uhm, I'm just gonna slap fans all over it, that's probably fastest ^W best, k?".
964.
by dom0 10y ago
dd is for handling blocked data, while cat, redirection and pipelines are completely useless for that, since they are not meant to manipulate blocks of data, but streams. They do not compare (apart from really simple cases where either will
965.
by dom0 10y ago
This looks superficially similar to (a related subset of) QML code. Rectangle { id: photo // id on the first line makes it easy to find an object property bool thumbnail: fal
966.
by dom0 10y ago
If your application would be constrained by that, then it would not be written in an interpreted language in the first place.
967.
by dom0 10y ago
Funny, my btrfs story is somewhat similar. I don't hit severe bugs, though, just severe performance issues. E.g. btrfs on / always sooner or later means for me that the entire IO to the disk that's on will be _thrashed_ durin
968.
by dom0 10y ago
CRC32c -> I saw this many times fail to detect corruption on message lengths anywhere between a couple kB and a few MB. btrfs blocks are 16 kB iirc, so in range. The longer hashes of ZFS, Borg and so on mean that if it's corrupted I
969.
by dom0 10y ago
btrfs only uses CRC32c which is weakish. ZFS is great but not exactly portable. I started to use Borg now for archiving purposes as well, not just backup. For me (low access concurrency, i.e. single or at most "a few" users) that
970.
by dom0 10y ago
To be fair, the MM primitives that we have today are the same we had in 1979, while the capabilities of the hardware evolved, and the actual needs evolved, too. For example, caching. It's essentially impossible to do caching at the app
971.
by dom0 10y ago
For Linux systems in (heavy) interactive use early-oom is a must have , pretty much regardless of how much memory you have.
972.
by dom0 10y ago
Lucky for my ears that the machine is with the others in a rack ;)
973.
by dom0 10y ago
I use a 2x E5-2665 v2 machine (S2600CP4) for building stuff. It's in very small, very cramped 2S Supermicro case (2U, less than 60 cm deep). Fun machine. ing loud as hell, uses stacked 40 mm fans... :)
974.
by dom0 10y ago
And for knife sharpening people: 3000 grit (and a leather strip) is enough to almost reach razor sharpness ... with good steel, that is :)
975.
by dom0 10y ago
CRCs are linear, all 'attacks' are efficient on them.
976.
by dom0 10y ago
Spaces are becoming more prevalent because they cause the least confusion (I also think they look nicer/cleaner).
977.
by dom0 10y ago
Funk means RF/radio/wireless. The term originates from the first radio transmitter ever, which used spark gaps (spark = Funke, gap = Strecke/Spalte) to generate detectable RF. So German Funk is actually directly related to th
978.
by dom0 10y ago
There is a German tech saying that goes "Wer Funk kennt, nimmt Kabel" ("Those who know wireless, use wires").
979.
by dom0 10y ago
> I clicked through to find you are "antifa". Didn't you get the memo? Oh please, most of these people never used their brains to think. At least, that's my personal experience with them.
980.
by dom0 10y ago
Both SHA-3 and BLAKE2 are not susceptible to length extension. Keyed BLAKE2 is actually just a prefix MAC (which would be completely unsecure with SHA-1/2 / classic Merkle-Damgard).
981.
by dom0 10y ago
This works the same way with any Merkle-Damgard-constructed hash function; basically it's just a length extension attack.
982.
by dom0 10y ago
This makes the output length rather odd (not even divisible by 4 bytes), although that wouldn't matter much in non-performance critical applications. Also to keep in mind; when using hashes as a key for something (file name, hash table
983.
by dom0 10y ago
Depending on the application the overhead of 512 bits vs 256 bits is significant. In these applications SHA-512-256 and BLAKE2b-256 are my go-to recommendations. I don't recommend SHA-3; it's design is obviously considered very so
984.
by dom0 10y ago
At just 60 MB/s it doesn't matter much (even 512 byte blocks would just be a little more than 100k syscalls / second). At a couple hundred MB/s it begins to matter, and with faster NVMe SSDs it's a legit issue. This
985.
by dom0 10y ago
Uhm, does dd contain all the logic to work with that or is that literally just O_DIRECT |ed into the flags?
986.
by dom0 10y ago
And that's why sane people will tell you to not use something like st_blksize as the IO size, because that's far to small. Many tools use 32 KiB, but that can be limiting even on Linux and needlessly uses more CPU (especially if F
987.
by dom0 10y ago
You can of course use multithreading to get parallelism, eg. if the expensive calculations are not done in Python itself but rather some other library, be it cryptography, compression, numpy, serdes'ing stuff and so on. I/O works
988.
by dom0 10y ago
> German tax laws are no laughing matters Which are?
989.
by dom0 10y ago
> We (the Git project) got control of the git-scm.com domain this year. We > have never really had an "official" website, but I think a lot of people > consider this to be one. So, uh, git-scm.com wasn&
990.
by dom0 10y ago
Seeing someone trying to work with it sometimes reminds me of someone trying to hold a hot potato in their hands. For example, today someone tried to display two PDFs and a word doc on a large screen. Well. I guess you know how long that to

More ›