agt.sol

    function verifyAgt( uint rootHash,
                        uint rootMin,
                        uint rootMax,
                        uint leaf32BytesHash,
                        uint leafNonce,
                        BlockHeader leafHeader,
                        uint   branchIndex,
                        uint[] countersBranch,
                        uint[] hashesBranch ) constant internal returns(bool) {
                        
        uint leafCounter = leafNonce + (leafHeader.timestamp << 64);
        uint currentHash = leaf32BytesHash & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF;
        
        uint leftCounter;
        uint leftHash;
        
        uint rightCounter;
        uint rightHash;
        
        uint min = leafCounter;
        uint max = leafCounter;
        
        for( uint i = 0 ; i < countersBranch.length ; i++ ) {
            if( branchIndex & 0x1 > 0 ) {
                leftCounter = countersBranch[i] & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF;
                leftHash    = hashesBranch[i];
                
                rightCounter = max;
                rightHash    = currentHash;                
            }
            else {                
                leftCounter = min;
                leftHash    = currentHash;
                
                rightCounter = countersBranch[i] >> 128;
                rightHash    = hashesBranch[i];                                            
            }
            
            currentHash = uint(sha3(leftCounter,leftHash,rightCounter,rightHash)) & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF;
            min = leftCounter;
            max = rightCounter;
            
            if( min >= max ) return false; // TODO what if not a power of 2?        
        }
        
        if( min != rootMin ) return false;
        if( max != rootMax ) return false;
        
        if( currentHash != rootHash ) return false;
        
        return true;
    }