Unlike any other site, Area 51's main site is unencrypted, its login forms are partially or wholly insecure and its login forms completely break under the browser extension HTTPS Everywhere. That doesn't happen on any other sites. This is madness Sparta.  Mere months ago Mark Henderson : Let's encrypt all the things. But:   When I use the HTTPSEverywhere extension on Firefox 50.0.2, the login form appears secure until you try to log in, at which point it barfs  Unable to log in with your OpenID provider: &lt;Big Wall of Red Text&gt;   and I can't login. And when I disable the extension I get either an unsecured or only partially secured form, leaving it unclear to me if my PW is being sent in clear text over the intertubes.  Then when I'm logged in the site isn't secure at all.   In case that matters I'm running Linux and it's fully up-to-date with security patches.  Can Area 51 get area defenses (cryptography) actually worthy of the name?
I recentely tried to log-in / sign-up for  using my SE account (which works on ,  and sign-up here) but it showed me an OpenID related error. (See below)  I could reproduce this error across multiple days and browser refreshes and using my other OpenID provider.  Error message (shown in red, obfuscated my e-mail address):  Unable to log in with your OpenID provider:  The openid.return_to parameter (http://area51.stackexchange.com/users/authenticate/?s=bd394805-cf55-4e8e-ad73-21485a09a989&amp;dnoa.userSuppliedIdentifier=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1) does not match the actual URL (https://area51.stackexchange.com/users/authenticate/?s=bd394805-cf55-4e8e-ad73-21485a09a989&amp;dnoa.userSuppliedIdentifier=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1&amp;openid.claimed_id=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1&amp;openid.identity=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F642b1038-5c91-40d4-83ab-eb92db46c3d1&amp;openid.sig=4emyzuA31ChHU0LabPGJXldbN8GeKN%2FFBJXJy69yD10%3D&amp;openid.signed=claimed_id%2Cidentity%2Cassoc_handle%2Cop_endpoint%2Creturn_to%2Cresponse_nonce%2Cns.alias3%2Calias3.mode%2Calias3.type.alias1%2Calias3.value.alias1%2Calias3.type.alias2%2Calias3.value.alias2&amp;openid.assoc_handle=hrQL%21IAAAAGzBtFeNGBLU2o04XSWr7ISRAbO-B2tZCK3L61IzAsuQQQAAAAEdoTN6rf9fqaP1oekJGXGXJeB8fNSVuByptp5yx1VpQbAzQwF6HJzh6a0DwedydNJ-wwpJQoN5dOLEFmndZt-L&amp;openid.op_endpoint=https%3A%2F%2Fopenid.stackexchange.com%2Fopenid%2Fprovider&amp;openid.return_to=http%3A%2F%2Farea51.stackexchange.com%2Fusers%2Fauthenticate%2F%3Fs%3Dbd394805-cf55-4e8e-ad73-21485a09a989%26dnoa.userSuppliedIdentifier%3Dhttps%253A%252F%252Fopenid.stackexchange.com%252Fuser%252F642b1038-5c91-40d4-83ab-eb92db46c3d1&amp;openid.response_nonce=2015-06-12T12%3A30%3A42Z7tADDeYZ&amp;openid.mode=id_res&amp;openid.ns=http%3A%2F%2Fspecs.openid.net%2Fauth%2F2.0&amp;openid.ns.alias3=http%3A%2F%2Fopenid.net%2Fsrv%2Fax%2F1.0&amp;openid.alias3.mode=fetch_response&amp;openid.alias3.type.alias1=http%3A%2F%2Faxschema.org%2Fcontact%2Femail&amp;openid.alias3.value.alias1=mycorrectaddress%40web.de&amp;openid.alias3.type.alias2=http%3A%2F%2Faxschema.org%2FnamePerson&amp;openid.alias3.value.alias2=SOJPM) the request was made with.    As noted in the comments I'm not the only one, so I'd guess it may be not something I can fix. So will this be fixed?  Repro steps (using SE OpenID):   Get an Stackexchange OpenID account (like I have) (optional?) Add other OpenID providers and check they're working (StartSSL in my case) Please note: "You" don't have an "account" for the Area 51 subpage yet and still need to do the initial sign-in. Go to the Area 51 SE page Hit "Log-in" in the top-bar Hit the "log-in using stackexchange" button Enter your e-mail and password and submit Get the above error   Repro steps (using other OpenID)   Perform as above (until step 4), but this time step 2 is mandatory Hit "more OpenID options" Provide your OpenID link XXX.provider.com (works on crypto, server fault, ...) Authenticate against your provider Receive a variation of the above error (can be included if needed)
Finding a 2x2 Matrix raised to the power of 1000 Where can I find my .emacs file for Emacs running on Windows? I tried looking for the .emacs file for my Windows installation for Emacs, but I could not find it. Does it have the same filename under Windows as in Unix?  Do I have to create it myself? If so, under what specific directory does it go? Ways of getting a number with $n$ dice, each with $k$ sides Assume the dice are numbered from $1$ to $k$. My hunch is that this will form a normal distribution with a median at $n\cdot\frac{k}{2}$. However, I have no idea as to    turn this fact into an answer (I have a minimal knowledge of stats, but I know that I am missing the standard distribution) and this is probably the wrong approach   How can I approach and solve this problem? (Aside, this is not for a class, stats or other, so any and all approaches welcome).  *Edit: * I want to find the number of ways that the sum of the numbers that are rolled has a particular value, if $n$ dice are rolled, and each has $k$ sides, numbered $1$ to $k$. Java Object Reuse Should Java Objects be reused as often as it can be reused ? Or should we reuse it only when they are "heavyweight", ie have OS resources associated with it ?  All old articles on the internet talk about object reuse and object pooling as much as possible, but I have read recent articles that say new Object() is highly optimized now ( 10 instructions ) and Object reuse is not as big a deal as it used to be.  What is the current best practice and how are you people doing it ? Gravitational waves and time Need fast solution how to show series expansion of function at x=0:  $$f(x)=\frac{3x}{1+x^2+x^4}$$  Please some hints. Finding Value of the Infinite Product $\prod \Bigl(1-\frac{1}{n^{2}}\Bigr)$ While trying some problems along with my friends we had difficulty in this question.   True or False: The value of the infinite product $$\prod\limits_{n=2}^{\infty} \biggl(1-\frac{1}{n^{2}}\biggr)$$ is $1$.   I couldn't do it and my friend justified it by saying that since the terms in the product have values less than $1$, so the value of the product can never be $1$. I don't know whether this justification is correct or not. But i referred to Tom Apostol's Mathematical Analysis book and found a theorem which states, that    The infinite product $\prod(1-a_{n})$ converges if the series $\sum a_{n}$ converges.   This assures that the above product converges. Could anyone help me in finding out where it converges to? And,   Does there exist a function $f$ in $\mathbb{N}$ ( like $n^{2}$, $n^{3}$) such that $\displaystyle \prod\limits_{n=1}^{\infty} \Bigl(1-\frac{1}{f(n)}\Bigr)$ has the value $1$? Why are irrational numbers uncountable and rationals countable? Question 1: Why are irrational numbers uncountable and rationals countable?  I really struggle to understand this. I initially thought it had something to with the fact that between any two numbers there will always be a irrational number. But now it has come to my attention that the same holds for rational numbers. So I can't really see the difference between them. What is it that makes the difference? Why can we line up all rational numbers one-to-one with the natural numbers, but not the irrationals with the naturals?  Sorry for a perhaps basic question, but I really, really struggle with it. Thanks. Why are POSIX Find Parameters Different from Other Program styles? What is a reasonable depth and diameter for postholes dug in clay soil to support an 8' fence? What is a reasonable depth and diameter for postholes dug in clay soil where the frost line is no more than 12” and that will support an 8 foot tall solid wood fence that uses PostMaster metal posts?  I hope to have someone else install an 8 foot high PT wood fence.  There will be no light or air passing through or under the fence and it will be heavier than average, given the additional height and board weight.  One side will run for 135’.  The attached diagram provides more detail.  The PostMaster Installation Instructions describe a 30” deep, sloped, 10” diameter hole, filled with 6” of gravel plus 24” of concrete for a 6 foot high fence.  They caveat that the “exact diameter and depth will be determined by local weather and soil conditions.”  Got it.  Huntsville, AL; very clay soil.  Maximum wind gusts of 65 mph.  (This is not in the normal tornado path and is not intended to withstand a tornado.)  In reviewing the StackExchange posts on fencing and post holes I came across the concept that the diameter of the pier may be increased to compensate for a shallower post hole.  I would like to know the recommended depth and diameter without relying on the 2 buttress posts, which are my small overbuild idea.  We will be able to walk under them.  26 APR 18 update: I just found a Master Halco youtube video specifying 6-8" diameter holes dug 36" deep for an 8' board-on-board fence, such as I would like to have.   - I also spoke to a fence builder experienced using PostMaster posts who opined that the 10" diameter and 30 deep holes were more than adequate, but that the gravel was of no value in our climate.  So, 30" x 10" dia inches of concrete vs. 36" x 8" dia of concrete. tags of mundanity that are gratuitously applied to posts It's an additional unnecessary burden to the honest stacker during suggested edit duty. A question presents some code then the minor editor adds a tag like 'for-loop' or 'forms'.  These tags are so general that they only have a handful of followers. They serve no useful purpose and are the cause of many too minor edits. Why not permit culling of generic tags? Calculating sequential numbers into sorted table using ArcGIS Desktop? Orthogonality and linear independence [Theorem] Let $V$ be an inner product space, and let $S$ be an orthogonal subset of $V$ consisting of nonzero vectors. Then $S$ is linearly independent.     Also, orthogonal set and linearly independent set both generate the same subspace.  (Is that right?)    Then orthogonal $\rightarrow$ linearly independent but orthogonal $\nleftarrow$ linearly independent is that right?    One more question. For T/F, Every orthogonal set is linearly independent (F) Every orthonormal set is linearly independent (T) Why? Can someone explain me this  please I am a bit confused?  It's from a texbook I am reading (block cipher companion)  it says that:      each weak key has  $2^{32}$ fixed points $m$ where $\operatorname{DES}_w(m) = m$ ( $w$ is a DES weak key). In other words encrypting a fixed point gives exactly the same point. To see this consider the $2^{32}$ ciphertexts after 8 rounds of encryption for which the two 32 bit halves are equal. For a weak  DES key, the round keys of the eighth and ninth rounds are equal. Thus the intermediate texts after seven rounds and after nine rounds of encryption will be equal. Since the round keys of the 7th and the 10th rounds are equal, the intermediate texts after 6 rounds and after 10 rounds of encryption will be equal. Continuing like this it follows that the plaintext will be equal to the ciphertext.    Now did not quite get :   Why are there $2^{32}$ fixed points?  And why after the eighth round of encryption the two halves must be equal? What does the author mean by the intermediate texts exactly? And how are they being equal?   P.S.: This question is not asking for what the weak keys are. I am asking for "fixed points" not exactly weak keys. For this reason I think it is not a duplicate of any other question. There is one similar question to what I've asked for which I have checked and saw that no satisfactory answer has been given there either.  Here is the similar question with no proper answers: Large snap packages because of dependencies Is redirecting homepage to a page with keyword it's targeting helps in SEO? How to execute hostapd command in cli? I always got error. When i execute hostapd command. I was changed everything in my hostapd.conf file but i got error.  hostapd_cli wps_pbc Failed to connect to hostapd - wpa_ctrl_open: No such file or directory  Can anyone help to me.? (Built-in) way in JavaScript to check if a string is a valid number I'm hoping there's something in the same conceptual space as the old VB6 IsNumeric() function? Improve the user self-deletion process The current process for self-deletion of a user account has several problematic aspects, both in the process itself and in the end result. Some of these issues are:   The process requires manual intervention of a mod or SE employee, leading to delays and sometimes mistakes. It is more complicated than it has to be, which can lead to the impression that SE is imposing some rather arbitrary-looking restrictions and steps one has to take. This can give the impression that the user isn't really in control of his private data at SE. It is irreversible once the account is deleted, although an account can be partially reconstructed with a lot of manual effort from an SE developer. There is no real protection against mod/SE employee errors, if an account is deleted in error, there is no easy way to undo the damage. Because it is manual, it consumes the time of SE employees that have to deal with it  (unless  is used), removing useful voting information and annoying users that lose reputation that way.   I'm proposing an alternative way of handling self-deletion that would be automated, and also reversible to some extent, while still being pretty much a hard-delete (and not a soft-delete that would be problematic with respect to user privacy). The process would work roughly like this:   The user clicks a "delete profile" button in his profile. There should be a way to indicate if you want to delete all profiles on all SE sites, only on this site and a way to select multiple sites from a list where the profile should be deleted. It is verified that the user has true access to the account in some way (confirmation mail?) and not just someone that found the unlocked computer of the user. A countdown until deletion is started (I'd go with 48h, but that could be different). The timer shouldn't be too long, but long enough to correct mistakes and leave users a bit of time to reconsider. Alternative options would be to enable users to override the countdown if they really want to nuke their account immediately. Another option would be to soft-delete the account immediately, and make the countdown only for hard-deletion of the user data. Upon deletion, the posts of the user and his votes are transferred to a newly created blank account, the original account itself is hard-deleted with all the remaining data it contains. The dummy account that holds the user's data should be flagged in some way as deleted, so that the profile links will be disabled, the profile won't be accessible and it won't appear in any user lists.  The user receives a private code that can be used to claim ownership of the account. Other ways are not possible as all private information is removed about the account. This allows for an automatic way of reclaiming most of the important parts of a deleted account. The ability to restore a deleted account might have to be somewhat restricted to avoid misusing it to get rid of the account history. It is more meant as an additional safeguard so that account reconstruction is more easily possible in rare cases. Such additional safeguards might be necessary as the deletion itself would be automatic and without oversight from SE or moderators.   I personally think that the information which posts and votes were connected to a (now anonymized) account is not sensitive enough that it would have to be removed on account deletion. My idea is that this would be close enough to a hard-delete that it satisfies any privacy concerns, but still allow reassociation of posts with a recovered account. The partial reversibility would alleviate concerns about removing the manual oversight by mods and SE employees over the account deletion process. Integral of the square of the normal distribution. Does someone know what the integral of the square of the normal distribution with standard deviation sigma over the range $-\infty$ to $+\infty$ is?  Thanks!