| Latest revision |
Your text |
| Line 2: |
Line 2: |
| | : As are [schools].ac.in | | : As are [schools].ac.in |
| | : I can't get my university (PUC-Rio, in Brazil) too... =/ [[Special:Contributions/139.82.240.51|139.82.240.51]] 18:28, 1 April 2013 (UTC) etandel | | : I can't get my university (PUC-Rio, in Brazil) too... =/ [[Special:Contributions/139.82.240.51|139.82.240.51]] 18:28, 1 April 2013 (UTC) etandel |
| − | : It looks like he may have lifted the restriction, considering all the different urls such as google.com, reddit.com, and even what I have to assume is a porn website. --[[User:LRFLEW|LRFLEW]] ([[User talk:LRFLEW|talk]]) 03:46, 3 April 2013 (UTC)
| |
| | | | |
| | --[[Special:Contributions/137.147.40.248|137.147.40.248]] 13:53, 1 April 2013 (UTC) For an easier time spotting the changes, go to [http://xkcd.com/1193/#verbose] and open your web console | | --[[Special:Contributions/137.147.40.248|137.147.40.248]] 13:53, 1 April 2013 (UTC) For an easier time spotting the changes, go to [http://xkcd.com/1193/#verbose] and open your web console |
| | | | |
| | [[Special:Contributions/199.48.226.89|199.48.226.89]] 10:18, 1 April 2013 (UTC) I put in "caltech.edu" and hashed a lot of words, and "Twilight Sparkle is best pony." was the best result I managed, only off by 496 bits. | | [[Special:Contributions/199.48.226.89|199.48.226.89]] 10:18, 1 April 2013 (UTC) I put in "caltech.edu" and hashed a lot of words, and "Twilight Sparkle is best pony." was the best result I managed, only off by 496 bits. |
| − | : Lol, "only". The results should be binomially distributed, with a mean of 512, so 496 isn't even close to the scores in the ranking. [[User:BKA|BKA]] ([[User talk:BKA|talk]]) 12:44, 2 April 2013 (UTC)
| |
| − |
| |
| − | I noticed when looking at the list of scores that a large number of universities have a best score at 420. According to my calculations, the amount of universities with this score is 2516 out of the 2824 universities listed. Is there any reason that so many universities have the exact same score? --[[User:LRFLEW|LRFLEW]] ([[User talk:LRFLEW|talk]]) 03:38, 2 April 2013 (UTC)
| |
| − |
| |
| − | : +1! A few hours ago this wasn't the case... What's up with all the 420's?? [[Special:Contributions/108.218.230.91|108.218.230.91]] 03:42, 2 April 2013 (UTC)
| |
| − | :People keep posting hash values on the internet. Those universities are dirty cheaters, and they're all just entering the 420 hash in for their university without actually calculating it. '''[[User:Davidy22|<u>{{Color|#707|David}}<font color=#070 size=3>y</font></u><font color=#508 size=4>²²</font>]]'''[[User talk:Davidy22|<tt>[talk]</tt>]] 04:05, 2 April 2013 (UTC)
| |
| − |
| |
| − | :: While this copy-cattism might be the reason for the proliferation of 420s (which, in India, is slang that, funnily enough, refers to a confidence-trickster) - note that at the beginning of the contest, a lot of different domain names all had 'scores' between 400-500. Now, if I'm not wrong, the hash contains 1024 bits. So you could be off by 1024 in the worst case, and 0 in the best case. But the spread was very narrow. Admittedly, you wouldn't notice the higher numbers, because only the best case scenario has been published, but from the clustering of the different universities (with respect to their scores), as well as the fact that it's taking this long for even ONE clear best score to emerge, seems to suggest that there IS something special about the 400-500 score band. Does anyone have any layman-level information on the statistics of the entropy of the Skein hash function? And the statistics of what error figure for random hash compared to given hash is most frequent? [[Special:Contributions/220.224.246.97|220.224.246.97]] 18:26, 2 April 2013 (UTC)
| |
| − |
| |
| − | :::a hash is, at best, very close to a random number. Here, we have two 1024-bit random numbers. It makes sense that most commonly, two such random numbers differ in about half of the bits - for each bit, there's a 50% probability that the bits will be the same and 50% that they will differ. Therefore the spread centers on 512, but of course we just see the lower part of the spread here. [[Special:Contributions/2.223.68.79|2.223.68.79]] 23:46, 2 April 2013 (UTC)
| |
| − |
| |
| − | :: My test here shows that the 420s is that 420 Bits wrong is about what a single computer can get to within a few hours. So its no wonder that 420s are common for a lot of universities. Its just someone there who is running a little script to break the hash.
| |
| − | [[Special:Contributions/91.214.44.212|91.214.44.212]] 23:34, 2 April 2013 (UTC)
| |
| − |
| |
| − | ::: Although it's true that if you run a PC for a couple of hours, you're very likely ending up somewhere between 415 and 425, this does not explain such a peak at 420. If you consider the probability function for a PC's best result within a day, then maybe 420 is the most likely outcome, but you should see a lot of 421s, 419s, 418s and so on: Seeing a number in 419...415 before you see a 420 should have a chance > 0.5. [[User:BKA|BKA]] ([[User talk:BKA|talk]]) 11:47, 3 April 2013 (UTC)
| |
| − |
| |
| − | :::: 420 is stoner slang for marijuana. Evidently someone (or many someones) thought it would be funny to have that number associated with their school. {{unsigned|69.180.123.64}}
| |
| | | | |
| | All I see is a blank white 780x969 image. Nothing appears when I hover over stuff. [[Special:Contributions/109.65.100.208|109.65.100.208]] 09:04, 1 April 2013 (UTC) | | All I see is a blank white 780x969 image. Nothing appears when I hover over stuff. [[Special:Contributions/109.65.100.208|109.65.100.208]] 09:04, 1 April 2013 (UTC) |
| Line 68: |
Line 50: |
| | Has anyone been able to reproduce the 1024-bit Skein hash values that he is generating at http://almamater.xkcd.com/? The hashes that he shows don't match the ones I'm getting from my Skein hash calculator (using 1024 bit output and 1024 bit internal state size). I tried feeding the same string into the hash function both with and without a trailing null character and neither matches. For example, if I type abc into the form, he shows 35a599...1f1f (edited for brevity), but I calculate that a hash of the 3-byte message "abc" should be 10a866...035c.[[User:Theodric|Theodric]] ([[User talk:Theodric|talk]]) 22:03, 1 April 2013 (UTC) | | Has anyone been able to reproduce the 1024-bit Skein hash values that he is generating at http://almamater.xkcd.com/? The hashes that he shows don't match the ones I'm getting from my Skein hash calculator (using 1024 bit output and 1024 bit internal state size). I tried feeding the same string into the hash function both with and without a trailing null character and neither matches. For example, if I type abc into the form, he shows 35a599...1f1f (edited for brevity), but I calculate that a hash of the 3-byte message "abc" should be 10a866...035c.[[User:Theodric|Theodric]] ([[User talk:Theodric|talk]]) 22:03, 1 April 2013 (UTC) |
| | | | |
| − | :I'm getting completely different values also. [[Special:Contributions/173.22.172.7|173.22.172.7]] 22:57, 1 April 2013 (UTC)
| + | "Wikipedia article on {{hint: The perpetrators of the largest extinction in Earth's history}}" Would this be humans? I'm afraid to get in on the Wikipedia editing since I'm already in so-so standing due to some childishness in 2006... [[Special:Contributions/76.106.251.87|76.106.251.87]] 21:54, 1 April 2013 (UTC) |
| − | | |
| − | :I have the same problem as you. I'm thinking that Xkcd is using an older standard of the encryption. I'm currently trying out the php versions of the code to see if I can get it to work. --[[User:LRFLEW|LRFLEW]] ([[User talk:LRFLEW|talk]]) 23:16, 1 April 2013 (UTC)
| |
| − | | |
| − | ::Nope. Tried all I could and still couldn't figure it out. My guess is that he's using a secret salt. --[[User:LRFLEW|LRFLEW]] ([[User talk:LRFLEW|talk]]) 23:37, 1 April 2013 (UTC)
| |
| − | | |
| − | :::'''Solved!''' :) I was originally using version 1.2 of the Skein hash function. Version 1.3 uses different constants and yields different results. The almamater page seems to be using version 1.3 -- my calculator now matches Randall's hashes.--[[User:Theodric|Theodric]] ([[User talk:Theodric|talk]]) 03:34, 2 April 2013 (UTC)
| |
| − | | |
| − | ::::Where are you getting the implementation? I can't seem to get it to work even with v1.3. --[[User:LRFLEW|LRFLEW]] ([[User talk:LRFLEW|talk]]) 04:42, 2 April 2013 (UTC)
| |
| − | | |
| − | ::::I'm using source code from here: http://www.skein-hash.info/sites/default/files/NIST_CD_102610.zip. I'm using the code in the Optimized_64bit directory. All C files were compiled with gcc as well as http://theodric.com/test_skein.c --[[User:Theodric|Theodric]] ([[User talk:Theodric|talk]]) 10:00, 2 April 2013 (UTC)
| |
| − | | |
| − | :::::Thank you for the example code. I had two errors in how I was implementing it. The interesting problem I ran into was that the string to hash needs to be formatted for the web (so space becomes '+', ext.) --[[User:LRFLEW|LRFLEW]] ([[User talk:LRFLEW|talk]]) 17:02, 2 April 2013 (UTC)
| |
| − | | |
| − | :::: Confirmed, xkcd uses skein 1.3. Did anyone find another implementation (besides the reference implementation)? I wasted an hour starting with the Java impl, before I decided to re-fresh my C, but now I am running roughly 7 million tests per minute on my poor notebook ;) Still way too slow to catch up with the current leaders. My best score is 415. [[User:BKA|BKA]] ([[User talk:BKA|talk]]) 12:26, 2 April 2013 (UTC)
| |
| − | | |
| − | "Wikipedia article on {hint: The perpetrators of the largest extinction in Earth's history}" Would this be humans? I'm afraid to get in on the Wikipedia editing since I'm already in so-so standing due to some childishness in 2006... [[Special:Contributions/76.106.251.87|76.106.251.87]] 21:54, 1 April 2013 (UTC) | |
| − | | |
| − | The opening line of the first panel has changed. It's now "Ahoy, Carnegie Melonites!" (for the current school) rather than "Hey, [university] students!" (as listed in all the current entries for the changing first panel text). The question and response seem to be the same as before.
| |
| − | And the fifth panel now has "if they're clever with their applications" instead of "provided any of them manage to fill out the application correctly". So showing the text as static in the comic image is no longer accurate.
| |
| − | --[[Special:Contributions/50.0.108.18|50.0.108.18]] 23:00, 1 April 2013 (UTC)
| |
| − | | |
| − | If I visit http://xkcd.com/1193/ then the font is xkcd-Regular, whereas if I visit http://www.xkcd.com/1193/ then the font is the default serif font… (Iceweasel with NoScript) [[Special:Contributions/178.238.159.109|178.238.159.109]] 02:44, 2 April 2013 (UTC)
| |
| − | | |
| − | : The font is loaded from [http://xkcd.com/fonts/xkcd-Regular.otf], regardless of where you see the comic from. However, Iceweasel (and presumably Firefox) dissallow cross-site access. For this reason, https://xkcd.com/1193/ also gets the default serif font. [[Special:Contributions/128.211.198.17|128.211.198.17]] 22:24, 3 April 2013 (UTC)
| |
| − | | |
| − | Someone, please explain what hash breaking is. [[User:Jackdavinci|Jackdavinci]] ([[User talk:Jackdavinci|talk]]) 04:00, 2 April 2013 (UTC)
| |
| − | | |
| − | :A cryptographically-secure hash function maps a set of numbers onto another set of numbers in such a way that converting forwards is easy, but converting back is difficult. The idea is that given a key and a lock, you can check the key against the lock by hashing the key and seeing if it maps to the lock. But given just the lock, you can't generate the key (easily). Randall gave us a lock, and the competition is to find the closest key. This is basically a competition to see who has the most computing power to generate lots and lots of keys. Keep in mind, I've glossed over a lot of technical details here. --[[Special:Contributions/173.162.57.51|173.162.57.51]] 15:22, 2 April 2013 (UTC)
| |
| − | | |
| − | :: There should be some cleverness involved in addition to access to computers. It all comes down to who can generate the most hashes in the time available, because as a good cryptographic hash Skein gives you no hint about how to change your input to get a result closer to your target, you just have to keep making guesses. But that is not just a matter of how many computers you have. For example, Googling around for implementations of Skein I didn't find any ready to run libraries for GPUs of Skein 1024 1024. A team at a university could have stuck with an existing C implementation running on an available set of computers, or taken the time to get it running on GPUs and get quite a bit of extra speed. Also, I haven't experimented with it, but a hash function should be faster if you give it a smaller input. The current best result from CMU would take on the average about 1 quadtrillion (1e15) trials to find. Given that the input to the hash has to be in the form of URL-safe printable characters, if you assume that your team will not have time to generate more than, say 1e16 hashes and the character set you have to work with is 100 characters (my guess from looking at my keyboard) then your test input strings do not have to be longer than 8 characters. Anyone who is generating test input for the hash that is any longer, for example if they are, as a really bad example, converting 1024-bit numbers to 256 ASCII character hex, is doing at least 32 times too much work for each hash calculation. [[User:Bugstomper|Bugstomper]] ([[User talk:Bugstomper|talk]]) 00:37, 3 April 2013 (UTC)
| |
| − | :The time it takes to compute a Skein hash depends only on the number of bits of internal state, not of the input. This is intentional; if the execution time were dependent on input length, an attacker could execute a timing attack on the hash. AES is known to be sensitive to such attacks, but Skein is resistant. [[Special:Contributions/140.254.153.76|140.254.153.76]] 04:14, 3 April 2013 (UTC)
| |
| − | | |
| − | Is it over now that it's after midnight? When I moused over the school name, it didn't give me a pop-up showing the next hint. [[Special:Contributions/76.106.251.87|76.106.251.87]] 06:06, 2 April 2013 (UTC)
| |
| − | | |
| − | :I would assume so. The wikipedia challenges needed to be done manually, automatic ones would be blocked by wikipedia staff (see my point about Elixir page). Also, making people vandalize wikipedia is not exactly nice. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 08:52, 3 April 2013 (UTC)
| |
| − | | |
| − | Do you suppose the "Needs more Bob" possibility in the second panel is a reference to Microsoft Bob (an absolutely and justly reviled Microsoft product from the 90's)? [[Special:Contributions/66.140.241.100|66.140.241.100]] 11:25, 2 April 2013 (UTC)
| |
| − | | |
| − | Scary Thought #392:
| |
| − | 'Time' and 'Extenalities' are giving Explainxkcd heavy loads. This may be on purpose. Randall might upload yet another 'heavy' comic. [[User:Greyson|Greyson]] ([[User talk:Greyson|talk]]) 14:05, 2 April 2013 (UTC)
| |
| − | :It does feel like he sometimes just releases comics that do unusual edge-casey things, just to see us wiki editors struggle with handling the comic. Then again, it might just be Randall trying to make a really dynamic and novel webcomic. '''[[User:Davidy22|<u>{{Color|#707|David}}<font color=#070 size=3>y</font></u><font color=#508 size=4>²²</font>]]'''[[User talk:Davidy22|<tt>[talk]</tt>]] 14:28, 2 April 2013 (UTC)
| |
| − | :At the moment, xkcd.com seems to be down. Coincidence? --[[User:Johnsmith|Johnsmith]] ([[User talk:Johnsmith|talk]]) 06:49, 3 April 2013 (UTC)
| |
| − | | |
| − | I'm surprised no one had added the Activision/Blizzard versions. I know it wasn't up for long, but I expected we'd have a ton of gamers jumping at the chance to add that version of the comic. (Good thing I screen-captured it so I had a reference to work from!)
| |
| − | | |
| − | Did anyone try using http://xkcd.com/936/ as a method of generating hash inputs? --[[User:Theodric|Theodric]] ([[User talk:Theodric|talk]]) 13:18, 6 April 2013 (UTC)
| |
| − | : Someone reported the [http://echochamber.me/viewtopic.php?f=7&t=101147&start=160#p3314970 horse (plus salt)] as a (at this time: rather good) try, provoking a bunch of copycats. However, as was pointed out in the discussion, since we weren't looking for ''the'' correct hash, but merely a good ''approx'', brute force remained the method of choice (at least within the Top10, I'd say)... Still, maybe some regular could properly include the x-ref to the strip; after all, it ''could'' have been Randall "only" making his point. [[Special:Contributions/134.61.103.44|134.61.103.44]] 10:57, 7 April 2013 (UTC)
| |
| − | | |
| − | You're missing one of the dog panels: http://imgs.xkcd.com/comics/externalities/65668a72a3705ffc90ac924e7d5e2a3b75c2419886474fef2f0937dc96f2f3f1.png. --[[Special:Contributions/71.193.152.91|71.193.152.91]] 21:14, 6 April 2013 (UTC)
| |
| − | | |
| − | Baidu references:
| |
| − | | |
| − | :Baidu is a large Chinese Internet services company that employs thousands, whose shares are publicly traded on world stock exchanges. It's the predominant Internet search provider of China, and is sometimes called the "Google of China". It offers parallels for the Chinese market of many of the services that Google provides and offers its own encyclopedic wiki with a restricted edit policy to serve as a replacement for Wikipedia.
| |
| − |
| |
| − | :Wikipedia reports that Baidu's search engine handled 56% of Chinese internet search queries in Q4 2010. and that in October 2012, Baidu ranked 5th overall in the Alexa Internet rankings.
| |
| − | | |
| − | :Given that explanation for the Baidu references in #1193 is still solicited for explainxkcd, Baidu apparently is not well known yet among savvy XKCD readers.
| |
| − | | |
| − | :Baidu Search results reputedly follow the censorship dictates of the Chinese authorities, causing it to return censored responses to searches for politically sensitive terms like "Tianamen Square massacre" or "Falun Gong" when executed by web browsers that are connected via Chinese ISPs.
| |
| − | | |
| − | :When you execute such searches via Baidu in the US, the top links returned for these topics do seem to reflect Chinese government sensibilities although the uncensored English language Wikipedia articles for these topics are listed high in the query results.
| |
| − | | |
| − | :Baidu's reputation for censorship provides background for Megan's reply "but nothing about Tianamen Square" in response to the "Come and find your future at Baidu" employment enticement of panel one and also provides the background to understand the "It takes great minds to stifle other great minds" slogan of the second panel.
| |
| − | [[User:DLuebbert|DLuebbert]] ([[User talk:DLuebbert|talk]]) 04:42, 2 December 2013 (UTC)
| |
| − | | |
| − | ;Today's incomplete explanation (November 30, 2013)
| |
| − | I have done some layout changes and I did add the final transcript. Please check if it is correct to all countries.--[[User:Dgbrt|Dgbrt]] ([[User talk:Dgbrt|talk]]) 22:22, 30 November 2013 (UTC)
| |
| − | | |
| − | The comic isn't on xkcd anymore. [[Special:Contributions/108.162.215.43|108.162.215.43]] 05:06, 7 February 2014 (UTC)
| |
| − | :There was a glitch on some ''dynamic'' servers for a few days; it seems to be solved right now. --[[User:Dgbrt|Dgbrt]] ([[User talk:Dgbrt|talk]]) 20:51, 7 February 2014 (UTC)
| |
| − | | |
| − | This comic does not appear to be working on xkcd at this time - tried both Firefox and Chrome to view it, and saw some error in Firefox about a cross-site scripting violation. Anyone else seeing the same issue? [[User:Ianrbibtitlht|Ianrbibtitlht]] ([[User talk:Ianrbibtitlht|talk]]) 12:30, 8 June 2019 (UTC)
| |
| − | :Yes, I'm seeing the same errors. The comic worked on http, but not on https. --[[User:WhiteDragon|WhiteDragon]] ([[User talk:WhiteDragon|talk]]) 11:43, 23 July 2019 (UTC)
| |
| − | ::The glitch is still there as of November 2019 (I'm seeing a blank box instead, but it's similar). It doesn't work on Chrome, Firefox, Edge, Internet Explorer, or Opera. Should this be mentioned in the comic explanation?--[[User:Account|Account]] ([[User talk:Account|talk]]) 21:49, 13 November 2019 (UTC)
| |
| − | | |
| − | == Decomission ==
| |
| − | | |
| − | The comic is completely blank as of June 2021. Additionally, the other link used to view the hash competition’s leaderboard also cannot be accessed.
| |
| − | :Still true in November 2021. The transcript is still visible in the source for the page, though. Also, please sign comments by typing <nowiki>~~~~</nowiki>. [[User:Nitpicking|Nitpicking]] ([[User talk:Nitpicking|talk]]) 18:10, 7 November 2021 (UTC)
| |
| − | :Comic appears to have returned as of Jan 2024! - Biran [[Special:Contributions/172.70.90.177|172.70.90.177]] 10:38, 25 January 2024 (UTC)
| |
