Topic: This message was too old and has been purged - page 2. (Read 9002 times)

pythonpro1337: The 'p' in (mod p) is 2^255 - 19 and he's not searching for 10 but rather some arbitrarily large number such as 83402281777707715381485212681368749158073214888176003645002923212220704930559

I'm not entirely sure what you're asking here OP, but a couple of things popped into my mind while RE-reading:

1. Using the formula for new_x i presented, if we have to start with x = 9, then we have (x2 - 1)2 = 6400, which means the formula will never reach 10 for any p where 6400 = 0 (mod p), or for which (64002 - 1)2 = 1677721518080001 = 0 (mod p), etc.
 
2. Though you possibly qualified it by saying "at least in the context of...", I just thought I'd note that 2 is not necessarily a generator of ℤp× where p is prime. Consider, for example, p = 7.

Of course, I may be misunderstanding entirely what you're wanting to do.

Yes Evil, please give him the answer so that he can earn his 30 BTC by doing mindless calculations and no real math to prove anything.

If the question tells you exactly how to get the answer, then it is a tutorial.

The answer is to THINK, not just complain.

can you please give me exactly what you are looking for in a CLEAR AND PRECISE PRivate Message? cause i mean you were unclear to begin with and every post its all jumping around to different maths and shit. like seriously you want me to solve thois shit you gotta be clear what you are looking for what types of maths are involved and what type of algorithm or mathematical formula you are requesting. i only went off of what your OP stated (which, was still very unclear)

This message was too old and has been purged

WHAT IS WRONG WITH WHAT I POSTED?! WHAT IS NOT CORRECT?! YOU POSTED SOMETHING YOU NEEDED AN ANSWER FOR, I DID THE MATH AND THE ALGORITHM, IT IS NOT INCORRECT!!!!

This message was too old and has been purged

I HAVE SOLVED THE ISSUE WITH THE MATHEMATICAL EQUATION! ITS FINALLY CLEAR NOW!!!!
here
var equation = equation.replace("x", "(x²-1)² / (4*x*(x²+a*x+1))");
should read
var equation = equation.replace(/x/gi, "(x²-1)² / (4*x*(x²+a*x+1))");
which I already tested for you

I also changed (x²-1)² / (4*x*(x²+a*x+1)) and used (x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1)) instead because javascript can directly evaluate it. Just for demonstation purposes I left
var x=9;

var answer=(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1));
document.write(answer+"
");
var x=answer;
var answer=(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1));
document.write(answer+"
");
which is evaluation by recursion. Find the answer plug it back into the equation etc. Compared with the created equation
var x=9;
var answer=((x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))*(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))-1)*((x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))*(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))-1) / (4*(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))*((x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))*(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))+a*(x*x-1)*(x*x-1) / (4*x*(x*x+a*x+1))+1))
document.write(answer+"
");
both of which return the same answer so the code in the end is

This will give you just the answers minus the equations





Please send bounty to THIS BTC adress!!!
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN

hmm.at school i didn't studied anything like that..i will give my best

This message was too old and has been purged

I just look OP's receive red feedback because offering this bounty for his research's good.

Hope he will paid what he promise or OP can use escrow to hold the fund.

OP should switch the bounty to fiat (or crypto money not based on discrete logarithm assumption)

It is not solved. Funds were used by the wallet for another bounty but he does have enough to cover it, and actually raised it to 40 BTC

What a huge bounty, does anyone solve it? I just check your btc address, the balance is 0. I guess it must be solved. What a pity, I am good at math very much.

What Evil hints at is correct.  

If you have a generator element b of an additive group of order N, and you know it takes x repeated doubling operations (squaring operations in the context of a multiplicative group) on this element in order to reach q then you have effectively solved [multiplicative group notation]:

   q = b^2x

for x.

What we really want to do is crack the discrete logarithm, which means finding x in the context of:

   q = b^x

So the question becomes: if we can solve the first equation can we solve the second?  The answer is yes.  The reason is that the exponent of b is itself an element of it's own multiplicative group ℤ_N^× of which 2 is a generator since N is prime (at least in the context of Curve25519 or secp256k1).

So if you find x that satisfies:

   q = b^2x

then you can use your solution to solve the discrete log easy peasy lemon squeezy.:

   log_b(q) = 2^x mod N

Having at this point successfully solved the discrete log, you can happily collect your 30 BTC which will shortly be worthless since the security of bitcoin relies on the discrete logarithm assumption.

After fixing my computer,my first job would be to sweep the fund here.

That does not appear to be the case from super basic testing

http://pastebin.com/raw.php?i=C9KhyFry
https://github.com/bitspill/Doubling/blob/master/main.cpp

A value of -999 means it attempted doubling 100 million times and did not find the goal, so I'm treating that as if it wont ever find it.

It's likely possible to add checks such that when all possibilities have been exhausted it quits rather than an arbitrary 100 million but I have not


So it would seem in some cases you can't simply double your way there, an add is required occasionally.


Edit: actually it shouldnt be checking for the exhaustion of possibilities but rather the entrance of a loop. Which is possible to implement on tgese small scale test but a loop would be nearly impossible to detect at the scale of 2^256

This message was too old and has been purged

mod: 11
Goal: 6
9 doubles:
4 doubles 1 add
2 doubles 2 adds

So with searching you mean finding a logarithm? This is a well studied problem believed to be hard in general,
and there are software packages doing this as good as possible (which is not very good. this is the whole point
of using elliptic curves for cryptography^^)

I really don't get the point of this thread. 30 BTC bounty for cracking ECC?? I offer 100 BTC for cracking
SHA! (But maybe I have to obsure the problem and rephrase it into semi-mathematical terms for it to be
taken seriously..)