explain xkcd - User contributions [en]

Talk:936: Password Strength

2016-07-31T03:58:29Z

A female faust: /* You've Already Memorized It */ new section

''Fix the software first.'' If you double the time it takes to enter each repeated password attempt you make brute force attacks pointless. Imagine you allowed a hurried user who screws up their own password entry w/ frozen fingers. If their system starts out with a 1 second delay, then doubles to two, then to four, etc. the time it takes to wait is 2^n. Six screw ups cost you a minute, twenty errors and you are waiting 291 hours before your next log-in attempt.... kmc 2015-05-10 {{unsigned ip|108.162.229.124}}

: That's not how brute force attacks work. They steal the hashes of the passwords and then brute force them locally. [[Special:Contributions/198.41.235.107|198.41.235.107]] 23:43, 10 January 2016 (UTC)

You still have to vary the words with a bit of capitalization, punctuation and numbers a bit, or hackers can just run a dictionary attack against your string of four words. '''[[User:Davidy22|{{Color|purple|David}}y²²]]'''[[User talk:Davidy22|<tt>[talk]</tt>]] 09:12, 9 March 2013 (UTC)
: Several discussions around the internet around this -- the consensus [ http://www.explainxkcd.com/wiki/index.php/936 looks like] that once this scheme is published it is fairly simple to run a dictionary attack on the password. My advise to most people is to use a password manager like lastpass or onepass that can generate pure random password. [[Special:Contributions/162.158.253.6|162.158.253.6]] 23:52, 10 March 2016 (UTC)

No you don't. Hackers cannot run a dictionary attack against a string of four randomly picked words.
Look at the number of bits displayed in the image: 11 bits for each word.
That means he's assuming a dictionary of 2048 words, from which each word is picked randomly.
The assumption is that the cracker knows your password scheme.
[[Special:Contributions/86.81.151.19|86.81.151.19]] 20:17, 28 April 2013 (UTC)
Willem

:I just wrote a program to bruteforce this password creation method. https://github.com/KrasnayaSecurity/xkcd936/blob/master/listGen936.py Once I get it I'll try coming up with more bruteforcing algorithms such as substituting symbols, numbers, camel case, and the like. Point is, don't rely on this or any one method. I wouldn't be surprised if the crackers are already working on something like this. [[User:Lieutenant S.|Lieutenant S.]] ([[User talk:Lieutenant S.|talk]]) 07:03, 8 September 2014 (UTC)
:It took 1.25 hours to bruteforce "correcthorsebatterystaple" using the 2,000 most common words with one CPU. [[User:Lieutenant S.|Lieutenant S.]] ([[User talk:Lieutenant S.|talk]]) 07:09, 9 September 2014 (UTC)
:: 1) ... as compared to 69 milliseconds for the other method. 2) Since you are able to test 3,9 billion passwords as second (very impressive!) I am guessing that your setup is not performing its attack over a ”weak remote service”, which is breaking the rules of the #936 game. 3) five words and a 20k-wordlist would get you 9400 years (still breaking the weak remote service rule).--[[User:Gnirre|Gnirre]] ([[User talk:Gnirre|talk]]) 09:13, 14 October 2014 (UTC)
:: 2) Two thoughts: You use itertools.permutations, which only covers non-repeating words, but mainly you don't actually hash the password. If you have a plain-text password, there no need to crack the password because you could just look at it. Example of an actual crack for this type of password: https://github.com/koshippy/xkcd_password/blob/master/password_crack.py My computer gets 10,000,000 guesses in ~16 seconds (non-hashed takes ~2 seconds), meaning it would take almost a year to try every combination. (2048^4 total password space). Even optimizing by using c++/java or JtR, you wouldn't see huge improvement since most of the time is from the SHA hashing. Point being: a typical user can't crack this type of password in a short amount of time, even if they know your wordlist. [[Special:Contributions/199.27.128.212|199.27.128.212]] 12:05, 17 February 2015 (UTC) Koshippy

Sometimes this is not possible. (I'm looking at you, local banks with 8-12 character passwords and PayPal) If I can, I use a full sentence. A compound sentence for the important stuff. This adds the capitalization, punctuation and possibly the use of numbers while it's even easier to remember then Randall's scheme. I think it might help against the keyloggers too, if your browser/application autofills the username filed, because you password doesn't stand out from the feed with being gibberish. [[Special:Contributions/195.56.58.169|195.56.58.169]] 09:01, 30 August 2013 (UTC)

The basic concept can be adapted to limited-length passwords easily enough: memorize a phrase and use the first letter of each word. It'll require about a dozen words (you're only getting 4.7 bits per letter at best, actually less because first letters of words are not truly random, though they are weakly if at all correlated with their neighbors -- based on the frequencies of first letters of words in English, and assuming no correlation between each first letter and the next, I calculate about 4 bits per character of Shannon entropy). SteveMB 18:35, 30 August 2013 (UTC)

Followup: The results of extracting the first letters of words in sample texts (the {{w|Project_Gutenberg|Project Gutenberg}} texts of ''The Adventures of Huckleberry Finn'', ''The War of the Worlds'', and ''Little Fuzzy'') and applying a {{w|Entropy_(information_theory)|Shannon entropy calculation}} were 4.07 bits per letter (i.e. first letter in word) and 8.08 bits per digraph (i.e. first letters in two consecutive words). These results suggest that first-letter-of-phrase passwords have approximately 4 bits per letter of entropy. --[[User:SteveMB|SteveMB]] ([[User talk:SteveMB|talk]]) 14:21, 4 September 2013 (UTC)

