dmdox

3 ms·

1.
by dmdox 4y ago
ad hominem, seriously? What does article submission history have to do with anything anyway. Most lurkers don't submit articles. Did you confuse comments and submissions?
2.
by dmdox 5y ago
You are confusing BCH with BSV, which was started by a guy who claims to be Satoshi. Lightning Network is not Bitcoin. It is a separate payments platform, being pushed by a for-profit company, Blockstream. It is never non-custodial. You alw
3.
by dmdox 5y ago
There was a schism in the Bitcoin community in 2017 over this issue, which led to the forking of BCH (Bitcoin Cash) as a separate cryptocurrency: https://www.coinbase.com/price/bitcoin-cash The main difference being th
4.
by dmdox 5y ago
If you're interested in investigating more, take a look at "Continued Fraction Factorization". This is essentially the first step of that more advanced algorithm. From the continued fraction of √n, you get a series of best ra
5.
by dmdox 5y ago
Right. Define L = (a+b)/2 and R = (a-b)/2, so that a * b = L² - R² for all a, b. If there exist positive integers a, b such that a * b = n with |a-b| <= k n^(1/4) [constant k] Then there exist L, R (either both integers or
6.
by dmdox 5y ago
This is polynomial time in the number of bits. I did make one mistake. I forgot to mention the half-integer case for x and y, which requires some additional logic. I implemented it fully python: https://gdl.space/obiyukevit.
7.
by dmdox 5y ago
There's a trivial algorithm to do this in polynomial time. Let x = ceil(sqrt(n)). Let y = sqrt(x^2 - n). If y is an integer, then x^2 - y^2 = n = (x - y)(x + y). This provides the factorization a*b with a, b closest together. If y is a