DNSDOH.ART
Home DNS Leak Test IP & Fingerprint News
Guides Protocols FAQ Server Info
Setup
Home DNS Leak Test IP & Fingerprint News
Guides Protocols FAQ Server Info
Setup
Back to changelog
SECURITY August 7, 2026

Measured: why the hardest challenge runs at 4 bits and the cheap one needs 26

A new guide measures the two work functions behind browser proof-of-work challenges in the same WebAssembly runtime a browser uses. One SHA-256 probe costs 0.3862 microseconds; one Argon2id probe at 19 MiB costs 71.2 milliseconds - a ratio of about 184,000 to one. That inverts the difficulty settings: the memory-hard tier runs at 2 to 4 bits where the compute tier needs 20 or more, and pushing the compute tier to 26 bits costs a real user 25.9 seconds while a rented GPU farm barely notices. A 12-minute flood on 7 August, 67,751 challenges to 923 addresses across 525 networks in 97 countries, produced zero incorrect proofs - and the article is explicit that this shows nobody attempted the work, not that nobody could.

Back to all updates
DNSDOH.ART

Encrypted DNS resolver answering over DoH, DoH3, DoT and DoQ. No accounts, and no query log.

Secure Contact & Code
Decrypting...
Core Engine Specification

Product

  • Home
  • Setup Guide
  • Guides
  • Protocols
  • News & Updates

Verify & Test

  • DNS Leak Test
  • IP & Fingerprint
  • Knowledge Base
  • Server Specs

Legal

  • Privacy Policy
  • Terms of Service

© 2022 - 2026 DNSDOH.ART. Zero Logs. Zero Tracking.

Systems Operational