4

Bitcoin / Bitcoin Technical Support / Re: Encrypted wallet.dat, lost password, any solutions?

on: April 02, 2014, 06:07:29 PM

Wouldn't lost bitcoin be one of the inherent faults with the bitcoin system? It seems inevitable that a huge percentage of bitcoin will eventually be locked/unusable as people continue to lose their wallets or passwords, etc. What happens when 25% or 50% of bitcoin is "lost"? Of course, maybe by then, we'll have already moved on to a "better" cryptocurrency.
It's great for the rest of us because less coins means more value for the ones that are accessible. Think of it this way, they cannot sell those coins cheap, so it keeps the price higher.



11

Alternate cryptocurrencies / Marketplace (Altcoins) / Re: [ANN] Fibonacci SCRYPT ASIC Litecoin LTC Miners  Datasheet Posted

on: March 18, 2014, 12:31:49 AM

I succesfully placed an order!
You might face the problem that you need to send an amount with more decimals than posible. According to jasinlee, round it up to the last possible decimal.
True, and there is a glitch where it does not populate the share after confirms are done. We will correct that after some sleep. Ok, I'm confused about whether my order went thru. I immediately sent payment and it showed as pending the transaction, but now it is cleared, the LTC are in my balance, but I see no evidence of having placed an order including no email. Do I have to order again??



14

Other / Politics & Society / Re: Reddit’s science forum banned climate deniers.

on: March 07, 2014, 04:46:57 PM

I did not read the 26 pages so far, but a few points:
IF Global Warming is happening, it has been shown that it actually can be a prelude to another MiniIceAge and this Winter certainly seems to point at that. This is what I think is happening.
Also, haven't you seen the pics and videos of where some of the temp sensors are placed in cities? They should not even be in a city to begin with, and often they are on the roof right next to an air conditioner heat exchanger!
I DO think it's all mostly the money/carbon tax as this is what drives everything. If we hurt our manufacturers, we hurt our/your country because it causes you to lean on outside countries more and hurts your military capacity.



15

Economy / Speculation / Re: URGENT, Bitcoin is on the verge of collapse !!!

on: March 07, 2014, 04:31:37 PM

