Proof-of-work challenge

This site is protected by Powxy{{ if .Global.Version }} {{ .Global.Version }}{{ end }}.

You must complete this proof-of-work challenge before you can access this site.

Select a nonce no longer than 32 bytes, such that when it is appended to the decoded form of the challenge identifier, and the entire result is hashed with SHA-256, the first {{ .Global.NeedBits }} bits of the SHA-256 hash are all zeros. Within one octet, higher bits are considered to come before lower bits.

In other words, find an nonce NN with |N|≤32B\lvert N\rvert \le 32\,\mathrm{B}, such that SHA256(I∥N)<2{{ .Global.NeedBitsReverse }}\mathrm{SHA256}(I \,\|\, N) < 2^{{{ .Global.NeedBitsReverse }}} in big endian, where II is the identifier provided below.

{{ .Identifier }}

Encode your selected nonce in base64 and submit it below.

Please note that if your submission is successful, you will be given a cookie that will allow you to access this site for a period of time without having to complete the challenge again. By pressing the submit button, you agree to be given cookies for this purpose.

{{- if .Message }}

{{ .Message }}

{{- end }}

JavaScript seems to be disabled. You must solve the challenge externally.

A C implementation of the challenge solver is available.