You can export a private key from your account. With the private key, you can create AccountClient. You will also need the address of your account.

Short code example:
```
client = GatewayClient(net=TESTNET)
account_client_testnet = AccountClient(
    address=address,
    key_pair=KeyPair.from_private_key(private_key),
    chain=StarknetChainId.TESTNET,
    client=client,
    supported_tx_version=1,
)
```

war-in

Hey, I have an Argent account and would like to use it in my python scripts. Is there any way of signing transactions in StarkNet.py with an Argent account?

How to use Argent (or any from the main providers) account in the StarkNet.py?

Hello, Starknet will do Final State Reset around Q4 2022.    It means users need to create new wallet address & migrate asset to new wallet.   Old wallet address will be no longer usable after final state reset.     Is this correct?

_This question was originally posted on [StarkNet Discord](https://www.newton.so/view?tags=discord)_

Will StarkNet wallets work after Q4 2022 Final State Reset? Or do I need to create and merge a new wallet?

Hello guys, I would like to know if CAIRO work in python3.10 venv? Because I have a problem to install python 3.9.


_This question was originally posted on [StarkNet Discord](https://www.newton.so/view?tags=discord)_

Does Cairo work in python3.10 venv? I can’t install python 3.9

How do I connect my DAPP to Starknet testnet using starknetjs?

How do I transform data from javascript to Cairo?

Are you able to nest mappings in Cairo like you can in Solidity?

e.g. in Solidity you can do
```solidity
mapping(address => mapping(uint256 => bool));
```
is this doable in Cairo? I want to do something similar to

```cairo

func mappingA(value: felt) -> func mappingB(value: felt)  -> (value: felt){
}
```

mapping(x, y) -> (z) is not gonna work, here is some context:

I'm working through the sample ERC721_Metadata.cairo and ERC721_Metadata_Base contract shown here https://github.com/starknet-edu/starknet-erc721/tree/main/contracts/token/ERC721

It looks like from what I can tell the tokenUri is set for each domain, and even though calling the @view function does take in a tokenId, calling to set the tokenUri does not and it's not clear to me how that mapping could exist otherwise. So I wanted to modify the contract to have a token_id -> token_uri mapping. Because of the way those mappings exist though, you need to provide both the token_uri_len: felt and token_uri: felt*  when writing them. This means it can only be done once, otherwise you'd need a specific @storage_var for every token that's minted, just to hold it's tokenuri. I was hoping to do something like 

```cairo
// Represents a tokenUri
struct TokenUri {
    // The length of the token bytes
    token_uri_len: felt,
    // The pointer to the beginning of the token uri bytes
    token_uri: felt*,
}

@storage_var
func token_uris(token_id: felt) -> (token_uri: TokenUri) {
}
```


But because of the token_url: felt*  pointer in that struct, it can't be used as a storage variable return type. It gives an error when I try to compile showing
```cairo
starknet_contracts/ERC721_Metadata.cairo:29:36: The return type of storage variables must be a felts-only type (cannot contain pointers).
func token_uris(token_id: felt) -> (token_uri: TokenUri) {
```

_This question was originally posted on [StarkNet Discord](https://www.newton.so/view?tags=discord)_

Are you able to nest mappings in Cairo like you can in Solidity?

I'm trying to make a FixedPoint cairo lib, but I'm having some trouble making a pow function. 

It's inspired by this function

```solidity

    function pow(
        uint256 x,
        uint256 y,
        uint256 base
    ) internal pure returns (uint256 z) {
        assembly {
            switch x
            case 0 {
                switch y
                case 0 {
                    // 0 ** 0 = 1
                    z := base
                }
                default {
                    // 0 ** y = 0
                    z := 0
                }
            }
            default {
                switch mod(y, 2)
                case 0 {
                    // If y is even, store base in z for now.
                    z := base
                }
                default {
                    // If y is odd, store x in z for now.
                    z := x
                }

                // Shifting right by 1 is like dividing by 2.
                let half := shr(1, base)

                for {
                    // Shift y right by 1 before looping to halve it.
                    y := shr(1, y)
                } y {
                    // Shift y right by 1 each iteration to halve it.
                    y := shr(1, y)
                } {
                    // Revert immediately if x ** 2 would overflow.
                    // Equivalent to iszero(eq(div(xSquared, x), x)) here.
                    if shr(128, x) {
                        revert(0, 0)
                    }

                    // Store x squared.
                    let xSquared := mul(x, x)

                    // Round to the nearest number.
                    let xSquaredRound := add(xSquared, half)

                    // Revert if xSquared + half overflowed.
                    if lt(xSquaredRound, xSquared) {
                        revert(0, 0)
                    }

                    // Set x to scaled xSquaredRound.
                    x := div(xSquaredRound, base)

                    // If n is even:
                    if mod(y, 2) {
                        // Compute z * x.
                        let zx := mul(z, x)

                        // If z * x overflowed:
                        if iszero(eq(div(zx, x), z)) {
                            // Revert if x is non-zero.
                            if iszero(iszero(x)) {
                                revert(0, 0)
                            }
                        }

                        // Round to the nearest number.
                        let zxRound := add(zx, half)

                        // Revert if zx + half overflowed.
                        if lt(zxRound, zx) {
                            revert(0, 0)
                        }

                        // Return properly scaled zxRound.
                        z := div(zxRound, base)
                    }
                }
            }
        }
    }
```

and I wrote this one in Cairo

```cairo
    func pow{syscall_ptr: felt*, pedersen_ptr: HashBuiltin*, range_check_ptr: felt}(
        x: Uint256,
        n: Uint256,
        baseUnit: Uint256
    ) -> (res: Uint256) {
        alloc_locals;

        let (xIsZero) = uint256_eq(x, Uint256(low=0, high=0));

        if(xIsZero == TRUE) {
            let (nIsZero) = uint256_eq(n, Uint256(low=0, high=0));
            if(nIsZero == TRUE) {
                // 0**0 = 1
                return (res=Uint256(low=1, high=0));
            } 
            // 0**n = 0
            return (res=Uint256(low=0, high=0));            
        }

        let (nHalf, nHalfRem) = uint256_unsigned_div_rem(n, Uint256(low=2, high=0));
        let (nIsEven) = uint256_eq(nHalfRem, Uint256(low=0, high=0));
        let (z) = _assignZIf(nIsEven, baseUnit, x);

        let (baseUnitHalf, baseUnitHalfRem) = uint256_unsigned_div_rem(baseUnit, Uint256(low=2, high=0));

        let (res) = pow_loop(x, nHalf, z, baseUnit, baseUnitHalf);

        return (res=res);
    }

    func pow_loop{syscall_ptr: felt*, pedersen_ptr: HashBuiltin*, range_check_ptr: felt}(
        x: Uint256, 
        n: Uint256, 
        z: Uint256,
        baseUnit: Uint256,
        baseUnitHalf: Uint256
    ) -> (res: Uint256) {
        alloc_locals;
    
        let (n_LteOne) = uint256_le(n, Uint256(low=1, high=0));
        
        if(n_LteOne == TRUE) {
            return (res=z);
        }

        let (xx, xxOverflow) = uint256_mul(x, x);
        assert xxOverflow.low = 0;
        assert xxOverflow.high = 0;

        let (xxRound, xSquaredRoundCarry) = uint256_add(xx, baseUnitHalf);
        let (roundingOverflowed) = uint256_lt(xxRound, xx);
        assert roundingOverflowed = FALSE;

        let (temp_x, temp_x_rem) = uint256_unsigned_div_rem(xxRound, baseUnit);

        let (nHalf, nHalfRem) = uint256_unsigned_div_rem(n, Uint256(low=2, high=0));
        let (nHalfIsEven) = uint256_eq(nHalfRem, Uint256(low=0, high=0));
        if(nHalfIsEven ==  TRUE) {
            let (zx, zxOverflow) = uint256_mul(z, x);
            assert zxOverflow.low = 0;
            assert zxOverflow.high = 0;

            let (shouldBeZ, shouldBeZRem) = uint256_unsigned_div_rem(zx, x);
            let (zxNotOverflowed) = uint256_eq(shouldBeZ, z);
            assert zxNotOverflowed = TRUE;

            let (zxRound, zxRoundCarry) = uint256_add(zx, baseUnitHalf);
            let (zxRoundOverflowed) = uint256_lt(zxRound, zx);
            assert zxRoundOverflowed = FALSE;

            let (temp_z, temp_zRem) = uint256_unsigned_div_rem(zxRound, baseUnit);
            return pow_loop(x=temp_x, n=nHalf, z=temp_z, baseUnit=baseUnit, baseUnitHalf=baseUnitHalf);
        } else {
            return pow_loop(x=temp_x, n=nHalf, z=z, baseUnit=baseUnit, baseUnitHalf=baseUnitHalf);
        }
    }

    func _assignZIf{syscall_ptr: felt*, pedersen_ptr: HashBuiltin*, range_check_ptr: felt}(
        nIsEven: felt,
        baseUnit: Uint256,
        x: Uint256
    ) -> (res: Uint256) {
        if(nIsEven == TRUE) {
            return (res=baseUnit);
        }
        return (res=x);
    }
```

The thing is that I don't get the same results.

Here are some example of my results compared to the solidity function

- pow(1, 3, 10^18): Cairo = 1 / Solidity = 0

- pow(10^18, 5, 10^18): Cairo = 4000000000000000000 (4x10^18) / Solidity = 32000000000000000000 (32x10^18)

- pow(10^19, 5, 10^18): Cairo = 100000000000000000000 (10^20) / Solidity = 100000000000000000000000 (10^23)

I can't see what I'm doing wrong in my code

Fixed Point pow operation error

How do I connect my DAPP to a Starknet node using starknetjs?

Popular tags

How to use Argent (or any from the main providers) account in the StarkNet.py?

1 answers

Your answer

Related

You may find useful