more_original
Joined 17 years ago
Joined 17 years ago
Here is a video comparing a tram ride through Leipzig in 1992 with one in 1931:
> [makes Nazi-comparison]
Edit: Parent changed
> Downvoted without response? I guess I shouldn't be surprised, groups that resort to tactics like those at Berkeley are hardly above trying to silence discussion here with downvotes.
into
> (But I'd rather we avoid Nazi comparisons altogether. They can be an effective way for an author to get attention but they can be used by both sides and they rarely lead to useful discussion.)
The latter I can agree with.
commit: "Add BufRefs and switch to YiString for all internal representations" (23 hours ago)
https://github.com/ChrisPenner/rasa/commit/bb95a3263fc40120e...
The early transition years from Gnome 2 to Gnome 3 were rough, and I switched to KDE for this time. KDE was fine, but Gnome 3 has been polished a lot in the last view years. So I switched back to Gnome 3 and never looked back :).
So what? Depopulation happened anyway due to unemployment. I'm not convinced that substantially more people would have left if reunification had been planned for 1995, for example.
But at the time people were discussing different ways of performing the reunification. The SPD under Lafontaine proposed a slower approach rather than an immediate reunification. He made the point that because of the crumbling infrastructure and desolate state of the economy, a unification wouldn't be easy, resulting in unemployment etc.
These warnings turned out to be true, and people should have known. But people didn't listen and voted for CDU in great numbers, because they promised it all. And I think one reason for this is that the warnings also came from the old media, so many people thought "They've been lying for so long, this must be false."
Right, but they would have to re-do their enormous calculation. ("This attack required over 9,223,372,036,854,775,808 SHA1 computations.")
Google started with a common prefix p (the PDF header), then computed blocks M11, M12, M21 and M22, such that (p || M11 || M21 || S) and (p || M12 || M22 || S) collide for any suffix S. Given p, M11, M12, M21 and M22, anyone can make colliding PDFs that show different contents quickly. But to generate a collision with a different prefix q, e.g. one including the file size, one would have to do the expensive computation all over again, I think.
Note: I'm not trying to argue that SHA-1 can be made secure with padding. I was just trying to say that the statement "The PDFs have the same size" misses the point.