Kakarot's still in the very early stages!

As of today, Kakarot has 85% EVM opcode equivalence, 80% test coverage and ERC20 / ERC721 working. 

While it's better to underpromise and overdeliver than the contrary, we expect to have a mainnet alpha rolling in Q2/Q3 2023.

Elias Tazartes (Eikii)

# wen mainnet launch?

When will Kakarot be available to the public?

When will Kakarot zkEVM launch on mainnet?

hey! Any idea on why I get this error : `HttpError: Bad Gateway ` from `node_modules/starknet/dist/provider/default.js:217`? I may be rate limited because I am using it inside checkpoint indexer but I doubt because I dont even spam it.

Also got this : `Error: Could not POST from endpoint https://alpha4.starknet.io/feeder_gateway/call_contract?blockNumber=pending: request to https://alpha4.starknet.io/feeder_gateway/call_contract?blockNumber=pending failed, reason: socket hang up`

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

`HttpError: Bad Gateway ` from `node_modules/starknet/dist/ error in StarkNet

Why will I use events in the Cairo language? Can I use it on a front-end client application side?

Why will I use events in Cairo language?

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

For an array in Cairo, since there is no inherent structure, removing an item from an array means all of the other items after the removed item must be moved, since this is on the blockchain that can be extremely costly. What is the best way to handle this? Should the removed item just be replaced with an empty placeholder? What is the right way to handle this?


ㅤ
_This question was originally posted on [Triality](https://triality.org/question/224)_

Cairo Array Item Removal

Hi, I'm using pytest for testing cairo contract. I found that a simple starknet setup and initial call for contract cost 34 seconds. Is there a way to accelerate test?

upd: yes, [this works](https://www.notion.so/Hi-I-m-using-pytest-for-testing-cairo-contract-I-found-that-a-simple-starknet-setup-and-initial-ca-db2282fc02f2463aadaf63eac655df6f). but I found that compiling contract cost 7s and deploying contract cost 25s. These two operations are the most time-consuming

 Is there a way to accelerate pytest for cairo contract?

In writing my Cairo program I have the following code:


currNumber is a storage variable:


`@storage_var`


`func currNumber() -> (res : felt):`


`end`


And we have code that calls this value and uses the currNum in a subsequent function:


`...` 


 `let currNum = currNumber.read()`


 `let (res) = findSumDigits(currNum, 0)`


`...`


﻿  



And I am getting the following error:


Expected expression of type 'felt', got '__main__.getCurrNumber.Return'.


 let (res) = findSumDigits(currNum, 0)


 ^*****^


ㅤ
_This question was originally posted on [Triality](https://triality.org/question/835)_

Cairo Error: Getting Expected expression of type 'felt', got '__main__.getCurrNumber.Return'

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?

Popular tags

When will Kakarot zkEVM launch on mainnet?

wen mainnet launch?

1 answers

Your answer

Related

You may find useful