From 06fc76b4f0afdf46b879eae1ae86d438070d3eaa Mon Sep 17 00:00:00 2001 From: Runxi Yu Date: Mon, 24 Mar 2025 19:43:35 +0800 Subject: tmpl.go: Separate the template into its own file --- challenge.tmpl | 286 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ tmpl.go | 291 +-------------------------------------------------------- 2 files changed, 290 insertions(+), 287 deletions(-) create mode 100644 challenge.tmpl diff --git a/challenge.tmpl b/challenge.tmpl new file mode 100644 index 0000000..13eac3d --- /dev/null +++ b/challenge.tmpl @@ -0,0 +1,286 @@ + + + + + + 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.

+
+ +
+

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.

+ + +
+ +
+
+

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.

+
+ +
+ Offline solver program + 
` + html.EscapeString(solverProgram) + `
+
+
+ + + + diff --git a/tmpl.go b/tmpl.go index 0936771..27191cd 100644 --- a/tmpl.go +++ b/tmpl.go @@ -4,301 +4,18 @@ package main import ( - "html" + _ "embed" "log" "text/template" ) +//go:embed challenge.tmpl +var tmplString string 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.

-
- -
-

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.

- - -
- -
-
-

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.

-
- -
- Offline solver program - 
` + html.EscapeString(solverProgram) + `
-
-
- - - -`) + tmpl, err = template.New("powxy").Parse(tmplString) if err != nil { log.Fatal(err) } -- cgit v1.2.3