Freaky

11 ms·

91.
by Freaky 9y ago
PCID's been around for a long time - even my old Westmere Xeons have it. INVPCID is more recent.
92.
by Freaky 9y ago
Borg also supports one potentially-important feature restic does not: compression. https://github.com/restic/restic/issues/21
93.
by Freaky 9y ago
I've used them for a few years, not been particularly impressed with their speed. I'm also currently fighting a problem with the client quietly wedging on upload (not sure how long ago it stopped, but the upload queue was past 6G
94.
by Freaky 9y ago
They have a dedicated account for borg/attic: http://rsync.net/products/attic.html There's also restic, which works similarly, but has native support for cloud storage: https://restic.github.io&#x2
95.
by Freaky 9y ago
There are 9120 printable ASCII strings of 1-2 characters in length. Cunning, including that many to bulk out the list :)
96.
by Freaky 9y ago
Quick script to binary-search for passwords locally: https://gist.github.com/Freaky/4cb7ce8c107c3da2e4a8210356e8d...
97.
by Freaky 9y ago
If you want to dig through history, FreshBSD may be of use: https://v4.freshbsd.org/project/openbsd/src?q=clang
98.
by Freaky 9y ago
Glad you found it useful :)
99.
by Freaky 9y ago
I made one for scan.co.uk: https://hur.st/scandisk/
100.
by Freaky 9y ago
That seems a roundabout way of sizing a bloom filter. Here's what I came up with when I first implemented them for Newzbin: https://hur.st/bloomfilter m = ceil((n * log(p)) / log(1.0 / (pow(2.0, log(2.
101.
by Freaky 9y ago
> At the risk of invoking Cunningham's Law, nobody uses passphrases anywhere near 64 bytes that he / she has to memorize. http://52.24.230.241/bc/password_generation.php This produces memorable passphrases
102.
by Freaky 9y ago
Finally: > *) HTTP/2 support no longer tagged as "experimental" but is instead considered fully production ready.
103.
by Freaky 9y ago
~/.mailcap: text/html; lynx -force_html -dump %s; copiousoutput ~/.muttrc: alternative_order text/plain
104.
by Freaky 9y ago
All my memory is ECC (other than my barely-used laptop). Been there, bought the t-shirt, decided non-parity can go jump in a lake more than a decade ago. http://i.imgur.com/uz2inSy.jpg I encountered this going through a co
105.
by Freaky 10y ago
Escaped here. How are you configuring your completion? -% zsh -f voi% echo $ZSH_VERSION 5.3.1 voi% autoload -U compinit voi% compinit voi% git checkout <tab><tab>\$$./pw3n$ Already on '
106.
by Freaky 10y ago
dd is awful and error-prone for this sort of use. Use noerror, but forget sync? Corrupt output file if there is an error. Use a bigger bs so it's not slow as treacle? A single faulty sector blows away a whole bs of data, and your ou
107.
by Freaky 10y ago
Note: no support for compression. https://github.com/restic/restic/issues/21
108.
by Freaky 10y ago
Playing with its zoom function is fun (Page Up/Down/Home). You can basically reproduce the Hubble Deep Field with it by bumping up the galaxy magnitude limit (F8) and zooming in until the indicator in the lower right reads around
109.
by Freaky 10y ago
More relevant, their latest game: https://www.kleientertainment.com/games/oxygen-not-included System-driven space colony simulation, with a particular emphasis on maintaining breathable air.
110.
by Freaky 10y ago
More colourful cutie: https://www.flickr.com/photos/143940344@N06/31492457834/in/d... And a nice fluffy white one with very stubby legs: http://www.jumpingspiders.co.za/images/main&#
111.
by Freaky 10y ago
That loses you a dd blocksize chunk, which is likely much bigger than the underlying damaged sector. ddrescue or recoverdisk (part of FreeBSD base) will both skip over unreadable blocks, then retry with smaller block sizes along the damaged
112.
by Freaky 10y ago
I just counted my open tabs in Opera 42, and quit it so I could see the memory use. 799 open tabs. 8.5GB. Restarted in around 10 seconds and it's currently using around 2GB. "Delay loading of background tabs" is checked, w
113.
by Freaky 10y ago
> Having the SHA-512 hash at the beginning simplifies the implementation The hash is there to ensure very long passwords contribute entropy to the final hash instead of being truncated. It also ensures the entropy is evenly distributed
114.
by Freaky 10y ago
> Some implementations of bcrypt truncate the input to 72 bytes, which reduces the entropy of the passwords. Other implementations don’t truncate the input and are therefore vulnerable to DoS attacks because they allow the input of arbit
115.
by Freaky 10y ago
http://descanso.jpl.nasa.gov/DPSummary/Juno_DESCANSO_Post121... > On the HGA we expect ≥18 kilobits per second (kbps) (≥12 kbps during Grav passes due to power required for carrier signal), and ≥10 bps on the MGA. H
116.
by Freaky 10y ago
It's mentioned in the comments: > As for the Starshot thing, that sounds like a reboot of Robert Forward's Starwhisp idea from the 1990s. The real problem with that is, how to get any data back from it. (Not to mention how to c
117.
by Freaky 10y ago
mod_http2 is still considered experimental, and the source of 2 of the 3 vulnerabilities announced for 2.4 this year.
118.
by Freaky 10y ago
Most of DRM is MIT licensed, including these two drivers.
119.
by Freaky 10y ago
Last time I checked PV was only supported on i386.
120.
by Freaky 10y ago
The markdown text input is borderline unreadable in Chrome on Windows 10: https://i.imgur.com/vTu2J34.png

More ›