getrawtransaction returns the transaction data of a given transaction id.

Is there a API call which returns all transactions for a given bitcoin address?

If not, which framework do you recommend to build such a query / database?

Alice has encrypted two Private Keys (PrivKey1, PrivateKey2) with the same Password (Password1) and gets as a result two BIP38 Keys (BIP38Key1, BIP38Key2).

Bob eavesdrop with a keylogger, but can only read one Private Key (PrivKey1) and one BIP38 Key (BIP38Key1).

Can Bob calculate or reduce the necessary brute force possibilities to get access to the Password (Password1) and the other BIP38 Key (BIP38Key2)?

A BIP39 word list is designed to allow some level of error correction on your hard copy.

So how to convert a BIP38 key to a BIP39 word list?

The goal is to apply the concept of Defense in depth, so in case the security controls for address 1D2xxxxxx fail, I want to be sure that bitcoin can only be sent to address 1Ji2xxxxxx. The idea is implemented, in Squares Subzero (https://developer.squareup.com/blog/open-sourcing-subzero/).

"One specific customization we implemented is the ability to enforce that cold wallets can only send funds to a Square-owned hot wallet. Such layering provides defense in depth; forcing an attacker to compromise multiple systems in order to extract funds. It is also possible to build additional layers, where each layer can tradeoff convenience with the amount of funds being stored (onion model)."

Is it possible and if so how, to create a bitcoin address that can only spend to one single predetermined address?

For example: I create a new address 1D2xxxxxx and transfer bitcoin to this address. Now I am only allowed to transfer the bitcoin to the adress 1Ji2xxxxxx.

Thanks, for the input. I would like to ask now a slightly related question:

Let's say I do not like the first result and I roll the dice a second time. Has this any influence on the entropy?

Let's further assume I roll the dice a third and n-th time and then take the result. Would this have any influence on the entropy?

Let's assume I roll the dice and get this 5 word diceware password:
unlinked graffiti trapeze tumble snoring
This diceware password is considered to have an entropy of ~12.92 bits (Math.log2(7776)).

Now I change the password to the following:
trapeze tumble snoring graffiti link

I changed one word (unlinked -> link) and I changed the sequence.

How can I calculate now entropy change of modified Diceware password?

Does this mean, that a manufacturer could produce physical bitcoin that are as secure as bitcoin keys that are generated according to the glacier protocol?

I assume that challenges like the following are solved:
- privacy regarding shipping
- transfer security regarding intermediate code

If the answer is yes, my next question would be "Why is there not more supply and demand for empty Physical Bitcoin?" regarding market mechanics and I will post it in Marketplace:
https://bitcointalk.org/index.php?topic=5324759

I wonder why there is not more supply and demand for physical bitcoin. Let me explain ...

I assume that it is technically as secure to produce physical bitcoin as it would be to create bitcoin keys via the glacier protocol.
Please find my question regarding security here: https://bitcointalk.org/index.php?topic=5323632.0

That said, I understand that there is a market for hardware wallets, that fullfil the need for secure keys. The market is - according to the back of the enevlope calc I did - round about 5 million user for hardware wallets. But hardware walltes have security flaws.

I also assume that the market for physical coins is way less - something like 50.000 user.

Right now there is a market of 100 Million bitcoin user, so it is obvious to see that 99% do not follow the "Not your keys, not bitcoin mantra". I mean no wonder, when it is so hard to produce a secure setup. The glacier protocol is cumbersome and you would have to be a technical expert to follow that protocol.

So why is there not more demand and supply for physical bitcoin?

Let's say you have a given Private key (PrivKeyOne). Is there a computational way, so that you can choose or compute a Password (PassOne) to get a BIP38 Private key (Bip38PrivKey) that is identical to a BIP38 Private key that is derived from an other private Key you can choose or compute (PrivKeyTwo) and an other Password (PassTwo) you can choose or compute?

PrivKeyOne + PassOne = Bip38PrivKey

PrivKeyTwo + PassTwo = Bip38PrivKey

Or to put it in other words:
Can you compute two identical BIP38 Keys with two different Private Key and Password pairs of your choice?

I read the suggestions, but - as I was asking - I am looking for a script that runs in a browser: I want to keep the codebase as small as possible. Bigger codebase means more complexity and means less security.

I solved the problem and wrote a JavaScript:


<sup><script>
function parser(str) {
    let num = 0n;
    base = BigInt(6);
    for (const digit of str) {
        num *= base;
        num += BigInt(parseInt(digit, 6));
    }
    return num;
}

const big = "012345... <put your 99 dice rolls here>";
const num = parser(big);
const base16 = num.toString(16);
document.write (base16);
</script></sup>

Since the BIP38 EC multiply procedure cannot guarantee a sufficient entropie for the private keys, I still have to trust the manufacturer of the physical bitcoin to be honest.

Is that correct?

If so, what is then the purpose of BIP38 EC multiply?

I roll the dice and generate a Private key with the bitaddress.org script on an airgapped Windows PC.

To be sure that the bitaddress.org works as expected I want to double check the conversion of the dice rolls to the Private Key.

However I found no script that runs in the browser (like bitaddress does) and takes the base6 dice rolls as input.

Any hints or ideas?

I am looking for a webbased script that converts base 6 (Dice) into base 16 (Private Key), that can be used on a offline PC.

I tried to code it, but parseInt (JavaScript Function) has a problem with big numbers:

var i = 32341234253543242345555;
out1 = parseInt (i, 6);
out2 = out1.toString(16);
document.write (out2);

I am also aware of bitaddress.org, but would like to have a second script that confirms the correct output of the later.

Has anyone a hint for a simple script?

Thanks a lot!

Electrum seems IMHO only to support multisig addresses based on master public keys.

Is there a way within Electrum to create Multisig Addresses based on public keys?

To put in in other words, is there a way to create for example a 2-of-3 multisig from

1UiQ...
1Ais...
1YiP...

ZappyLappy