Addendum: The above test was case-insensitive (all letters converted to lowercase before feeding them to the [[http://millikeys.sourceforge.net/freqanalysis.html frequency counter]]). Thus, true-random use of uppercase and lowercase would have 5 bits per letter of entropy, and any variation in case (e.g. preserving the case of the original first letter) would fall between 4 and 5 bits per letter. --[[User:SteveMB|SteveMB]] ([[User talk:SteveMB|talk]]) 14:28, 4 September 2013 (UTC)

I just have RANDOM.ORG print me ten pages of 8-character passwords and tape it to the wall, then highlight some of them and use others (say two down and to the right or similar) for my passwords, maybe a given line a line a little jumbled for more security. [[Special:Contributions/70.24.167.3|70.24.167.3]] 13:27, 30 September 2013 (UTC)
:Remind me to visit your office and secretly replace your wall-lists by a list of very similar looking strings ;) --[[User:Chtz|Chtz]] ([[User talk:Chtz|talk]]) 13:53, 30 September 2013 (UTC)

Simple.com (online banking site) had the following on it’s registration page:

“Passphrase? Yes. Passphrases are easier to remember and more secure than traditional passwords. For example, try a group of words with spaces in between, or a sentence you know you'll remember. "correct horse battery staple" is a better passphrase than r0b0tz26.”

Online security for a banking site has been informed by an online comic. Astounding.
[[Special:Contributions/173.245.54.78|173.245.54.78]] 21:22, 11 November 2013 (UTC)

The Web service Dropbox has an Easter egg related to this comic on their sign-up page. That page has a password strength indicator (powered by JavaScript) which changes as you type your password. This indicator also shows hints when hovering the mouse cursor over it. Entering "Tr0ub4dor&3" or "Tr0ub4dour&3" as the password causes the password strength indicator to fall to zero, with the hint saying, "Guess again." Entering "correcthorsebatterystaple" as the password also causes the strength indicator to fall to zero, but the hint says, "Whoa there, don't take advice from a webcomic too literally ;)." [[Special:Contributions/108.162.218.95|108.162.218.95]] 15:17, 11 February 2014 (UTC)

The explanation said that the comic uses a dictionary[http://www.explainxkcd.com/wiki/index.php?title=936:_Password_Strength&oldid=59309]. In fact it's a word list, which seems similar but it's not. All the words in the word list must be easy to memorize. This means it's better not to have words such as ''than'' or ''if''. Also, it's better not to have homophones (''wood'' and ''would'', for example). The sentence ''dictionary attack'' doesn't apply here. A dictionary attack requires the attacker to use all the words in the dictionary (e.g. 100,000 words). Here we must generate the 17,592,186,044,416 combinations of 4 common words. Those combinations can't be found in any dictionary. At 25 bytes per "word" that dictionary would need 400 {{w|tebi|binary terabytes}} to be stored. [[User:Xhfz|Xhfz]] ([[User talk:Xhfz|talk]]) 21:37, 11 March 2014 (UTC)

This comic was mentioned in a TED talk by Lorrie Faith Cranor on in March 2014. After performing a lot of studies and analysis, she concludes that "pass phrase" passwords are no easier to remember than complex passwords and that the increased length of the password increases the number of errors when typing it. There is a lot of other useful information from her studies that can be gleaned from the talk. [http://www.ted.com/talks/lorrie_faith_cranor_what_s_wrong_with_your_pa_w0rd Link]. What she doesn't mention is the frequency of changing passwords - in most organizations it's ~90 days. I don't know where that standard originated, but (as a sys admin) I suspect it's about as ineffective as most of our other password trickery - that is that it does nothing. Today's password thieves don't bash stolen password hash tables, they bundle keyloggers with game trainers and browser plugins.--[[Special:Contributions/173.245.50.75|173.245.50.75]] 18:14, 2 July 2014 (UTC)
:: Lorrie Faith Cranor gets the random part of #936 word generation correct, which is great. Regarding memorizability, this study (https://cups.cs.cmu.edu/soups/2012/proceedings/a7_Shay.pdf) does not address #936. The study uses no generator for gibberish of length 11. Most comparable are perhaps two classes of five or six randomly assigned characters. None of the study's generators has 44 bits of entropy – its dictionary for the method closest to #936 – noun-instr – contains only 181 nouns. The article contains no discussion of the significance of these differences to #936. In her TED Lorrie Faith Cranor says ”sorry all you xkcd fans” which could be interpreted as judgement of #936, but there is no basis in the above article for that. It does however seem plausible that the report could be reworked to address #936. --[[User:Gnirre|Gnirre]] ([[User talk:Gnirre|talk]]) 10:42, 14 October 2014 (UTC)

:Password-changing frequency isn't about making passwords more ''secure'', but instead it's about ''mitigating the damage'' of a successfully cracked password. If a hacker gets your password (through any means) and your password changes every 90 days, the password the hacker has obtained is only useful for a few months at most. That might be enough, but it might not. If the hacker is brute forcing the passwords to get them, that cuts into the time the password is useful. --[[Special:Contributions/173.245.54.168|173.245.54.168]] 22:22, 13 October 2014 (UTC)
::However, brute-forcing gets much ''easier'' that way.
::Say the average employee is around for 10 years, which is reasonable for some companies , absurdly high for others, and a bit low for a family business. That's 40 password changes.
::Now if you have to remember another password every now and then, you sacrifice complexity, lest you forget it. A factor of 40 is like one character less. But how much shorter will the password be? It's more likely that it's gonna be 3 or 4 characters less. Congrats, you just a factor of 1000's for a perceived "mitigation", which doesn't even work. Pro attackers can vacuum your server in a DAY once they have the PW. [[Special:Contributions/141.101.104.53|141.101.104.53]] 13:03, 4 December 2014 (UTC)

Just because you are required to have a password that has letters and numbers in it doesn't mean you can't make it memorable. When caps are required, use CamelCase. When punctuation is required, make it an ampersand (&) or include a contraction. When numbers are required, pick something that has significance to you (your birthday, the resolution of your television, ect.). Keep in mind that, if your phrase is an actual sentence, the password entropy is 1.1 bits per character (http://what-if.xkcd.com/34), so length is key if you want your password to be secure. (Though no known algorithm can actually exploit the 1.1 bits of entropy to gain time, so it might be more like 11 bits of entropy per word. Even then, my passwords have nonexistent and uncommon words in them, (like doge or trope), which also adds some entropy.) [[Special:Contributions/108.162.246.213|108.162.246.213]] 22:18, 1 September 2014 (UTC)
:Flip side of the story, the "capital plus small plus other char" policy doesn't make your password any safer.
:The German company T-online had an experimental gateway with the password, "internet". Now that sucked. No problem, tho, because that gateway wasn't accessible from outside. When they went live, they "improved" the password to "Internet1". There are still lots of these passwords around: first letter is a Cap, and the only non-alphabetic char is a 1 at the end. This doesn't add any entropy. [[Special:Contributions/141.101.104.53|141.101.104.53]] 13:03, 4 December 2014 (UTC)
::[http://ask.metafilter.com/193052/Oh-Randall-you-do-confound-me-so#2779020 This] shows that about one third of all digits in a sample of passwords was "1" . [[Special:Contributions/141.101.104.53|141.101.104.53]] 13:14, 4 December 2014 (UTC)
You can also troll the brute-force engine by using words from other languages, fictional books and video games.--[[User:Horsebattery|Horsebattery]] ([[User talk:Horsebattery|talk]]) 03:04, 3 November 2014 (UTC)
:That's a good idea; it adds to the entropy bits per word. If you really want to throw them off, mix different languages. Just don't use very well-known words; I'm sure the hackers have ''cojones'' and ''Blitzkrieg'' in their dictionaries. [[Special:Contributions/141.101.104.53|141.101.104.53]] 13:03, 4 December 2014 (UTC)

Also, passwords that are 'hard to remember' are themselves a security vulnerability. A password reset scheme (or even a lockout scheme) is a vulnerability. The more it needs to be used, the harder it becomes to police that vulnerability. Relatedly, hard-to-remember passwords leave users uncertain whether their password has been changed by someone else or they've just forgotten it. [[User:Ijkcomputer|Ijkcomputer]] ([[User talk:Ijkcomputer|talk]]) 15:32, 18 December 2014 (UTC)

Hi there, this comic gave me the idea for a password generator that can (optionally) use dictionary words. Have a look if you're interested: https://wordypasswords.com Use your common sense though about what is and isn't secure! Hope someone finds it useful. [[User:Mackatronic|Mackatronic]] ([[User talk:Mackatronic|talk]]) 08:23, 9 January 2015 (UTC)

I have not read all of the replies and in truth most of the detail is boring to me but it has occurred to me that with this sort of problem and since the Snowden affair, serious security devices will have to make the keyboard redundant.

At the moment all I can imagine is a series of pictures like hieroglyphs but even using a rolling code of ever changing font glyphs would do. When the security required by money minders reaches the stage of development possible with keyboards that can supply that sort of security, we will have some idea which banks have some idea about security.

Tip:
Not Barings. They have an history of intransigence and stupidity. (Still revered in banks though as able to cure colon cancer with poor investment strategies.)

[[User:Weatherlawyer| I used Google News BEFORE it was clickbait]] ([[User talk:Weatherlawyer|talk]]) 13:46, 23 January 2015 (UTC)

The D0g..................... (24 characters long) is NOT stronger than PrXyc.N(n4k77#L!eVdAfp9 (23 characters long). The reason why, is that the later password is random. There is no pattern. The former, "padding" technique can be very easily cracked. You just need to assume that each character be repeated 1~30 times. Then the first password would become : 1(D)1(0)1(g)21(.), which, is then of complexity 30^4 + 96^4, versus 96^23 for the random password. And that is assuming that any character can be repeated 1~30 times, so DDDDDDDDD0000000ggggggg...... also would be cracked extremely quickly. If you limit yourself to only last character padding, your password now becomes 30*96^4 possibilities. {{unsigned ip|108.162.222.235}}

And that's why it is stupid to explain this kind of joke : it depends on many (MANY) parameters such as brute-force method and encryption/hash algorithm. Giving this kind of (wrong) explanations about "pass cracking" (as if it was always the same way to process ...) is ridiculous. And they talk about entropy .......... Holy shit, go back to school and stop screwing cryptography up. zM_

I just use a password with a ␡ character or two, and ␇ for banks. [[Special:Contributions/108.162.242.21|108.162.242.21]] 08:33, 18 August 2015 (UTC)

I'am astonished that even someone like Schneier don't get 936 right immediately after reading it. So, I think I know what was going on in Munroes mind conceptually. Maybe there are some grans of salt, but I don't have a problem with these. But I do have one (or two) quantitative problem(s) with 936:
* I was not able to find out, how Munroe get the value of about 16 bits of entropy for the "uncommon" nine letter lower case "non-gibberish base word". This would mean: On average, a letter of such a word will have about 1.8 bits of entropy. May be, but how do we know? "Citation needed!" ;-)
* (Secondly: The "punctuation" should have 5, not 4 bits of entropy. There are 32 (2^5) ASCII punctuation characters (POSIX class [:punct:]). But I assume this is a lapse.)
Can someone enlighten me? --[[Special:Contributions/162.158.91.236|162.158.91.236]] 17:31, 19 September 2015 (UTC)
:I have missed the sentence "Randall assumes only the 16 most common characters are used in practice (4 bits)". Hm. There is a huge list with real world passwords out there, leaking from RockYou in 2009. After some processing to remove passwords containing characters that are not printable ASCII characters (ñ, £, ๅ, NBSP, EOT, ...), the list contains about 14329849 unique passwords from about 32585010 accounts (there are some garbage "passwords" like HTML code fragments). The following are the number of accounts using a password containing a particular printable character (one or more tokens of a particular type):
<nowiki>
226673 .
186883 _
179264 !
125846 -
104224 @
95237 *
92802 (space)
60002 #
36522 /
31172 $
28550 &
27686 ,
23905 +
18704 =
18268 )
17927 ?
16401 (
16074 '
14407 ;
11819 <
11118 %
10723 ]
8975 \
7718 [
7209 :
5815 ~
5673 ^
4995 `
2847 "
2741 >
1050 {
939 }
502 |

(NB: 1222815 accounts were using a password containing at least one of these.)
</nowiki>
:Sorry, I have no "citation". But you can play with the leaked RockYou password list yourself. Here is a way to reach that playground:
<nowiki>
$ # Download the compressed list (57 MiB; I have no idea what "skullsecurity"
$ # is, it was simply the first find and I assume it's the said list):
$ wget http://downloads.skullsecurity.org/passwords/rockyou-withcount.txt.bz2

$ # Decompress the list (243 MiB), or, to speak more exact, it's a table:
$ bzip2 -dk rockyou-withcount.txt.bz2

$ # The content of the table is: "How many accounts (first row) were using that
$ # password (second row)?" Let's take a peek:
$ head -n5 rockyou-withcount.txt
290729 123456
79076 12345
76789 123456789
59462 password
49952 iloveyou

$ # The following command processes the table to remove lines with passwords
$ # containing characters that are not printable ASCII characters (14541
$ # lines/passwords, 18038 accounts), and lines insisting that there were some
$ # accounts with no password (1 line, 340 accounts). Moreover, the command
$ # removes every space character not belonging to a password, makes the rows
$ # tab-delimited and writes the result in a file called "ry" (161 MiB; many
$ # bloating spaces removed).
$ LC_ALL=C sed -n 's/^ *$[1-9][0-9]*$ $[[:print:]]\{1,\}$$/\1\t\2/p' rockyou-withcount.txt >ry

$ # The following are shell functions to build commands. They will be explained
$ # below using examples (I can not express myself well in this language).
$ counta() { LC_ALL=C awk 'BEGIN { FS = "\t"; p = 0; a = 0 } { if ($2 ~ /'"$(printf %s "$1" | sed 'sI/I\\/Ig')"'/) { p++; a += $1 } } END { print a " (" p ")" }' "$2" ;}
$ countap() { LC_ALL=C awk 'BEGIN { FS = "\t"; p = 0; a = 0 } { if ($2 ~ /'"$(printf %s "$1" | sed 'sI/I\\/Ig')"'/) { p++; a += $1; print $0 } } END { print a " (" p ")" }' "$2" ;}

$ # We have reached the playground. Here are some examples for how to use the
$ # toys:

$ # Count how many accounts were using a password containing the string love:
$ counta 'love' ry
671599 (188855)

$ # The first operand of the above command is a extended regular expression
$ # (ERE). The second operand is a file, namely the previously generated file
$ # called "ry", that is the (processed) table. The first number of the output
$ # means: "That many accounts were using a password matching the ERE." The
$ # second number inside parentheses means: "That many unique passwords matching
$ # the ERE." If the first number is greater than the second number, some
$ # accounts sharing the same password (we will see this clearly in one of the
$ # examples below).

$ # Count how many accounts were using a password containing at least one
$ # character:
$ counta '.' ry
32585010 (14329849)

$ # Count how many accounts were using a password containing exactly one
$ # character:
$ counta '^.$' ry
144 (45)

$ # Count how many accounts were using a password containing exactly one numeric
$ # character:
$ counta '^[0-9]$' ry
55 (10)

$ # Let's have a look at the distribution:
$ countap '^[0-9]$' ry
29 1
6 7
6 3
3 9
3 2
2 6
2 5
2 0
1 8
1 4
55 (10)

$ # Obove we see the second command at work. You see what it does and what it
$ # does different. And here we see clearly the meaning of the first number and
$ # the second number inside parentheses.

$ # Count how many accounts were using a password containing at least one
$ # numeric character:
$ counta '[0-9]' ry
17609065 (9761364)

$ # Count how many accounts were using a password ending with a numeric
$ # character:
$ counta '[0-9]$' ry
15728238 (8313698)

$ # Count how many accounts were using a password beginning with a numeric
$ # character:
$ counta '^[0-9]' ry
6409397 (3283946)

$ # Count how many accounts were using a password containing only numeric
$ # characters:
$ counta '^[0-9]+$' ry
5192990 (2346744)

$ # And, last but not least, count how many accounts were using a password
$ # containing that "uncommon non-gibberish base word" in 936, with an upper
$ # or an lower case first letter, with or without some of the "common
$ # substitutions":
$ counta '[tT]r[o0]ub[a4]d[o0]r' ry
3 (3)

$ # Yes, there are some. 14 million unique passwords are a lot. Let's see what
$ # exactly was used:
$ countap '[tT]r[o0]ub[a4]d[o0]r' ry
1 troubador1
1 troubador
1 darktroubador
3 (3)
</nowiki>
:[[Special:Contributions/162.158.91.236|162.158.91.236]] 06:23, 21 September 2015 (UTC)

Interesting read about the generated password streangth: https://www.schneier.com/blog/archives/2016/01/friday_squid_bl_508.html#c6714590 [[Special:Contributions/162.158.91.190|162.158.91.190]] 08:09, 8 January 2016 (UTC)

: That person sounds confused. [[Special:Contributions/198.41.235.107|198.41.235.107]] 23:43, 10 January 2016 (UTC)

== You've Already Memorized It ==

Originally I logged in to report a local xkcd related phenomenon, and ask if anyone else had experienced it. The destiny, seemingly inescapable, that at once became my own upon seeing that last panel; the effect of the self-fullfilling combination of the very specific look of inquiry -- one I recognize immediately and associate with the words ''"interesting, Captain"'' -- and the insidiously performative ''"You've already memorized it."'' At first I doubted this was actually the case, but soon I could no longer, since not only did the phrase readily come to the mind and out the mouth, it also came up often. The ''"correct"'' soon replaced the word ''"right"'' in everyday conversation, then ''"right you are"'' and ''"yes"'' and so forth, then its opposite (with a ''"no"'' in front), then replacing the direction, the verb involving pen and paper (the most recent development was merely a quick under the breath aside of an acronym of the remaining words). All followed by the rest of the absurdly perfect password. '''Now here's the kicker: I logged on to tell you all this for some reason, only to find, I had memorized ''"correct horse staple battery"'' instead of ''"correct horse battery staple."'''''[[User:A female faust|A female faust]] ([[User talk:A female faust|talk]]) 03:58, 31 July 2016 (UTC)

Talk:1692: Man Page

2016-06-13T07:06:08Z

A female faust: removed evidence of my (now resolved) incomplete comprehension

I do not entirely understand how wikis work; however, I have attempted to add a transcript. I apologize if anything breaks. I also apologize if this is not how I should be apologizing.

[[Special:Contributions/108.162.241.135|108.162.241.135]] 04:27, 10 June 2016 (UTC)

The Pope flag is referencing the time of the [https://en.wikipedia.org/wiki/Avignon_Papacy Avignon Papacy] --[[Special:Contributions/108.162.237.243|108.162.237.243]] 04:56, 10 June 2016 (UTC)

:Would have frickin' loved Randall if he inserted a reference to Pope of Dope here. :D [[User:Todor|Todor]] ([[User talk:Todor|talk]]) 08:17, 10 June 2016 (UTC)

OK, -e -h -v doesn't seem to work, it keeps halting at an input line!

Also, -p "AVIGNON" only works if I specify -D -I, -O, or -jk.

Why isn't -x documented on this man page? -x seems to do ''something'' but I'm not sure what the value of it is.

-y just returns "CHROMOSOME MISMATCH".

-a -e -f -n -o -r -S works if I specify -g, but -R starts to return CloudFlare errors after the first few million sites.

-v -d seems to make debug.exe speak out loud, but eventually it just starts spouting seemingly random numbers, unless I use -q. Is this desired behavior, or a bug?

{{unsigned ip|255.255.255.0}}
(-jk | off) [[Special:Contributions/108.162.221.8|108.162.221.8]] 20:19, 10 June 2016 (UTC)

The horrible thing about this comic is that somebody is sure to have implemented this program by the end of the day... {{unsigned ip|141.101.104.140}}

:Found one on Github: https://github.com/iKevinY/blerp . It has a man page file, but the program itself just outputs "bleep blerp" and doesn't implement any of the flags (yet?). [[Special:Contributions/141.101.104.141|141.101.104.141]] 08:05, 10 June 2016 (UTC)

"Behavior Not Defined" might be a reference to undefined behavior, where a program is allowed to do anything including make demons fly out your nose: https://en.wikipedia.org/wiki/Undefined_behavior [[Special:Contributions/108.162.219.12|108.162.219.12]] 06:48, 10 June 2016 (UTC)

[[Special:Contributions/162.158.135.36|162.158.135.36]] 06:58, 10 June 2016 (UTC) Søren Mors

I thought Ansel was a deliberate misspelling of ANSI, the most common 8 bit codepage. {{unsigned ip|162.158.135.36}}

The commit "Revision as of 07:08, 10 June 2016" reverted an IMO good explanation for the debug option with a bad one. Consider changing it back. [[User:Todor|Todor]] ([[User talk:Todor|talk]]) 07:20, 10 June 2016 (UTC)
:I agree. The bad explanation also mixed up {{w|Pipeline (Unix)|piping}} with {{w|Redirection (computing)|redirection}} --[[Special:Contributions/141.101.104.76|141.101.104.76]] 07:41, 10 June 2016 (UTC)

I don't think `blerp -a -d -t -p "AVIGNON"` is a valid call to blerp, because the syntax line syntax is utterly off. For example, the first line has an unclosed open [, whereas the second line – in addition to having the corresponding unmatched ] – plays with the fact that even though {} is usually used to list a set of required items, {} is also how `find` (which might do something similar to blerp, and is in fact mentioned in -v) denotes its results when passed to an exec. {{unsigned ip|141.101.104.30}}

Command line options do not normally use n-dashes; they use hyphens. Another problem with this option is that n-dashes and m-dashes cannot usually be displayed properly in the fixed-width fonts commonly used for command line terminals. The usual custom is to use two hyphens to represent a dash (which for proportional font display will often be converted to either an n-dash or m-dash).
: In groff (GNU troff, the language in which man pages are written) the code for an m-dash is '''\(em'''. It will display as either two hyphens "'''--'''" or as an actual m-dash "'''—'''" depending on the character set specified in the locale environment variables. [[User:Locoluis|Locoluis]] ([[User talk:Locoluis|talk]]) 17:17, 10 June 2016 (UTC)
: Many commands use a double dash "--" to specify the end of the options. In "ls -a" the "-a" is an option. In "ls -- -a" the "-a" is the name of the file.--[[Special:Contributions/108.162.218.59|108.162.218.59]] 16:00, 11 June 2016 (UTC)

While "check whether input halts" clearly alludes to the halting problem, it may not actually be impossible, depending on what blerp actually does and what sort of input it accepts. (It says nothing about actually ''reporting'' the result, and it makes no guarantees that it will itself halt.)

—[[User:PhantomLimbic|PhantomLimbic]] ([[User talk:PhantomLimbic|talk]]) 07:30, 10 June 2016 (UTC)

:Indeed. Turing's proof for the halting theorem says that there is no algorithm that allows a Turing machine to determine whether any possible program/input combination will halt. However, this doesn't necessarily mean that it's impossible to develop an algorithm that determines whether a particular, fixed program will halt on an arbitrary input. [[Special:Contributions/141.101.104.141|141.101.104.141]] 08:14, 10 June 2016 (UTC)

Currently, there is no mention of the unmatched square brackets in the synopsis, or unmatched parenthesis in the title text. Presumably a reference to XKCD comic 859. [[Special:Contributions/141.101.98.77|141.101.98.77]] 07:51, 10 June 2016 (UTC)

Attack Mode might be a reference to the [https://en.wikipedia.org/wiki/Yu-Gi-Oh!_Trading_Card_Game Yu-Gi-Oh Trading Card Game] [[Special:Contributions/162.158.85.117|162.158.85.117]] 08:23, 10 June 2016 (UTC)

In the description of -b the computer (Named "Hex") from discworld uses ants not bees.
Ref: https://en.wikipedia.org/wiki/Hex_(Discworld) [[Special:Contributions/141.101.98.125|141.101.98.125]] 09:13, 10 June 2016 (UTC)Bluewhelk
:Hmm. Reading the wiki article further Hex uses a beehive for long term storage! My bad [[Special:Contributions/141.101.98.125|141.101.98.125]] 09:20, 10 June 2016 (UTC)Bluewhelk

"Or best offer" doesn't need to reference a financial offer, it may also mean that anyone offering to reuse the article with an alternative license is allowed to do so. Attack Mode and Stealth Mode seem to me to be references to computer viruses. Stealth Mode is also an option in some applications that can hide their presence when run, often because of malicious behavior, such as remote access tools, keyloggers, etc. Piping is not only used in Unix, it is also common in MS-DOS. Opposite Day has a good explanation on Wikipedia. Literal quote from Wikipedia: "Once Opposite Day is declared, statements mean the opposite of what they usually mean.". --[[Special:Contributions/162.158.222.217|162.158.222.217]] 11:17, 10 June 2016 (UTC)

Is there any evidence that Opposite Day may refer to Cyanide & Happiness? Opposite Day is a fairly well-known concept (at least from what I know growing up in the U.S.), and I don't see any direct connections to the specific C&H video short. I think that speculation should be removed. [[User:Sayno2quat|Sayno2quat]] ([[User talk:Sayno2quat|talk]]) 14:33, 10 June 2016 (UTC)

I could be wrong, but I think the program is also "simulating" a man (a play with the words because it's a '''man''' page). If you think like that a lot more commands makes sense (especially, -D, -e, -f, -g, -jk, -R, -u). Just a penny for a thought. --[[Special:Contributions/108.162.241.134|108.162.241.134]] 11:52, 10 June 2016 (UTC)

If someone wants a history of the useragent string (possibly a reference for that "citation needed"), then [http://webaim.org/blog/user-agent-string-history/|this might be of interest]. --[[User:Draco18s|Draco18s]] ([[User talk:Draco18s|talk]]) 16:12, 10 June 2016 (UTC)

The <code>-n</code> option might be a reference to <code>echo</code>, where it is an option often used but which does not work on all systems. 
Am I the only one to see the “k” capitalized in <code>-jK</code>? 
[[User:Ltrlg|Ltrlg]] ([[User talk:Ltrlg|talk]]) 18:55, 10 June 2016 (UTC)

I interpreted "CHECK WHETHER INPUT HALTS" as simply determining whether the input was a finite string. (while at the same time referencing the halting problem) --[[Special:Contributions/162.158.68.59|162.158.68.59]] 20:22, 10 June 2016 (UTC)

I think that "suppress bees" probably indicates a smoke situation, a situation where the magic smoke is let out of the computer, such as halt-catch-fire. Smoke is the way to suppress bees. [[Special:Contributions/108.162.249.158|108.162.249.158]] 20:24, 10 June 2016 (UTC)

What does "BSD 4(2)" mean? --[[Special:Contributions/162.158.255.65|162.158.255.65]] 20:54, 10 June 2016 (UTC)

blerp -v | blerp -ha [[User:Mikemk|Mikemk]] ([[User talk:Mikemk|talk]]) 21:28, 10 June 2016 (UTC)

The word "bug" doesn't actually come from an insect; see the Etymology section of https://en.wikipedia.org/wiki/Software_bug [[Special:Contributions/108.162.245.117|108.162.245.117]] 04:37, 11 June 2016 (UTC)

Some remarks to the current explanation:
- I think the description is more specific than suggested. It is true that command-line programs regularly read stdin and output something to stdout, but I would categorize only some of them grep/sed/awk/sort/... as filter in the narrower sense. Also that it can access remote files (URL syntax) is a clue
- In the syntax we have args, option, options, and flags
- the environment variables are never described
- attack mode could refer to a network attack, e.g. trying to break into protected servers, or not just filtering the information, but also using it in a damaging way
- suppress bees hints that for normal operation bees are used, something you would not expect from a typical command line program
- the em dashes are probably used from there on on the command line (right of this option)
- piping output to the MS-DOS debug.exe can be used for entering small assembly programs (including saving them typically as .com command), changing memory contents or accessing I/O ports. Normally it is used interactively. In a pipe setup it enhances the abilities of a text processing filter to do some enhanced actions on the target computer
- execute something, similar to the find program which can execute an external program per match; could also mean a specified algorithm and refer to halting check; in any case "something" is quite vague for a man page
- use google: either for input (e.g. read URLs by searching for ARG and getting the first found webpage) or some special Google API; possibly Google is so powerful, it can replace some of the functionality of the program. Just use Google
- Check whether input halts hints that the input processing including algorithm execution is so complex that it can run into an infinite loop, but easy enough to be not yet Turing complete or it is and -h is the joke; or some input never halts, e.g. /dev/random, or it refers to the robot theory, e.g. whether the attacked victim halts
- ignore case probably refers to the actual input files instead of to the command line
- overwrite would be funny with speech output
- the true pope is seemingly important fir filtering. Could refer to important faith settings for other programs, e.g. which editor to use vim/emacs or it us important for knowledge processing
- randomize arguments is good for some test procedures
- as mentioned in the explanation the copyright refers to the man page, not the program, here the explanation is inconsistent in the current revision
Sebastian --[[Special:Contributions/162.158.83.168|162.158.83.168]] 08:55, 11 June 2016 (UTC)

With reference to the See Also, the multiple blerps are due to different sections, see https://en.wikipedia.org/wiki/Man_page#Manual_sections [[Special:Contributions/173.245.54.34|173.245.54.34]] 13:08, 11 June 2016 (UTC)

Could "supress bees" reference to "[http://www.explainxkcd.com/wiki/index.php/797:_debian-main debian-main]"? [[Special:Contributions/162.158.86.131|162.158.86.131]] 19:20, 11 June 2016 (UTC)

Does the unclosed paren in the title text bother anyone else? [[Special:Contributions/173.245.50.25|173.245.50.25]] 06:02, 12 June 2016 (UTC)
:Not me, but someone somewhere... - [[Special:Contributions/108.162.244.85|108.162.244.85]] 08:41, 12 June 2016 (UTC)

Is the newspaper on this What-If [http://what-if.xkcd.com/61/] relevant? - [[Special:Contributions/108.162.244.85|108.162.244.85]] 08:41, 12 June 2016 (UTC)

I've never put anything on this site, but I feel it's worth mentioning that lerp (which stands for linear interpolation) is a thing and it sounds like blerp. [[Special:Contributions/108.162.245.119|108.162.245.119]] 02:31, 13 June 2016 (UTC)

1. The NAME section is missing the one-line description that is necessary for the whatis and apropos commands.
2. "Set version number" could be used to set the version number in the output files or provide compatibility output.
[[Special:Contributions/108.162.216.98|108.162.216.98]] 02:38, 13 June 2016 (UTC)

Talk:1692: Man Page

2016-06-13T04:10:01Z

A female faust: suppress bs

I do not entirely understand how wikis work; however, I have attempted to add a transcript. I apologize if anything breaks. I also apologize if this is not how I should be apologizing.

[[Special:Contributions/108.162.241.135|108.162.241.135]] 04:27, 10 June 2016 (UTC)

The Pope flag is referencing the time of the [https://en.wikipedia.org/wiki/Avignon_Papacy Avignon Papacy] --[[Special:Contributions/108.162.237.243|108.162.237.243]] 04:56, 10 June 2016 (UTC)

:Would have frickin' loved Randall if he inserted a reference to Pope of Dope here. :D [[User:Todor|Todor]] ([[User talk:Todor|talk]]) 08:17, 10 June 2016 (UTC)

OK, -e -h -v doesn't seem to work, it keeps halting at an input line!

Also, -p "AVIGNON" only works if I specify -D -I, -O, or -jk.

Why isn't -x documented on this man page? -x seems to do ''something'' but I'm not sure what the value of it is.

-y just returns "CHROMOSOME MISMATCH".

-a -e -f -n -o -r -S works if I specify -g, but -R starts to return CloudFlare errors after the first few million sites.

-v -d seems to make debug.exe speak out loud, but eventually it just starts spouting seemingly random numbers, unless I use -q. Is this desired behavior, or a bug?

{{unsigned ip|255.255.255.0}}
(-jk | off) [[Special:Contributions/108.162.221.8|108.162.221.8]] 20:19, 10 June 2016 (UTC)

The horrible thing about this comic is that somebody is sure to have implemented this program by the end of the day... {{unsigned ip|141.101.104.140}}

:Found one on Github: https://github.com/iKevinY/blerp . It has a man page file, but the program itself just outputs "bleep blerp" and doesn't implement any of the flags (yet?). [[Special:Contributions/141.101.104.141|141.101.104.141]] 08:05, 10 June 2016 (UTC)

"Behavior Not Defined" might be a reference to undefined behavior, where a program is allowed to do anything including make demons fly out your nose: https://en.wikipedia.org/wiki/Undefined_behavior [[Special:Contributions/108.162.219.12|108.162.219.12]] 06:48, 10 June 2016 (UTC)

[[Special:Contributions/162.158.135.36|162.158.135.36]] 06:58, 10 June 2016 (UTC) Søren Mors

I thought Ansel was a deliberate misspelling of ANSI, the most common 8 bit codepage. {{unsigned ip|162.158.135.36}}

The commit "Revision as of 07:08, 10 June 2016" reverted an IMO good explanation for the debug option with a bad one. Consider changing it back. [[User:Todor|Todor]] ([[User talk:Todor|talk]]) 07:20, 10 June 2016 (UTC)
:I agree. The bad explanation also mixed up {{w|Pipeline (Unix)|piping}} with {{w|Redirection (computing)|redirection}} --[[Special:Contributions/141.101.104.76|141.101.104.76]] 07:41, 10 June 2016 (UTC)

I don't think `blerp -a -d -t -p "AVIGNON"` is a valid call to blerp, because the syntax line syntax is utterly off. For example, the first line has an unclosed open [, whereas the second line – in addition to having the corresponding unmatched ] – plays with the fact that even though {} is usually used to list a set of required items, {} is also how `find` (which might do something similar to blerp, and is in fact mentioned in -v) denotes its results when passed to an exec. {{unsigned ip|141.101.104.30}}

Command line options do not normally use n-dashes; they use hyphens. Another problem with this option is that n-dashes and m-dashes cannot usually be displayed properly in the fixed-width fonts commonly used for command line terminals. The usual custom is to use two hyphens to represent a dash (which for proportional font display will often be converted to either an n-dash or m-dash).
: In groff (GNU troff, the language in which man pages are written) the code for an m-dash is '''\(em'''. It will display as either two hyphens "'''--'''" or as an actual m-dash "'''—'''" depending on the character set specified in the locale environment variables. [[User:Locoluis|Locoluis]] ([[User talk:Locoluis|talk]]) 17:17, 10 June 2016 (UTC)
: Many commands use a double dash "--" to specify the end of the options. In "ls -a" the "-a" is an option. In "ls -- -a" the "-a" is the name of the file.--[[Special:Contributions/108.162.218.59|108.162.218.59]] 16:00, 11 June 2016 (UTC)

While "check whether input halts" clearly alludes to the halting problem, it may not actually be impossible, depending on what blerp actually does and what sort of input it accepts. (It says nothing about actually ''reporting'' the result, and it makes no guarantees that it will itself halt.)

—[[User:PhantomLimbic|PhantomLimbic]] ([[User talk:PhantomLimbic|talk]]) 07:30, 10 June 2016 (UTC)

:Indeed. Turing's proof for the halting theorem says that there is no algorithm that allows a Turing machine to determine whether any possible program/input combination will halt. However, this doesn't necessarily mean that it's impossible to develop an algorithm that determines whether a particular, fixed program will halt on an arbitrary input. [[Special:Contributions/141.101.104.141|141.101.104.141]] 08:14, 10 June 2016 (UTC)

Currently, there is no mention of the unmatched square brackets in the synopsis, or unmatched parenthesis in the title text. Presumably a reference to XKCD comic 859. [[Special:Contributions/141.101.98.77|141.101.98.77]] 07:51, 10 June 2016 (UTC)

Attack Mode might be a reference to the [https://en.wikipedia.org/wiki/Yu-Gi-Oh!_Trading_Card_Game Yu-Gi-Oh Trading Card Game] [[Special:Contributions/162.158.85.117|162.158.85.117]] 08:23, 10 June 2016 (UTC)

In the description of -b the computer (Named "Hex") from discworld uses ants not bees.
Ref: https://en.wikipedia.org/wiki/Hex_(Discworld) [[Special:Contributions/141.101.98.125|141.101.98.125]] 09:13, 10 June 2016 (UTC)Bluewhelk
:Hmm. Reading the wiki article further Hex uses a beehive for long term storage! My bad [[Special:Contributions/141.101.98.125|141.101.98.125]] 09:20, 10 June 2016 (UTC)Bluewhelk

"Or best offer" doesn't need to reference a financial offer, it may also mean that anyone offering to reuse the article with an alternative license is allowed to do so. Attack Mode and Stealth Mode seem to me to be references to computer viruses. Stealth Mode is also an option in some applications that can hide their presence when run, often because of malicious behavior, such as remote access tools, keyloggers, etc. Piping is not only used in Unix, it is also common in MS-DOS. Opposite Day has a good explanation on Wikipedia. Literal quote from Wikipedia: "Once Opposite Day is declared, statements mean the opposite of what they usually mean.". --[[Special:Contributions/162.158.222.217|162.158.222.217]] 11:17, 10 June 2016 (UTC)

Is there any evidence that Opposite Day may refer to Cyanide & Happiness? Opposite Day is a fairly well-known concept (at least from what I know growing up in the U.S.), and I don't see any direct connections to the specific C&H video short. I think that speculation should be removed. [[User:Sayno2quat|Sayno2quat]] ([[User talk:Sayno2quat|talk]]) 14:33, 10 June 2016 (UTC)

I could be wrong, but I think the program is also "simulating" a man (a play with the words because it's a '''man''' page). If you think like that a lot more commands makes sense (especially, -D, -e, -f, -g, -jk, -R, -u). Just a penny for a thought. --[[Special:Contributions/108.162.241.134|108.162.241.134]] 11:52, 10 June 2016 (UTC)

If someone wants a history of the useragent string (possibly a reference for that "citation needed"), then [http://webaim.org/blog/user-agent-string-history/|this might be of interest]. --[[User:Draco18s|Draco18s]] ([[User talk:Draco18s|talk]]) 16:12, 10 June 2016 (UTC)

The <code>-n</code> option might be a reference to <code>echo</code>, where it is an option often used but which does not work on all systems. 
Am I the only one to see the “k” capitalized in <code>-jK</code>? 
[[User:Ltrlg|Ltrlg]] ([[User talk:Ltrlg|talk]]) 18:55, 10 June 2016 (UTC)

I interpreted "CHECK WHETHER INPUT HALTS" as simply determining whether the input was a finite string. (while at the same time referencing the halting problem) --[[Special:Contributions/162.158.68.59|162.158.68.59]] 20:22, 10 June 2016 (UTC)

I think that "suppress bees" probably indicates a smoke situation, a situation where the magic smoke is let out of the computer, such as halt-catch-fire. Smoke is the way to suppress bees. [[Special:Contributions/108.162.249.158|108.162.249.158]] 20:24, 10 June 2016 (UTC)

What does "BSD 4(2)" mean? --[[Special:Contributions/162.158.255.65|162.158.255.65]] 20:54, 10 June 2016 (UTC)

blerp -v | blerp -ha [[User:Mikemk|Mikemk]] ([[User talk:Mikemk|talk]]) 21:28, 10 June 2016 (UTC)

The word "bug" doesn't actually come from an insect; see the Etymology section of https://en.wikipedia.org/wiki/Software_bug [[Special:Contributions/108.162.245.117|108.162.245.117]] 04:37, 11 June 2016 (UTC)

"Suppress bees" may simply exclude (using the dash as a minus operand) multiple instances of the letter 'b', no?[[User:A female faust|A female faust]] ([[User talk:A female faust|talk]]) 04:10, 13 June 2016 (UTC)

Some remarks to the current explanation:
- I think the description is more specific than suggested. It is true that command-line programs regularly read stdin and output something to stdout, but I would categorize only some of them grep/sed/awk/sort/... as filter in the narrower sense. Also that it can access remote files (URL syntax) is a clue
- In the syntax we have args, option, options, and flags
- the environment variables are never described
- attack mode could refer to a network attack, e.g. trying to break into protected servers, or not just filtering the information, but also using it in a damaging way
- suppress bees hints that for normal operation bees are used, something you would not expect from a typical command line program
- the em dashes are probably used from there on on the command line (right of this option)
- piping output to the MS-DOS debug.exe can be used for entering small assembly programs (including saving them typically as .com command), changing memory contents or accessing I/O ports. Normally it is used interactively. In a pipe setup it enhances the abilities of a text processing filter to do some enhanced actions on the target computer
- execute something, similar to the find program which can execute an external program per match; could also mean a specified algorithm and refer to halting check; in any case "something" is quite vague for a man page
- use google: either for input (e.g. read URLs by searching for ARG and getting the first found webpage) or some special Google API; possibly Google is so powerful, it can replace some of the functionality of the program. Just use Google
- Check whether input halts hints that the input processing including algorithm execution is so complex that it can run into an infinite loop, but easy enough to be not yet Turing complete or it is and -h is the joke; or some input never halts, e.g. /dev/random, or it refers to the robot theory, e.g. whether the attacked victim halts
- ignore case probably refers to the actual input files instead of to the command line
- overwrite would be funny with speech output
- the true pope is seemingly important fir filtering. Could refer to important faith settings for other programs, e.g. which editor to use vim/emacs or it us important for knowledge processing
- randomize arguments is good for some test procedures
- as mentioned in the explanation the copyright refers to the man page, not the program, here the explanation is inconsistent in the current revision
Sebastian --[[Special:Contributions/162.158.83.168|162.158.83.168]] 08:55, 11 June 2016 (UTC)

With reference to the See Also, the multiple blerps are due to different sections, see https://en.wikipedia.org/wiki/Man_page#Manual_sections [[Special:Contributions/173.245.54.34|173.245.54.34]] 13:08, 11 June 2016 (UTC)

Could "supress bees" reference to "[http://www.explainxkcd.com/wiki/index.php/797:_debian-main debian-main]"? [[Special:Contributions/162.158.86.131|162.158.86.131]] 19:20, 11 June 2016 (UTC)

Does the unclosed paren in the title text bother anyone else? [[Special:Contributions/173.245.50.25|173.245.50.25]] 06:02, 12 June 2016 (UTC)
:Not me, but someone somewhere... - [[Special:Contributions/108.162.244.85|108.162.244.85]] 08:41, 12 June 2016 (UTC)

Is the newspaper on this What-If [http://what-if.xkcd.com/61/] relevant? - [[Special:Contributions/108.162.244.85|108.162.244.85]] 08:41, 12 June 2016 (UTC)

I've never put anything on this site, but I feel it's worth mentioning that lerp (which stands for linear interpolation) is a thing and it sounds like blerp. [[Special:Contributions/108.162.245.119|108.162.245.119]] 02:31, 13 June 2016 (UTC)

1. The NAME section is missing the one-line description that is necessary for the whatis and apropos commands.
2. "Set version number" could be used to set the version number in the output files or provide compatibility output.
[[Special:Contributions/108.162.216.98|108.162.216.98]] 02:38, 13 June 2016 (UTC)

Talk:918: Google+

2016-06-13T03:37:27Z

A female faust: "who's not going to be on facebook?"

I really don't mind Facebook. It's not like they look at my data specifically, they're just using my data in an aggregate to better target adverts at me, and I don't have any issue with receiving ads that I actually care about. '''[[User:Davidy22|{{Color|#707|David}}y²²]]'''[[User talk:Davidy22|<tt>[talk]</tt>]] 01:23, 17 April 2013 (UTC)
:Is that you, Mark?? [[Special:Contributions/108.162.219.223|108.162.219.223]] 06:49, 21 January 2014 (UTC)
::99.99999% of facebook's problems are PR. They take the "you're holding it wrong" approach, and this is what creates a spiral. Sorry, if you're online, it's public. If facebook simply said that it had to do this for the features to work, allowed people the ability to disable any feature, and geared features so that they aren't co-dependent (or if they are dependent, the setting cascades) then they'd be fine. The, it's our way or the highway approach is effective because, who's not going to use facebook, but it's derogatory and creates demagoguery and unnecessary panic. This is bad for the public, and for no reason at all. [[User:Cflare|Cflare]] ([[User talk:Cflare|talk]]) 16:16, 19 August 2014 (UTC)
-----I just wanted to note that I am not now, nor have I ever been, on Facebook. Although i have of course viewed pages, I do not have one myself, and only use the site when absolutely unavoidable. Nor do i use Google+ (although the more they support anonymity the more likely it is i will at least entertain the notion). For the most part I agree with Cflare, but take exception to 'who's not going to use Facebook' and the assumptions behind it: in fact it was the desire to provide details about this disagreement, to leave a comment here, that prompted me to register with this wiki (ironic though that may seem). Something about Facebook always feels overwhelmingly destructive to the human spirit, at least to me: as if just getting used to ignoring what you will be needing to ignore to make the service usable would have an irreversible deleterious effect on creativity.-------[[User:A female faust|A female faust]] ([[User talk:A female faust|talk]]) 03:37, 13 June 2016 (UTC)