private static final boolean validate(long[] eA, long[] eB, long[] dltaA, long[] dltaB) {        
        long[] tA = new long[redundant];
        long[] tB = new long[redundant];
        for (int i = 0; i < redundant; i++) {
            int k = maxdiff + i;
            tA[i] = eA[k];
            tB[i] = eB[k];
            for (long j : dltaB) tA[i] = PF.mul(tA[i], PF.sub(smp[k], j));            
            for (long j : dltaA) tB[i] = PF.mul(tB[i], PF.sub(smp[k], j));
            if (tA[i] != tB[i]) return false;
        }
        return true;
    }