|
443
|
Other / Meta / Re: Stake your Bitcoin address here
|
on: September 27, 2023, 03:33:12 PM
|
The provided address will be used to prove ownership for Sherbet core management. This account may grant access to multiple team members but only the authorised owner have the access of this bitcoin address. bc1q2enrpwahznde6c5pks2phuv702s2rsxhe9zpkz H0ZtM85z9KqEk7K7EcmrHwwGKGyVCFNDcIBeUGhcgFxgBq7MFHio+Jt4jrgIfnxvI1vxNsZ9ZkIi780WiXQILiU= Verification successful  |
|
|
|
|
444
|
Local / Español (Spanish) / Re: ¿Se pueden ver todas las TXs pendientes de más antiguas a más recientes?
|
on: September 27, 2023, 05:23:18 AM
|
Q1) ¿Alguien sabe cómo pueden verse estas TXs tan antiguas?
He probado parametrizar Blockchair en vano.
La API de mempool.space se me hace muy completa y amigable. Q2) ¿La fecha de TX que vemos en los exploradores de las TXs pendientes sería la fecha de primera emisión de la TX o de inclusión de la TX en la mempool?
Escribi hace unas semanas esa duda TX Broadcast timestampEsta informacion varia mucho dependiendo del explorador, en el caso de mempool.space las transacciones generalmente tienen el tiempo en el que fueron recividas, sin embargo si la transaccion es reemplazada mediante RBF o FullRBF entonces cosas raras pasan con estos tiempos. Despues de un tiempo mempool dropea la transaccion vieja dejando la nueva, pero como no todos los nodos tienen habilitado fullrbf en ocaciones estos vuelven a realizar un broadcast de esa transaccion y esta se reescribe en la base de datos de mempool. (Repito son casos muy puntuales) Q3) ¿Se pueden listar todas las TXs pendientes en alguna herramienta, ordenadas por fecha?
Solamente con script yo tengo algunos hechos nada tan avanzado como descargarlas todas y ordenarlas por fecha, pero no seria dificil hacerlo. import json
import math
import time
import random
import requests
def round_up_to_decimals(number, decimals):
factor = 10 ** decimals
rounded_number = math.ceil(number * factor) / factor
return rounded_number
def get_tx(txid):
time.sleep(0.01)
tx = None
try:
url = ""
if networkname=="bitcoin":
url = "https://mempool.space/api/tx/" + txid
elif networkname=="testnet":
url = "https://mempool.space/testnet/api/tx/" + txid
else:
print("Unknow network")
exit()
response = requests.get(url)
if response.status_code == 200:
tx = response.json()
return tx
except Exception as e:
print(f"An error occurred: {e}")
return tx
def get_mempool_txids():
time.sleep(0.05)
txids = []
try:
url = ""
if networkname=="bitcoin":
url = "https://mempool.space/api/mempool/txids"
elif networkname=="testnet":
url = "https://mempool.space/testnet/api/mempool/txids"
else:
print("Unknow network")
exit()
response = requests.get(url)
if response.status_code == 200:
txids = response.json()
return txids
except Exception as e:
print(f"An error occurred: {e}")
return txids
networkname = "bitcoin"
txids = get_mempool_txids()
#with open("txids.txt", "w") as file:
# file.writelines("%s\n" % txid for txid in txids)
for txid in txids:
tx_data = get_tx(txid)
#do something Las funciones que te podrian ser utiles son: GET Mempool Transaction IDs GET Mempool Recent GET Transaction La ventaja de esta API es que los datos ya estan formateados en JSON, listos para ser parseados facilmente. |
|
|
|
|
445
|
Other / Meta / Re: Stake your Bitcoin address here
|
on: September 27, 2023, 04:03:20 AM
|
address bc1qjyhcjacmpc9pg8wes82lktyrjcwk4sdvqtm7ky message albert0bsd from bitcointalk.org 27 Sep, 2023 signature KA55lRDVVcmNzydSdLsknjq2QS/CFW0utVGhtfmr3iirPW/zGoviBY7n7lE72nH81SV+D2a5syJpb2OZ/NUzdns= |
|
|
|
|
447
|
Local / Español (Spanish) / Re: Keyhunt (Hilo en Español)
|
on: September 27, 2023, 02:18:31 AM
|
En relación a R4, no sé si conoces alguna estimación del tiempo de resolución, y de la incidencia de alguna parametrización del algoritmo en dicho tiempo (por tener alguna noción al respecto). Lógicamente dependerá del equipo utilizado, pero aun así, para un equipamiento tipo determinado (el que digas), ¿por dónde irían los plazos esperados?
Es una Loteria Galactica Ya vamos a empezar a hablar de temas tristes, realmente las posibilidades son muy bajas, sin embargo si no se participa las posibilidades son Cero. Hace tiempo publique un pequeño codigo para estaimar las velocidades: https://github.com/albertobsd/simulations#speedsAhi mismo puedes date una idea del tiempo necesario dependiendo de la velocidad que se tenga y del desafio o nivel de bits que se quiere romper, por ejemplo: Puzzle 64 @ 1 Gigakeys/s (10^9): 292 years
Puzzle 64 @ 1 Terakeys/s (10^12): 0 years
Puzzle 68 @ 1 Gigakeys/s (10^9): 9359 years
Puzzle 68 @ 1 Terakeys/s (10^12): 9 years
Puzzle 63 resuelto el 7 de Junio de 2019 Puzzle 64 resuelto 9 de septiembre de 2022 En este caso se trata para desafios de solo fuerza bruta. El calculo es lineal, y cada nivel de bit adicional incrementa en un factor de 2 el desafio previo. Para el caso de las llaves publicas ni lo quiero mencionar: Para BSGS los tiempos son los siguientes: Puzzle 120 @ 1 Exakeys/s (10^18): 21074771622 years
Puzzle 125 @ 1 Exakeys/s (10^18): 674392691925 years
Puzzle 130 @ 1 Exakeys/s (10^18): 21580566141612 years
Puzzle 120 resuelto el 27 de Febrero de 2023 Puzzle 125 resuelto el 9 de Julio de 2023 Cabe mencionar que estos 2 ultimos rompecabezas fueron resueltos por la misma persona/organizacion: 3Emiwzxme7Mrj4d89uqohXNncnRM15YESsPor lo tiempos de resolucion posiblemente fueron resueltos utilizando Kangaroo y alguna granja de GPUs or algun otro hardware especializado, sin embargo la persona que los resolvio no se pronunciado en ningun lado, por lo menos no publicamente. Dejo aqui una lista de todos estos desafios con vario datos como llaves publicas, direcciones, fecha de resolucion en caso de aplicar etc: Bitcoin Challenges |
|
|
|
|
449
|
Other / Beginners & Help / Re: Plz help trust wallet haked
|
on: September 26, 2023, 06:17:53 PM
|
It is really hard to heard histories like that  My wallet got unautorize transection
It was really unautorized? Since you conect your wallet to that site i think that you inadvertently authorized it. It is clearly a theft from they, but you allowed it. Sr. Member
Activity: 486
Merit: 250Bro i should expected more caution from a senior member with that amount of messages. You may know that blockchain transactions are irreversible |
|
|
|
|
452
|
Bitcoin / Development & Technical Discussion / Re: math puzzle - if solve I pay:)
|
on: September 26, 2023, 05:57:00 PM
|
You should note one important thing: for puzzle 120 and puzzle 125, you have private keys with many zeroes. But nobody revealed the private key anyway, even though there are two or more transactions for each of them. Which means, you need a nonce, that has many zeroes, not the key itself! And that difference is quite important. Surprisingly, you can swap a key with a nonce, or even do a bitwise-swap, but it does not help in this specific case.
@garlonicon this is far away one of the best and simply answer in this topic that i've seen, I reach more or less to the same conclution some two months ago. I try to reorder/combine/add/subtract and other weird operations with the Signature proofs that we have on puzzle 120 and 125 without any success. I did all this thing trying to construct manually the LLL matrix but i see that is not possible interchange the privatekey and the nonce in this way. Another important thing to note, is that lattice is far from perfect, and can give you no results, even if your keys are quite small. I had some cases, where 8-bit keys were not broken, because some numbers were not aligned well. So, this is not the attack, that always works, even if someone will give you the proper algorithm, it can still fail for some specific keys.
This is last part is some new for me now that you mention it it make a lot of sense, i am not a LLL expert, but I can explain a little bit this part and why it is not perfect. In the video that i mention before : Biased Nonce Sense Lattice attacks against weak ECDSA signatures in the wildWe have some values in the Series of linear equations like: K1 -t1d - a1 = 0 mod N
K2 -t2d - a2 = 0 mod N
K3 -t3d - a3 = 0 mod N
...
Kn -tnd - an = 0 mod N And we need to write a matrix like in the image:  If you see carefuly we are omitting those constans a1, a2, ... an Those values aren't necesary to construct the matrix becuase the lattice nature can more or less handle some of those "errors" but as you mention it is not always the case. In the video Nadia said that more or less like: Kind of high level version of this attacks is the if ummh, the secret nonce is kind or is small then the system of equations likely has only one solution and lattice can magically find it Video at time: 5:53 |
|
|
|
|
453
|
Other / Off-topic / Re: Bitcoin, unbelievable but true.
|
on: September 26, 2023, 05:22:14 PM
|
|
Congrants with your earnings
Try to at least keep some bitcoin for you. Some rule when you have some earning is pay yourself first, this is save some for your future self.
In some years bitcoin will be worth more and in that time you may regret selling all of it. It happened to me and it happens to many people.
Stack every satoshi that you can.
|
|
|
|
|
455
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: September 26, 2023, 02:40:36 PM
|
@albert0bsd
Trying to understand...
Why would endomorphism not work with BSGS if I am searching the entire space?
Do you want the sort answer or a long answer? I would try to explain it as simply as possible. What is endomorphism? According to wikipedia: In mathematics, an endomorphism is a morphism from a mathematical object to itself. In this case i see endomorphism as a math function that maps a public key to another public key Examples of it ? Point negation function Lets to said that you have a public key with some (X,Y) values, if you negate that Publickey you will get something like (X,Y2), The X value is the same value from the same point, if you negate this value again you will get the original (X,Y) values, do you the endomorphism here? A math function that maps a value to another representation of itself. In the case of of the Values of lambda and beta we have that: Q * lambda = (x * beta mod p , y) Q is a publickey and (x, y) are their independent values. Q * lambda is a Scalar multiplication (It is some kind of expensive operation) In the other hand x * beta is just a regular multiplication. (x,y) -> (x * beta mod p , y) -> (x * beta^2 mod p , y) -> (x,y) Now is it possible to apply this to BSGS? I've thinking a lot this and for BSGS the endomorphism is useless because, if you are working in a Baby table from 1 to N, the baby table for endomorphism will be from 1*lambda , 2 * lambda , 3 * lambda , ... N * lambda. and then you may need to add the x*beta to all your Giants steps (This will reduce the speed a little), But in any case, lets to said that you are going to hit the key with the regular BSGS process, that means that you are going to hit the key with the BSGS-endomorphism. So see it? it is useless if you are going to find the key with regular BSGS, why overcomplicate a process that actually is complicated? |
|
|
|
|
456
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: September 26, 2023, 01:35:12 PM
|
your first analisys seems interesting but i think that those repeated bits in some specific puzzles are just a coincide. Lastt Found Address : 13zb1hQbQVEsGkStRa5QNndvakyhr9ji6M 36DB505C509D330C1
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^ ^
Charr Match Totalss : 9
Total Found Address : 458
Total scned rangess : 58410
Charr Match Totalss : 9  ?? Only the first 7 match, with out counting the first 1, i mean it is impossible that the first character is not 1 for legacy address P2PKH Lastt Found Address : 13zb1hQbBpwfx2dfsz96hZc3eyBAskknZD 3967C187FFBA0F1D1
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^
Charr Match Totalss : 8
Total Found Address : 459
Total scned rangess : 58411
Again only 7 match Lastt Found Address : 13zb1hQbBpwfx2dfsz96hZc3eyBAskknZD 3967C187FFBA0F1D1
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^
Charr Match Totalss : 8
Total Found Address : 459
Total scned rangess : 58412
Only 7, the thing is that all the characters need to match 1FeexV6bAHo9rxCoRCbMbdGsVA13ca3Cc6 2B91CA5E6DE963B9F
1FeexV6bAHb8ybZjqQMjJrcCrHGW9sb6uF
Those M aren't even in the same position, those extra characters doesn't metter, it need to match all 160 bits.. Should I have to create a pool with such stupidity?
No |
|
|
|
|
459
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: September 25, 2023, 02:03:30 PM
|
The results with fractions or float (floating point number) are represented on the curve with integers.
Totally agree with you and not only that. - All negative numbers (Result of some subtractions) are still represented by positive values.
- All numbers can be fractions or integers. x/(N-1) where N is the Order of the curve
- Negative odd values are posive even values.
And the other way around is also valid, The lats point is also some important because we can't know if a subtraction result is negative or posive, odd or even. IMO After 3 years of learning all that I can, I reached the conclusion that there is not an Arithmetic operation with the public key that can lead in any bit disclosure. is this puzzle still unsolved to date?
Not all, just some of them, the challenge still have 956.5 BTC |
|
|
|
|
460
|
Alternate cryptocurrencies / Altcoin Discussion / Re: What to do with spam and scam tokens on my wallet?
|
on: September 25, 2023, 01:46:15 PM
|
|
Just ignore them spam tokens or change of wallet.
Do not interact with these unwanted tokens in any way, such as trading, transferring, or approving transactions related to them. Interacting with these tokens may lead to further losses or complications.
If the unwanted tokens are causing significant issues and you are concerned about your wallet's security, you may want to consider creating a new wallet.
Search for a wallet software that allow you to hide those tokens
|
|
|
|
|
Show Posts
