This message was too old and has been purged

[bitspill]

Was just reading more on the Montgomery curve under the arithmetic section, I think we are safe to "ignore" z, him saying z=1 allows us to say X=x and that's all we need the z for.

Code:

A point P=(x,y) on the elliptic curve in the Montgomery form By^2 = x^3 + Ax^2 + x can be represented in Montgomery coordinates P=(X:Z), where P=(X:Z) are projective coordinates and x=X/Z for Z!=0

[ndnh]

Was just reading more on the Montgomery curve under the arithmetic section, I think we are safe to "ignore" z, him saying z=1 allows us to say X=x and that's all we need the z for.

Code:

A point P=(x,y) on the elliptic curve in the Montgomery form By^2 = x^3 + Ax^2 + x can be represented in Montgomery coordinates P=(X:Z), where P=(X:Z) are projective coordinates and x=X/Z for Z!=0

yes, that seems a reasonable interpretation.

Should i ignore a as given by ncsupanda. I don't think that ignoring 'a' is right.

Mathematically as long as the "a" value remains constant during each new iteration then the effect it has is constant - it's not unnecessary, it just doesn't need to be evaluated for, so it should be fine to set as any integer and leave it alone.

As got the results you got, I don't think you are substituting the equation back into itself for each new x value, I think you are just increasing x by 1 and then repeating the calculation. What you want to be doing is leaving x constant (in this case 9) and then reevaluating each iteration until your new x value matches the next incremented integer value of x (in this case 10).

If I've misunderstood anything, feel free to correct me. That's just how I understand it.

Also, is this the right formula? If so, A=a?

[ndnh]

How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)?

that is the exact operation I did. So I was not wrong?

I also get an impression that, each one has multiple solutions? which probably explains

You can start multiple such chains beginning at x=9, and add the resulting x values ?

[bitspill]

Should i ignore a as given by ncsupanda. I don't think that ignoring 'a' is right.

Mathematically as long as the "a" value remains constant during each new iteration then the effect it has is constant - it's not unnecessary, it just doesn't need to be evaluated for, so it should be fine to set as any integer and leave it alone.

Also, is this the right formula? If so, A=a?

I think 'a' is an arbitrary constant provided by Evil-Knievel
From the problem description "Being a some constant," I think is meant to be interpreted as

Code:

'a' being some constant

How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)?

that is the exact operation I did. So I was not wrong?

Here's my thinking on the question...


x_0 is always 9
a is an arbitrary constant
G is the end goal, also an arbitrary number chosen by Evil-Knievel
_i is the number of steps through the recursive function you must take to reach G

Evil-Knievel is looking for a way to solve '_i' provided any 'a' and any 'G'


EDIT: That's not just standard division, it's as he mentioned using inverse modular multiplication, but visually it's depicted as division.

[crazykiddo]

Did someone solve the problem and get the bounty? What was that mathematical formula for? I heard evil wants to crack bitcoin. This formula is useful for cracking bitcoin?

[bitspill]

Did someone solve the problem and get the bounty? What was that mathematical formula for? I heard evil wants to crack bitcoin. This formula is useful for cracking bitcoin?

[ndnh]

Should i ignore a as given by ncsupanda. I don't think that ignoring 'a' is right.

Mathematically as long as the "a" value remains constant during each new iteration then the effect it has is constant - it's not unnecessary, it just doesn't need to be evaluated for, so it should be fine to set as any integer and leave it alone.

Also, is this the right formula? If so, A=a?

I think 'a' is an arbitrary constant provided by Evil-Knievel
From the problem description "Being a some constant," I think is meant to be interpreted as

Code:

'a' being some constant

How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)?

that is the exact operation I did. So I was not wrong?

Here's my thinking on the question...


x_0 is always 9
a is an arbitrary constant
G is the end goal, also an arbitrary number chosen by Evil-Knievel
_i is the number of steps through the recursive function you must take to reach G

Evil-Knievel is looking for a way to solve '_i' provided any 'a' and any 'G'


EDIT: That's not just standard division, it's as he mentioned using inverse modular multiplication, but visually it's depicted as division.

I think you are right. thanks for clarifying it.

Did someone solve the problem and get the bounty? What was that mathematical formula for? I heard evil wants to crack bitcoin. This formula is useful for cracking bitcoin?

http://img2.wikia.nocookie.net/__cb20140808184223/bloodbrothersgame/images/c/c7/Implied_facepalm.jpg

lol.
Been seeing a lot of people asking the same thing.

[koelen3]

Maths always seemed to hard for me
But i'll try it

[redsn0w]

So what is the winner of this contest ? I've seen he moved the funds to other bitcoin addresses :

- https://blockchain.info/it/tx/ce4473df59f34aedfca5e5ead092f2c864292eb4cb7cffb91461f814c994ebc8

- https://blockchain.info/it/tx/2fa9040b611069fa97779ee7db0d3ff1088095d3c0e1131973946f904d429f22

[jsmit332]

I would like to know what the winning solution was.

[brituspol]

I'm totally confused.

Where is x and y?

Edit: The winners?

[bitspill]

There is no winner yet.

[jsmit332]

There is no winner yet.

Where have the funds gone then? Why has Evil-Kinevel moved the BTC?

[brituspol]

There is no winner yet.

Where have the funds gone then? Why has Evil-Kinevel moved the BTC?

Lol, Those two transactions are not found in blockchain. Found.

[bitspill]

There is no winner yet.

Where have the funds gone then? Why has Evil-Kinevel moved the BTC?

Look at replies 45, 46, 65, 66 and a few others.

The balance was selected by his wallet to pay one of his other bounties

[caga]

I emember op requested for the solution to be messaged to him in private. He might have got the solution, and might now share. But I was hoping to see a confirmation if there was a winner.

[Watoshi-Dimobuto]

There is no winner yet.

Where have the funds gone then? Why has Evil-Kinevel moved the BTC?

Look at replies 45, 46, 65, 66 and a few others.

The balance was selected by his wallet to pay one of his other bounties

Put that in a large font size. Too many people asking the same question. Don't bother answering them all.

Solution not yet found.

[chronicsky]

Can the OP confirm if the solution has still not been found?

[Evil-Knievel]

This message was too old and has been purged

[Evil-Knievel]

This message was too old and has been purged