Search content
Sort by
Showing 20 of 96 results by mausuv
If you want to get n-value, based on p-value, then you can visit Sage Cell Server and use this code:
Code:
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffef9
P = GF(p)
aP = P(0x0)
bP = P(0x7)
Secp256k1 = EllipticCurve(P, (aP, bP))
print(hex(Secp256k1.order()))
Then, you will see 0xffffffffffffffffffffffffffffffff9d70b40e72725ad652cd62c55808d873 as a result.P = GF(p)
aP = P(0x0)
bP = P(0x7)
Secp256k1 = EllipticCurve(P, (aP, bP))
print(hex(Secp256k1.order()))
i need basic math
Secp256k1 = EllipticCurve(P, (aP, bP))
print(hex(Secp256k1.order()))
It synthesizes ok on Altera Cyclone 4, takes around 15k gates, but bit slow. At 50 Mhz clock, it takes ~18uS to add a point and hashing takes 3uS.
https://github.com/fpgaminer/fpgaminer-vanitygen
how to run .v # fpgaminer_vanitygen_top.v
how to compile linex
tell me
You need to install Quartus Prime, then follow the 13 step guide.
But keep in mind this is mostly useful to learn Verilog and play with your FPGA board. For practical purposes it is best
to run VanitySearch on your CPU, it will be x10000 faster.
i try to install Quartus Prime lot of error my linex
send me your fpgaminer-vanitygen compile file please
# uplode your file this site https://www.transfernow.net/en send link please or gdrive , other linkIt synthesizes ok on Altera Cyclone 4, takes around 15k gates, but bit slow. At 50 Mhz clock, it takes ~18uS to add a point and hashing takes 3uS.
https://github.com/fpgaminer/fpgaminer-vanitygen
how to run .v
how to compile linex
tell me
Code:
import hashlib
import base58
def hash160(hex_str):
sha = hashlib.sha256()
rip = hashlib.new('ripemd160')
sha.update(hex_str)
rip.update(sha.digest())
return rip.hexdigest() # .hexdigest() is hex ASCII
pub_keys = open('pubkey.json', 'r', encoding='utf-8')
new_file = open('addresses.json', 'a', encoding='utf-8')
compress_pubkey = False
for pub_key in pub_keys:
pub_key = pub_key.replace('\n', '')
if compress_pubkey:
if (ord(bytearray.fromhex(pub_key[-2:])) % 2 == 0):
pubkey_compressed = '02'
else:
pubkey_compressed = '03'
pubkey_compressed += pub_key[2:66]
hex_str = bytearray.fromhex(pubkey_compressed)
else:
hex_str = bytearray.fromhex(pub_key)
key_hash = '00' + hash160(hex_str)
sha = hashlib.sha256()
sha.update(bytearray.fromhex(key_hash))
checksum = sha.digest()
sha = hashlib.sha256()
sha.update(checksum)
checksum = sha.hexdigest()[0:8]
new_file.write("" + (base58.b58encode(bytes(bytearray.fromhex(key_hash + checksum)))).decode('utf-8'))
new_file.write((base58.b58encode(bytes(bytearray.fromhex(key_hash + checksum)))).decode('utf-8') + "\n")
pub_keys.close()
new_file.close()
import base58
def hash160(hex_str):
sha = hashlib.sha256()
rip = hashlib.new('ripemd160')
sha.update(hex_str)
rip.update(sha.digest())
return rip.hexdigest() # .hexdigest() is hex ASCII
pub_keys = open('pubkey.json', 'r', encoding='utf-8')
new_file = open('addresses.json', 'a', encoding='utf-8')
compress_pubkey = False
for pub_key in pub_keys:
pub_key = pub_key.replace('\n', '')
if compress_pubkey:
if (ord(bytearray.fromhex(pub_key[-2:])) % 2 == 0):
pubkey_compressed = '02'
else:
pubkey_compressed = '03'
pubkey_compressed += pub_key[2:66]
hex_str = bytearray.fromhex(pubkey_compressed)
else:
hex_str = bytearray.fromhex(pub_key)
key_hash = '00' + hash160(hex_str)
sha = hashlib.sha256()
sha.update(bytearray.fromhex(key_hash))
checksum = sha.digest()
sha = hashlib.sha256()
sha.update(checksum)
checksum = sha.hexdigest()[0:8]
new_file.write("" + (base58.b58encode(bytes(bytearray.fromhex(key_hash + checksum)))).decode('utf-8'))
new_file.write((base58.b58encode(bytes(bytearray.fromhex(key_hash + checksum)))).decode('utf-8') + "\n")
pub_keys.close()
new_file.close()
this code python public 2 addresses
any easy sage method please... public 2 addresses
public key to Address convert compressed, uncompressed sagemath code please
like this:
Uncompressed: 1EBH5s8KswNw3cSv4yF52M8JhkxyMV74eg
compressed: 14h2grbBy9uXrUgAhr1znnnQy8e6zTzDs4
update please..
@ecdsa123
@PowerGlove
@ETFbitcoin
@witcher_sense
public x to Address convert compressed uncompressed sagemath code please
02 a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd >> 1KAqCkyrNu5PmK6bwmg5h1VN8ags4iXxm4 1K5kLbqNncT2oGbj8KNwkYi49es9CeEtnp
03 a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd >> 1HZwkjkeaoZfTSaJxDw6aKkxp45agDiEzN 1F3sAm6ZtwLAUnj7d38pGFxtP3RVEvtsbV
any one help me sagemath
@PowerGlove
@ETFbitcoin
@witcher_sense
public x to Address convert compressed uncompressed sagemath code please
02 a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd >> 1KAqCkyrNu5PmK6bwmg5h1VN8ags4iXxm4 1K5kLbqNncT2oGbj8KNwkYi49es9CeEtnp
03 a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd >> 1HZwkjkeaoZfTSaJxDw6aKkxp45agDiEzN 1F3sAm6ZtwLAUnj7d38pGFxtP3RVEvtsbV
any one help me sagemath
R-Scaner 2023 not working 
update code please
not working >>https://github.com/stateactor/Bitcoin-Key-Compression-Tool/blob/master/R-Scaner.py
The newbie who created the original version of this code which you are using a copy of, gave up trying to steal other people's money since they never found a reused r a very long time ago. This is why the code was never updated to include the SegWit transaction related stuff!! It is unlikely for anyone else to want to waste their time on this. update code pleasenot working >>https://github.com/stateactor/Bitcoin-Key-Compression-Tool/blob/master/R-Scaner.py
I need vulnerable reused K value any one paste here..
i am found some K value online
Code:
6d8827ba2b40a8498940988a989ce4421c44fed2c8305a1e199277b8b1b51c5b
.....
...
......
i need more.. K value from some one solved addresses
i need more.. K value from some one solved addresses
.....
...
......
i need more.. K value from some one solved addresses
i need more.. K value from some one solved addresses
⭐ Merited by garlonicon (1)
Just wondering if this has any particular meaning when k=s/z ..
R = b55eb357d551df1ea45560dc28ece4480ddcd107556eae7013efb626807844b5
S = efe14a1269ce270b12f3b79d28cfb99dfadb78e0843e9a595e9d1b0ed9bbcc72
Z = 70f6de768e8171c6032de22b261b956c451b7e18455391b1974f9e3a0db3288e
K = 6ec4814e7f2a2443682a4ab10414ceb588450c78edacd8d88e8b33a449549141 255 bits
Z/(s-r) 9dee90db0dee84e616163205eacf40008e385268c7ba7e2728ca48ecf0cfdebf
Z/S= 6ec4814e7f2a2443682a4ab10414ceb588450c78edacd8d88e8b33a449549141
R/S= a720acf15893484e6e4f0c672c2c021beb500f0909e58691efd78a0c763e781a
RS-ZS= 385c2ba2d969240b0624c1b628173366630b02901c38adb9614c56682ce9e6d9
------------------------------------------------------------------------------
etc etc etc....
------------------------------------------------------------------------------
Your Random K Value *G != RR = b55eb357d551df1ea45560dc28ece4480ddcd107556eae7013efb626807844b5
S = efe14a1269ce270b12f3b79d28cfb99dfadb78e0843e9a595e9d1b0ed9bbcc72
Z = 70f6de768e8171c6032de22b261b956c451b7e18455391b1974f9e3a0db3288e
K = 6ec4814e7f2a2443682a4ab10414ceb588450c78edacd8d88e8b33a449549141 255 bits
Z/(s-r) 9dee90db0dee84e616163205eacf40008e385268c7ba7e2728ca48ecf0cfdebf
Z/S= 6ec4814e7f2a2443682a4ab10414ceb588450c78edacd8d88e8b33a449549141
R/S= a720acf15893484e6e4f0c672c2c021beb500f0909e58691efd78a0c763e781a
RS-ZS= 385c2ba2d969240b0624c1b628173366630b02901c38adb9614c56682ce9e6d9
------------------------------------------------------------------------------
etc etc etc....
------------------------------------------------------------------------------
K = 6ec4814e7f2a2443682a4ab10414ceb588450c78edacd8d88e8b33a449549141 255 bits
Your code share please..
1st question: rsz decode problem
I am run python getz_input.py some -txid not decoding rsz, why?
https://github.com/iceland2k14/rsz/blob/main/getz_input.py
Try 1
https://www.blockchain.com/explorer/addresses/btc/1HXSnvNGK8oYQCyLDkpHNZ2sWPvFsYQcFU
Code:
F:\btc>python getz_input.py -txid 26dcc5526ff2ab9decfa967ed21dbd9fc16f4a3690d40592f9073ab1557799d0
Starting Program...
Traceback (most recent call last):
File "F:\btc\getz_input.py", line 114, in <module>
m = parseTx(rawtx)
File "F:\btc\getz_input.py", line 67, in parseTx
r, s, pub = split_sig_pieces(script)
File "F:\btc\getz_input.py", line 38, in split_sig_pieces
sigLen = int(script[2:4], 16)
ValueError: invalid literal for int() with base 16: ''
Starting Program...
Traceback (most recent call last):
File "F:\btc\getz_input.py", line 114, in <module>
m = parseTx(rawtx)
File "F:\btc\getz_input.py", line 67, in parseTx
r, s, pub = split_sig_pieces(script)
File "F:\btc\getz_input.py", line 38, in split_sig_pieces
sigLen = int(script[2:4], 16)
ValueError: invalid literal for int() with base 16: ''
Try bc1
https://www.blockchain.com/explorer/addresses/btc/bc1qupj5h2zcyfsfef7ywf8ea430cn8jz3dm66tzq7
Code:
F:\btc>python getz_input.py -txid 7d4036dbc43e3b785cabb22413b67ee6c8a7375ec316c226c29eb10915647988
Starting Program...
UnSupported Tx Input. Presence of Witness Data
Starting Program...
UnSupported Tx Input. Presence of Witness Data
Try 3
https://blockchain.com/explorer/addresses/btc/3GmSinMx7BHkAHWHo5BMUNTcX6ZA2JunBa
Code:
F:\btc>python getz_input.py -txid 454c90738880a6635446805303c89871f0bb7b362d1ff9ff4e8646ff4e24ef49
Starting Program...
UnSupported Tx Input. Presence of Witness Data
Starting Program...
UnSupported Tx Input. Presence of Witness Data
2nd question: R-Scaner
R-Scaner 2023 not working
update code pleasenot working >>https://github.com/stateactor/Bitcoin-Key-Compression-Tool/blob/master/R-Scaner.py
puzzle 66 where no pubkey is known?
puzzle 66 Address 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so compressed or Uncompressed ??
i speak little eng
c c++ little understanding,so
https://github.com/albertobsd/keyhunt
Private to public >> check bloom filter
any one write simple code c c++ easy to understand
c c++ little understanding,so
https://github.com/albertobsd/keyhunt
Private to public >> check bloom filter
any one write simple code c c++ easy to understand
Re: Who Know this Privatekey 1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt
read this para
3. A Small Subgroup Attack
3.1. Subgroup Detection
Since private keys are elements of Zq∗, a straight brute force attack to the Bitcoin system seems infeasible, as inverting the map
ϕ:Zq∗⟶E,k⟶k⋅P
would imply solving an ECDLP instance.
However, there are few small subgroups H≤Zq∗ that may be inspected, for which an exhaustive computation of all the possible keys and corresponding addresses may be carried out. This way one may compute the inverse of the restricted map
ϕ|H:H⟶G.
Since the keys are supposed to be uniformly distributed, there is no probabilistic argument suggesting their presence in specific small subgroups. However, assuming that this is the case, we need to choose a suitable subgroup. In this view, by considering the factorization of q−1 into prime integers
q−1=26×3×149×631×107361793816595537p1×174723607534414371449p2×341948486974166000522343609283189p3,,
it is not difficult to test that the maximal subgroup of moderate size (i.e. that can today be checked with an average computer) contains N elements, where
N=26×3×149×631=18051648.
Such a group may be easily produced by considering any primitive element t of Zq, such as t=7, and considering the element g=tp1×p2×p3, which generates the subgroup
H=<g>={gi∣∣1≤i≤18051648}.
Indeed, we summarize in the following theorem two well-known results.
Theorem 1. Let F be a field. Then, any finite subgroup G≤F∗ is cyclic. Moreover, for every positive integer M dividing |G|, there is a unique subgroup H≤G such that |H|=M.
3.2. Subgroup Inspection
The group H as previously defined has less than 20 millions elements; therefore, we were able to straightforwardly construct, in a few days, the BTC addresses originated by all private keys k∈H and to check whether they have appeared in the BTC blockchain since its creation until 2018.
We recall that an address appears in the blockchain whenever it receives any amount of bitcoin. Note that the number of addresses in the BTC blockchain does not correspond to the number of actual BTC users, as modern wallets handle many different addresses for each user.
With this procedure, we found 4 BTC addresses, in which private keys belong to H:
1PSRcasBNEwPC2TWUB68wvQZHwXy4yqPQ3,
1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt, i need this addresses from privatekey
1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm,
1JPbzbsAx1HyaDQoLMapWGoqf9pD5uha5m.
Two of them, (3) and (4), came from the trivial keys 1 and −1, and they might have been generated on purpose, but the remaining two addresses appear to be legit. In particular, a blockchain inspection (Reference [21], 2018) suggests that one of them (2) has been used as temporary address for moving a small amount of bitcoins, while the other (1) has probably been used as a personal address, since its owner has stored some bitcoins there for 4 years.
To show that the private key of address (1) was really recovered, we used three of our addresses
A.
1FCuka8PYyfMULbZ7fWu5GWVYiU88KAU9W,
B.
1NChjA8s5cwPgjWZjD9uu12A5sNfoRHhbA,
C.
1695755gMv3fJxYVCDitMGaxGu7naSXYmv,
and we performed tiny transactions from each of them, as shown in Figure 3.
Mathematics 08 01645 g003 550Figure 3. Transactions summary.
These operations may be easily verified through any blockchain explorer, such as Reference [21], by searching for their transaction IDs:
T1.
69ad7033376cea2bbea01e7ef76cc8d7bc028325e9179b2231ca1076468c1a1e,
T2.
1dd5c256a1acc81ea4808a405fd83586ea03d8b58e29a081ebf3d0d95e77bf63,
T3.
b722c77dcdd13c3616bf0c4437f2eb63d96346f74f4eeb7a1e24c1a9711fc101.
4. Discussion and Conclusions
3. A Small Subgroup Attack
3.1. Subgroup Detection
Since private keys are elements of Zq∗, a straight brute force attack to the Bitcoin system seems infeasible, as inverting the map
ϕ:Zq∗⟶E,k⟶k⋅P
would imply solving an ECDLP instance.
However, there are few small subgroups H≤Zq∗ that may be inspected, for which an exhaustive computation of all the possible keys and corresponding addresses may be carried out. This way one may compute the inverse of the restricted map
ϕ|H:H⟶G.
Since the keys are supposed to be uniformly distributed, there is no probabilistic argument suggesting their presence in specific small subgroups. However, assuming that this is the case, we need to choose a suitable subgroup. In this view, by considering the factorization of q−1 into prime integers
q−1=26×3×149×631×107361793816595537p1×174723607534414371449p2×341948486974166000522343609283189p3,,
it is not difficult to test that the maximal subgroup of moderate size (i.e. that can today be checked with an average computer) contains N elements, where
N=26×3×149×631=18051648.
Such a group may be easily produced by considering any primitive element t of Zq, such as t=7, and considering the element g=tp1×p2×p3, which generates the subgroup
H=<g>={gi∣∣1≤i≤18051648}.
Indeed, we summarize in the following theorem two well-known results.
Theorem 1. Let F be a field. Then, any finite subgroup G≤F∗ is cyclic. Moreover, for every positive integer M dividing |G|, there is a unique subgroup H≤G such that |H|=M.
3.2. Subgroup Inspection
The group H as previously defined has less than 20 millions elements; therefore, we were able to straightforwardly construct, in a few days, the BTC addresses originated by all private keys k∈H and to check whether they have appeared in the BTC blockchain since its creation until 2018.
We recall that an address appears in the blockchain whenever it receives any amount of bitcoin. Note that the number of addresses in the BTC blockchain does not correspond to the number of actual BTC users, as modern wallets handle many different addresses for each user.
With this procedure, we found 4 BTC addresses, in which private keys belong to H:
1PSRcasBNEwPC2TWUB68wvQZHwXy4yqPQ3,
1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt, i need this addresses from privatekey
1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm,
1JPbzbsAx1HyaDQoLMapWGoqf9pD5uha5m.
Two of them, (3) and (4), came from the trivial keys 1 and −1, and they might have been generated on purpose, but the remaining two addresses appear to be legit. In particular, a blockchain inspection (Reference [21], 2018) suggests that one of them (2) has been used as temporary address for moving a small amount of bitcoins, while the other (1) has probably been used as a personal address, since its owner has stored some bitcoins there for 4 years.
To show that the private key of address (1) was really recovered, we used three of our addresses
A.
1FCuka8PYyfMULbZ7fWu5GWVYiU88KAU9W,
B.
1NChjA8s5cwPgjWZjD9uu12A5sNfoRHhbA,
C.
1695755gMv3fJxYVCDitMGaxGu7naSXYmv,
and we performed tiny transactions from each of them, as shown in Figure 3.
Mathematics 08 01645 g003 550Figure 3. Transactions summary.
These operations may be easily verified through any blockchain explorer, such as Reference [21], by searching for their transaction IDs:
T1.
69ad7033376cea2bbea01e7ef76cc8d7bc028325e9179b2231ca1076468c1a1e,
T2.
1dd5c256a1acc81ea4808a405fd83586ea03d8b58e29a081ebf3d0d95e77bf63,
T3.
b722c77dcdd13c3616bf0c4437f2eb63d96346f74f4eeb7a1e24c1a9711fc101.
4. Discussion and Conclusions
Re: Who Know this Privatekey 1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt
Why you need ?
If you explain maybe i can past herę.
If you explain maybe i can past herę.
@n0nce
@ecdsa123
i speak little bit eng
i need this addresses form privatekey ,
Code:
https://www.blockchain.com/explorer/addresses/btc/1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt
I found this article : https://www.mdpi.com/2227-7390/8/10/1645 in this para 3. A Small Subgroup Attack
this author found this addresses 1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt from privatekey
so, i need this addresses 1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt privatekey
this article said privatekey founded above 18 million key
para 3. A Small Subgroup Attack, make python please ,
I tried to read the para 3 you pointed to it actually blew my mind it explains about subgroup attacks but look at the forum and bitcoins users why do they still post their BTC addresses publicly?
It means no one can able to calculate and find the private key of any public BTC addresses have you tried to search it through Google? You should find something like this "it is impossible to derive the private key from the public key".
And please read this "Technical background of version 1 Bitcoin addresses"
It means no one can able to calculate and find the private key of any public BTC addresses have you tried to search it through Google? You should find something like this "it is impossible to derive the private key from the public key".
And please read this "Technical background of version 1 Bitcoin addresses"
How btc move without privatekey ?
Code:
https://www.blockchain.com/explorer/addresses/btc/1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt
Who know the privatekey ?You want the private key of the addresses that are not yours? If this is how bitcoin is, everyone will be spending everyone's coins and which means bitcoin is not safe, but bitcoin is safe. You can not generate private key from public key or address.
but, this author alredy found the private key how ? https://www.mdpi.com/2227-7390/8/10/1645see this https://www.blockchain.com/explorer/addresses/btc/1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt some btc move
please explain ,how to get this 1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt privatekey
read this para 3. A Small Subgroup Attack this link https://www.mdpi.com/2227-7390/8/10/1645
explain me
Read this article : https://www.mdpi.com/2227-7390/8/10/1645 in this para 3. A Small Subgroup Attack
i cant understand 18 million above privatekey
please any one read this article paragraph 3. A Small Subgroup Attack make python code
i need this adderss privatekey
Uncompressed Address
1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt
Public Key (hex) 04c994b69768832bcbff5e9ab39ae8d1d3763bbf1e531bed98fe51de5ee84f50fb483ada7726a3c 4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
if you know the private key send me please thinkeasy123@protonmail.com
i cant understand 18 million above privatekey
please any one read this article paragraph 3. A Small Subgroup Attack make python code
i need this adderss privatekey
Uncompressed Address
1B5USZh6fc2hvw2yW9YaVF75sJLcLQ4wCt
Public Key (hex) 04c994b69768832bcbff5e9ab39ae8d1d3763bbf1e531bed98fe51de5ee84f50fb483ada7726a3c 4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
if you know the private key send me please thinkeasy123@protonmail.com
@LoyceV (OP)
Hi, I need Bitcoin Public Key Database with balance
Please upload Bitcoin Public Key Database with balance your site http://addresses.loyce.club/
Example Publickeys.txt
Bitcoin Public Key Database any gdrive github other site send link please
i need 1M < 10M public keys .txt formet
any one send me link please
Hi, I need Bitcoin Public Key Database with balance
Please upload Bitcoin Public Key Database with balance your site http://addresses.loyce.club/
Example Publickeys.txt
Code:
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
Bitcoin Public Key Database any gdrive github other site send link please
i need 1M < 10M public keys .txt formet
any one send me link please
@LoyceV (OP)
Hi, I need Bitcoin Public Key Database with balance
Please upload Bitcoin Public Key Database with balance your site http://addresses.loyce.club/
Example Publickeys.txt
Hi, I need Bitcoin Public Key Database with balance
Please upload Bitcoin Public Key Database with balance your site http://addresses.loyce.club/
Example Publickeys.txt
Code:
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
Code:
# div by scalar
P4= P2*modinv(2,n)
# 2*(1/2)=1
assert P4==P
#mul by scalar
P5=P1*2
assert P5==P2
P4= P2*modinv(2,n)
# 2*(1/2)=1
assert P4==P
#mul by scalar
P5=P1*2
assert P5==P2
i am skip this part of line assert
assert is important or not ?
Code:
# div by scalar
P5= P2*modinv(0x2,n)
print(hex(P5[0]),hex(P5[1]))
#mul by scalar
P6=P2*0x2
print(hex(P6[0]),hex(P6[1]))
P5= P2*modinv(0x2,n)
print(hex(P5[0]),hex(P5[1]))
#mul by scalar
P6=P2*0x2
print(hex(P6[0]),hex(P6[1]))
2nd question :
div is so hard P5= P2*modinv(0x2,n)
any easy to div like this P5 = P2/0x2
@ETFbitcoin
@witcher_sense
@PowerGlove
how to two point [ add , sub , div , mul ] in sagemath
please i need sage code
@witcher_sense
@PowerGlove
Code:
px1 = 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
py1 = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
px2 = 0xc6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5
py2 = 0x1ae168fea63dc339a3c58419466ceaeef7f632653266d0e1236431a950cfe52a
py1 = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
px2 = 0xc6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5
py2 = 0x1ae168fea63dc339a3c58419466ceaeef7f632653266d0e1236431a950cfe52a
how to two point [ add , sub , div , mul ] in sagemath
please i need sage code