// SPDX-License-Identifier: AGPL-3.0-only // SPDX-FileCopyrightText: Copyright (c) 2025 Runxi Yu package main import ( "html" "log" "text/template" ) var tmpl *template.Template func init() { var err error tmpl, err = template.New("powxy").Parse(` Proof of Work Challenge

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.

{{- if .Message }}

{{ .Message }}

{{- end }}

Select a nonce no longer than 32 bytes, such that when it is appended to the decoded form of the challenge token, 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.

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.

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

Offline solver program 
` + html.EscapeString(solverProgram) + `

Powxy is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License, version 3, as published by the Free Software Foundation. Powxy is distributed in the hope that it will be useful, but without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose. See the GNU Affero General Public License for more details. You may wish to view the source code.

`) if err != nil { log.Fatal(err) } }