Quote from: remotemass on May 01, 2024, 09:23:14 AM

Sequence contiguosly the square root of whole integers that is irrational (√2, √3,√5,√6,√7,√8,√10,...,) and multiply them all with as many factors as necessary until its decimal exansion in binary matches a required pattern of a very large number of bits. The total number of factors that is required for those bits to be expressed will be an integer, a very large one, obviously. You write n √√m , where n is how many factors of contiguous irrationals are needed and m is the number of bits of the pattern.

this is a very strange thing. what is its point?

Quote

The value of n will indeed be very large, and the computation required to find it will be significant."

what progress have you made on this

i think no one is replying to you because this doesn't even belong in the altcoin section. it's more of a development project having to do with proof of work. so maybe its in the wrong section.