RE: Something different.17 Jul 2025 07:36
Usersteve:
I think the following excerpt from the Web site gives the best description you'll get for Method B
" Unlike current standard BTC mining approach, based on a search, where the mining rig runs as many Tera hashes per second as possible, during the circa 10 minutes allowance for each block, with no special criteria on which hashes to process first, also described as brute force, or blind search, QBTโs Method B, guides the search, by deciding where the most promising winning hashes are likely to be found in the 2^1024 search space.
Method B performs an informed search using the degree of freedom made available different headerโs parametersthereby selects portions of the search space to be explored by SHA-256. This approach avoids processing a large number of hashes, obtaining the target result, u.e. the a winning hash, in less time."
Thus my comment that Methods A and B point to a rought location where hashing could start from. Once started Method C could then be used to sift through the reduced inputs to further reject losers.
But since Gardin cannot produce any straightforward figures ๐๐ถ๐๐ต ๐ฎ ๐ฐ๐น๐ฒ๐ฎ๐ฟ ๐บ๐ฒ๐ฎ๐๐๐ฟ๐ถ๐ป๐ด ๐ฟ๐ฒ๐ณ๐ฒ๐ฟ๐ฒ๐ป๐ฐ๐ฒ then I don't believe a word of his interviews or RNS