What you are missing is that some will leave when it becomes even more unprofitable and the difficulty will drop.
Also, there will always newbies doing it and people that just want to support the network. Extra funds permitting, I will probably mine the rest of my life. Heck, I've been running 3 Jales till just recently. Now I'm just running the Saturn. You leave out the fact that many have free electricity  kids at their parents house and many in apartments or using the servers at work(which I don't agree with and could do the same myself).



17

Bitcoin / Bitcoin Discussion / Re: This message was too old and has been purged

on: March 04, 2014, 10:36:31 PM

Ah, but one crucial fact you neg nellies are missing is that it depends how many computers you throw at it. If it would take a 1000 years on one PC, then it would take 1 year on a 1000. Especailly if using the earlier distributed idea where ranges are assigned. Yes, it may not be economically feasible to pay for that electricity versus just buying bitcoins, but it would make solving the problem quicker.



19

Bitcoin / Bitcoin Discussion / Re: This message was too old and has been purged

on: March 04, 2014, 01:31:31 PM

Using a python script is not a very efficient method of brute forcing it. I have a feeling that a lot of total noobs are seriously thinking that it is possible this way. Then again chance, randomness, and probabilities are very counter intuitive. It is just not possible to grasp the numbers involved.
Does anybody know how much k's can be checked per second with that python script?
Winning the lottery is very unlikely also, but someone has to win eventually. If you use random numbers, the very next number chosen COULD be it. What the hell. :D If you are checking a particular range and it's not in that range, then you are truly wasting time. The only shot you had was in picking that range and no way to know if it is correct beforehand. I'm checking maybe 3 mill a day on one fast PC. But I'm still not convinced the code is correct since EK is not answering.



20

Bitcoin / Bitcoin Discussion / Re: This message was too old and has been purged

on: February 27, 2014, 04:05:58 PM

EK, we need to confirm the looping code as I pointed out in my last post, otherwise we are REALLY wasting time and even a 1000 years will not solve it. Don't you need ppp=challenge.point in the loop for each new value of k? Also, didn't you leave out the "k*" in the loop? thanks Is their anyway to make the python script simply loop and keep adding + 1 to k? Or choose a random number for k?
Yes, this would be the following code. This will however (at least I think so) not be very promising: #! /usr/bin/env python
import random import array import cPickle import struct
class CurveFp( object ): def __init__( self, p, a, b ): self.__p = p self.__a = a self.__b = b
def p( self ): return self.__p
def a( self ): return self.__a
def b( self ): return self.__b
def contains_point( self, x, y ): return ( y * y  ( x * x * x + self.__a * x + self.__b ) ) % self.__p == 0
class Point( object ): def __init__( self, curve, x, y, order = None ): self.__curve = curve self.__x = x self.__y = y self.__order = order if self.__curve: assert self.__curve.contains_point( x, y ) if order: assert self * order == INFINITY def __add__( self, other ): if other == INFINITY: return self if self == INFINITY: return other assert self.__curve == other.__curve if self.__x == other.__x: if ( self.__y + other.__y ) % self.__curve.p() == 0: return INFINITY else: return self.double()
p = self.__curve.p() l = ( ( other.__y  self.__y ) * \ inverse_mod( other.__x  self.__x, p ) ) % p x3 = ( l * l  self.__x  other.__x ) % p y3 = ( l * ( self.__x  x3 )  self.__y ) % p return Point( self.__curve, x3, y3 )
def negative (self): negative_self = Point( self.__curve, self.__x, self.__y, self.__order ) return negative_self
def __mul__( self, other ): def leftmost_bit( x ): assert x > 0 result = 1L while result <= x: result = 2 * result return result / 2
e = other if self.__order: e = e % self.__order if e == 0: return INFINITY if self == INFINITY: return INFINITY assert e > 0 e3 = 3 * e negative_self = Point( self.__curve, self.__x, self.__y, self.__order ) i = leftmost_bit( e3 ) / 2 result = self while i > 1: result = result.double() if ( e3 & i ) != 0 and ( e & i ) == 0: result = result + self if ( e3 & i ) == 0 and ( e & i ) != 0: result = result + negative_self i = i / 2 return result
def __rmul__( self, other ): return self * other
def __str__( self ): if self == INFINITY: return "infinity" return "(%d,%d)" % ( self.__x, self.__y )
def double( self ): if self == INFINITY: return INFINITY
p = self.__curve.p() a = self.__curve.a() l = ( ( 3 * self.__x * self.__x + a ) * \ inverse_mod( 2 * self.__y, p ) ) % p x3 = ( l * l  2 * self.__x ) % p y3 = ( l * ( self.__x  x3 )  self.__y ) % p return Point( self.__curve, x3, y3 )
def halve( self ): if self == INFINITY: return INFINITY
p = self.__curve.p() a = self.__curve.a() # next three lines must be reverted somehow, then I am a multi millionaire :) # as a=0 in this case, I have eliminated it! l = ( ( 3 * self.__x * self.__x ) * inverse_mod( 2 * self.__y, p ) ) % p x3 = ( l * l  2 * self.__x ) % p y3 = ( l * ( self.__x  x3 )  self.__y ) % p
return Point( self.__curve, x3, y3 )
def x( self ): return self.__x
def y( self ): return self.__y
def curve( self ): return self.__curve def order( self ): return self.__order INFINITY = Point( None, None, None )
def inverse_mod( a, m ): if a < 0 or m <= a: a = a % m c, d = a, m uc, vc, ud, vd = 1, 0, 0, 1 while c != 0: q, c, d = divmod( d, c ) + ( c, ) uc, vc, ud, vd = ud  q*uc, vd  q*vc, uc, vc assert d == 1 if ud > 0: return ud else: return ud + m
_p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2FL _r = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141L _b = 0x0000000000000000000000000000000000000000000000000000000000000007L _a = 0x0000000000000000000000000000000000000000000000000000000000000000L _Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798L _Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8L
class Public_key( object ): def __init__( self, generator, point ): self.curve = generator.curve() self.generator = generator self.point = point n = generator.order() if not n: raise RuntimeError, "Generator point must have order." if not n * point == INFINITY: raise RuntimeError, "Generator point order is bad." if point.x() < 0 or n <= point.x() or point.y() < 0 or n <= point.y(): raise RuntimeError, "Generator point has x or y out of range."
sex = CurveFp( _p, _a, _b ) ass = Point( sex, _Gx, _Gy, _r ) g = ass
if __name__ == "__main__": print '=======================================================================' ### generate privkey challenge = Public_key(g, Point( sex, 0x4641b45737ee8e11ae39899060160507d61a30928b0d3e37b6aede29b4ed807bL, 0xb61b706b81dbb5512c556dfd16815cced84e2fa12b5c8b6440057355f0df2a12L)) ppp=challenge.point
# find the correct k k=random.randrange(1,2**255) # !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
ppp=ppp + k*g
while True: ppp=ppp+g k=k+1 if ppp.x() == g.x(): print "found!!!!!!! k=" + hex(k) else: print hex(ppp.x()) + " not matching " + hex(g.x())



