mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2025-10-31 07:52:25 -05:00
31628019fe
# Description
- tweaks the NoLLaMas proof-of-work algorithm to further granularity on time spent computing solutions
- standardizes GoToSocial cookie security directive setting in a CookiePolicy{} type
## Checklist
- [x] I/we have read the [GoToSocial contribution guidelines](https://codeberg.org/superseriousbusiness/gotosocial/src/branch/main/CONTRIBUTING.md).
- [x] I/we have discussed the proposed changes already, either in an issue on the repository, or in the Matrix chat.
- [x] I/we have not leveraged AI to create the proposed changes.
- [x] I/we have performed a self-review of added code.
- [x] I/we have written code that is legible and maintainable by others.
- [x] I/we have commented the added code, particularly in hard-to-understand areas.
- [ ] I/we have made any necessary changes to documentation.
- [ ] I/we have added tests that cover new code.
- [ ] I/we have run tests and they pass locally with the changes.
- [x] I/we have run `go fmt ./...` and `golangci-lint run`.
Co-authored-by: tobi <tobi.smethurst@protonmail.com>
Reviewed-on: https://codeberg.org/superseriousbusiness/gotosocial/pulls/4090
Co-authored-by: kim <grufwub@gmail.com>
Co-committed-by: kim <grufwub@gmail.com>
59 lines
2 KiB
JavaScript
59 lines
2 KiB
JavaScript
/*
|
|
GoToSocial
|
|
Copyright (C) GoToSocial Authors admin@gotosocial.org
|
|
SPDX-License-Identifier: AGPL-3.0-or-later
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Affero General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program 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 should have received a copy of the GNU Affero General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
onmessage = async function(e) {
|
|
console.log('worker started'); // eslint-disable-line no-console
|
|
|
|
const challenge = e.data.challenge;
|
|
const textEncoder = new TextEncoder();
|
|
|
|
// Get difficulty and generate the expected
|
|
// zero ASCII prefix to check for in hashes.
|
|
const difficulty1Str = e.data.difficulty1;
|
|
const difficulty2Str = e.data.difficulty2;
|
|
const difficulty1 = parseInt(difficulty1Str, 10);
|
|
const zeroPrefix = '0'.repeat(difficulty1);
|
|
|
|
let nonce = 0;
|
|
while (true) { // eslint-disable-line no-constant-condition
|
|
|
|
// Create possible solution string from challenge + nonce.
|
|
const solution = textEncoder.encode(challenge + nonce.toString());
|
|
|
|
// Generate SHA256 hashsum of solution string and hex encode the result.
|
|
const hashBuffer = await crypto.subtle.digest('SHA-256', solution);
|
|
const hashArray = Array.from(new Uint8Array(hashBuffer));
|
|
const hashHex = hashArray.map(b => b.toString(16).padStart(2, '0')).join('');
|
|
|
|
// Check if the hex encoded hash has
|
|
// difficulty defined zeroes prefix.
|
|
if (hashHex.startsWith(zeroPrefix)) {
|
|
|
|
// Check if the next char after zero prefix
|
|
// is specifically less than difficulty2 char.
|
|
if (hashHex.charAt(difficulty1) < difficulty2Str) {
|
|
postMessage({ nonce: nonce, done: true });
|
|
break;
|
|
}
|
|
}
|
|
|
|
// Iter.
|
|
nonce++;
|
|
}
|
|
};
|