Topic: 'Maecoe' - a virtual currency concept (by any other name would be as sweet) (Read 1926 times)

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


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.

what's the formula for n as a function of m?

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.

ANSWER: "I understand the notation. You want to find the smallest integer n such that the product of the first n irrational square roots, multiplied together, has a binary expansion that matches a specific pattern of m bits.
So, the notation n √√m means:
n is the number of contiguous irrational square roots needed (e.g., √2, √3, √5, ..., √x)
m is the number of bits in the required pattern
For example, if n = 5 and m = 1024, you would need to find the product of the first 5 irrational square roots (√2, √3, √5, √6, and √7) multiplied by some factors, such that the resulting binary expansion matches a specific pattern of 1024 bits.
This is an extremely challenging problem, as it requires finding the smallest n such that the product of n irrational numbers, multiplied by some factors, results in a specific binary pattern of m bits. The value of n will indeed be very large, and the computation required to find it will be significant."

"Professor Kevin presents a concept for a virtual currency called "Maecoe," which differs from other virtual currencies in its approach to proof-of-work. In addition to making the currency network more secure, Maecoe would produce interesting computing results. The miners would have to find a mathematical formula for a chosen string of bits that is more computationally expensive than all previous ones that were mined. This formula would indicate the starting and ending points of an interval of decimals in an irrational numbering expression, along with the combinatorial shuffles, invertings, and shiftings necessary to transform the original string of bits into that formula. The bigger the chosen string of bits, the more expensive the mined formula would get. Two types of data would exist: compressed 'maecoe' data and uncompressed 'maecoe' data, which would be processed and interpreted to become regular data. The concept could be the inspiration to compress the total data of the blockchain, making mining more complex and sophisticated, with the miners using their own logic and artificial intelligence to find the most valuable reduction of a pattern of bits to a tiny mathematical formula." - #ChatGPT

The concept could be inspiration to aim to use mining/PoW to compress the total data of the blockchain, for every new block being created.
According to the difficulty problem necessary a string-of-bits/bits-pattern as long as possible for that difficulty set, would be chosen to be the one miners would be working on, for the PoW necessary for the creation of the next block.
All miners would be working, using their own pools or other pools, each with its own logic and Artificial Intelligence, so that you could find the most computational expensive and valuable reduction of it to a tiny math formula involving decimals of an irrational numbering expression in binary, that could be used to compact and compress data of the blockchain as much as possible once the problem was given the best solution and a new block was created.
This way, mining would not be using brute force but increasingly complex and sophisticate algorithms and artificial intelligence, so that a specific pattern of bits that was chosen for being so popular/frequent in the blochchain data, would be minimized to its 'maecoe' formula and the data of the blockchain  was compressed, making it: 'Maecoe' compressed data.  

#######################################
#                                                                                  
#   'Maecoe' - a virtual currency concept,                          
#                                                    by remotemass          
#                                                                                    
#######################################

Maecoe would have a different approach to the proof-of-work, in order to try to make the computing power more useful, in that it would not just be making the currency network more secure but would also be producing interesting computing results.

The basic idea is that the miners would have to find a mathematical formula for a chosen string of bits that was more computational expensive than all previous ones that were mined.

That mathematical formula would be telling the starting point and ending point of an interval of decimals in an irrational numbering expression, and the combinatorial shuffles, invertings and shiftings necessary to transform the original string of bits into such a tiny mathematical formula with a series of math transformations.

The bigger the string of bits chosen were, the more expensive that mined formula would get.
Also the more popular that string of bits was among all data being analysed by the miners, the more expensive that mined formula would get, as well.

These two factors, among some others that could be found valuable, would be among the most important factors weighting the expensiveness of that candidate mined formula.

As new formulas were mined, each new one being more expensive than all previous ones, it would be indexed with the next serial number. So that the first formula could be expressed by (0), the second by (00), the third by (01), the fourth by (11), the fifth by (000), and so on and so forth.

Now, interestingly enough, these parentheses would actually be represented with bits.
In the following way:
( ) - first parentheses, opening, would be substituted by 100 contiguous zeros, and closing one by another 100 contiguous zeros.
(        )(       ) - in these special case where you want to have two contiguous indexed 'maecoe' formulas substituted by bits, you would open parentheses with the 100 contiguous zeros, as well, but the )( , in the middle would be substituted by 100 contiguous ones, so that you could use that to have as much contiguous 'maecoe' formulas represented as you wanted, being able to suppress the middle duplicate.

Obviously, 100 contiguous zeros in a string a bits may not actually be the most efficient way of escaping the enclosed data for it to be substituted by a 'maecoe' formula.
So, these two patterns would be changed by much more sensible choices, that made them extremely unlikely to be real data in the stream and could be used for that matter to escape the enclosed bits, so that they could be interpreted as 'maecoe' formulas, processed into its meaning, and substituted to get the uncompressed data.

So we would have two types of data:
1) Compressed 'maecoe' data - where our sensible chose patterns (statistically chosen, sure) would be apparent, making it apparent that the data was of that sort.
2) Uncompressed 'maecoe' data - where the data would just look like any raw data of bits, zeros and ones. This can be simply called 'raw data'. But when saying it like this, you would mean that it was the result of interpreting and processing compressed 'maecoe' data to make it regular data.

So it would work pretty much the same like in bitcoin-like virtual currencies, with a mining reward once the next puzzle was solved and so, but one would be compiling and bundling an indexed list of 'maecoe' formulas, that were getting more and more computational expensive.

Maybe actually the indexing of the 'maecoe' formulas should be dynamic so that they were always ordered in the most minimal way, but then again, that dynamic indexing of the formulas might make it problematic in terms chronology and unequivocally meaning.

But anyway, once you compute the tiny formulas they can be embedded in such a markup bracketing way.
Enabling data memory to be stored as a potential that needs to be interpreted/processed to become the actual data.
This seems to make an interesting connection and bridge between data memory and processing.

We can clearly see, that the future of virtual currencies' mining/PoW may be indeed in compressing data.
And the ingenuity of it may well lie in the infinite potential of compacting that an irrational numbering expression may provide, given enough processing power is provided to help it out.

It can get complicated if you think that a specific string pattern can actually be transformed in all sorts of ways, from a simple not inversion of the bits, to more complicated transformations like rearranging the bits positions according to logical rules, combinatorics, geometric progressions, integer sequences, etc.
But certainly, we can imagine how tiny and compact math formulas involving a series of transformations and contigencies, can sprout from the implicate order and certainty of infinit irrational numbering expressions.

And I believe the real revolution of the problem will actually be about when we find a way of using hardware to 'adaptatively scale' the 'hypotenuse', arranging a geometric way to match speeds/distances to find patterns, in the binary expressions of sqrt(2), sqrt(3), (a/b)^(c/d)... you get the idea!
Clearly, grid computing and ingenious hardware will pave the way...