peff

8 ms·

31.
by peff 9y ago
I think it's not about re-broadcasting, but about providing the show in a better format. The originals were shot on 35mm film, and then that was "mixed down" with the visual effects to some lower-definition format (maybe SVHS
32.
by peff 9y ago
This doesn't mention one of my favorite bash gotchas, which is using `set -e` with `pipefail` at all. Try this: set -euo pipefail yes | head That will consistently exit because `yes` gets sigpipe and quits. Which is expect
33.
by peff 9y ago
It's essentially the same except for the arguments. `save` took the whole command-line to be the stash message, which was confusingly unlike the rest of Git (and needed to be addressed before pathspec support could be added).
34.
by peff 9y ago
Yes, you're right. The `push` command was added because of backwards compatibility issues with `save` (and essentially replaces it).
35.
by peff 10y ago
I'm not sure what you mean by this last sentence. But Git always computes the SHA1 of incoming objects (that's how it knows that the SHA1 is; the other side doesn't send it). And it likewise confirms that it has every object
36.
by peff 10y ago
Using "set -e" with pipefail is racy because of SIGPIPE. For example, if you do this: some_command | head Then depending on timing, `some_command` _may_ generate all of its output and stuff it into the pipe, exiting succe
37.
by peff 10y ago
You can already play with this using Git's "grafts" and "replace refs" features. Most of Git's graph algorithms are OK with this because they traverse the graph while setting one or more "SEEN" bits o
38.
by peff 10y ago
No, it's better than that. It detects evidence of the cryptanalytic tricks that were used to generate that collision. So it will find any collision generated using their attack technique (which is ~2^63 operations, as opposed to 2^80 f
39.
by peff 10y ago
It is possible; the researchers estimate the likelihood of a false positive at 2^-90 (which puts us back in "Sun engulfs the Earth" territory). There are metrics that will alert GitHub's infrastructure team if a collision is
40.
by peff 10y ago
https://en.wikipedia.org/wiki/Linear_congruential_generator
41.
by peff 10y ago
The simplest solution is: # try the merge; you'll get conflicts on those files git merge topic # discard the versions from the topic branch; # you know you already merged those changes in # the funny "git ch
42.
by peff 10y ago
The counter never resets, it just keeps going up and we only look at the low bits. So eventually it will need to wrap. It's doubtful that ever happened in practice, even on a 32-bit system (you'd need to print 2 billion SHA-1s in
43.
by peff 10y ago
Right, I am so used to the square approximation being used for hash collisions that I forgot it was an approximation. Thanks for setting me straight.
44.
by peff 10y ago
That is a nice writeup. One of the interesting things for me was to see which topics you decided to cover and which to omit. For instance, I noted `clone --reference --recurse-submodules` as a potential topic of interest, but I am afraid to
45.
by peff 10y ago
A nice side effect of hex is that you can pick it out of a text commit message with higher accuracy (e.g., to turn it into a hyperlink). Tools like `gitk` and sites like GitHub do this using a regex.
46.
by peff 10y ago
As others have noted, there's not always an unambiguous date for some object types (the best you can do for blobs is to find the first commit in which they appeared, and use its date). However, there'a more complicated issue with
47.
by peff 10y ago
Oh, you're right. I misread the chart (and just fixed the blog post). There are a lot of other caveats, too. Such as the idea of each year being an independent probability.
48.
by peff 10y ago
There's a lot of academic work in this area, some of it going back 20 years. The keyword to look for when searching for papers is "receipt-free" voting.
49.
by peff 10y ago
You can store the values in a trie (e.g., with one node per character in the string). Exact lookup in the trie is O(string_length), like a hash table. Inexact lookup can similarly walk the tree, but explore side branches within a certain bu
50.
by peff 10y ago
Err...isn't the "... is typing" message configurable and can be disabled if you don't like it?
51.
by peff 10y ago
It sounds like you are reinventing CAPTCHAs.
52.
by peff 10y ago
https://en.wikipedia.org/wiki/Inverted_pyramid I actually agree with your list; I think the inverted pyramid is really about prose construction in an age where print space was at a premium. We can be a lot more free wi
53.
by peff 10y ago
I hope to one day push the highlighting inside of git itself. That should make it more efficient, and we can do a true LCS diff to find the common parts, rather than the front/back heuristic it currently does (see the diff-highlight RE
54.
by peff 10y ago
It doesn't. It's just more convenient to use, and we took the opportunity to make people aware of the existing `--exec` feature.
55.
by peff 10y ago
That continuous flow is new(-ish). My father had an LVAD in 2002, and it was the older type that actually pumps rhythmically, so that was his pulse. At the time continuous-flow models were in research, and I do remember there were concerns
56.
by peff 10y ago
Minor nit: this post mentions v2.7.1 as safe from these vulnerabilities, but it is not. v2.7.4 is the first safe version (this mistake was inherited from the bogus oss-security post that is linked in the article).
57.
by peff 10y ago
This is being worked on: https://github.com/git/git-scm.com/pull/741
58.
by peff 11y ago
From the very first section (Backward compatibility note): The rsync:// transport has been removed.
59.
by peff 11y ago
I think it is a combination of two things: - the mod-256 conflict bug is exceedingly rare. Keep in mind that this is mod-256 individual hunk conflicts in a _single file_. Most files in a merge with conflicts have a handful of hunks. Over al
60.
by peff 11y ago
The fork-aware packfiles are bigger, but not as much as you might think. We give up the "best" delta that git can find, but usually there is another one in the same group that is almost as good. I didn't have any numbers on h

More ›