if ps == zs {
		// Adding (pm1:pm2) + (zm1:zm2)
		pm2, c = bits.Add64(pm2, zm2, 0)
		pm1, _ = bits.Add64(pm1, zm1, c)
		pe -= int32(^pm1 >> 63)
		pm1, m = shrcompress(pm1, pm2, uint(64+pm1>>63))
	} else {
		// Subtracting (pm1:pm2) - (zm1:zm2)
		// TODO: should we special-case cancellation?
		pm2, c = bits.Sub64(pm2, zm2, 0)
		pm1, _ = bits.Sub64(pm1, zm1, c)
		nz := lz(pm1, pm2)
		pe -= nz

	pi1 = pi  // ERROR "cannot use|incompatible"

	pm0 = pm  // ERROR "cannot use|incompatible"
	pm0 = pm1 // ERROR "cannot use|incompatible"
	pm = pm0  // ERROR "cannot use|incompatible"
	pm = pm1  // ERROR "cannot use|incompatible"
	pm1 = pm0 // ERROR "cannot use|incompatible"
	pm1 = pm  // ERROR "cannot use|incompatible"

	pp0 = pp  // ERROR "cannot use|incompatible"
	pp0 = pp1 // ERROR "cannot use|incompatible"

	}

	if params.Q.BitLen() != N {
		t.Errorf("%d: q.BitLen got:%d want:%d", int(sizes), params.Q.BitLen(), L)
	}

	one := new(big.Int)
	one.SetInt64(1)
	pm1 := new(big.Int).Sub(params.P, one)
	quo, rem := new(big.Int).DivMod(pm1, params.Q, new(big.Int))
	if rem.Sign() != 0 {
		t.Errorf("%d: p-1 mod q != 0", int(sizes))
	}
	x := new(big.Int).Exp(params.G, quo, params.P)
	if x.Cmp(one) == 0 {

				continue
			}

			params.P = p
			params.Q = q
			break GeneratePrimes
		}
	}

	h := new(big.Int)
	h.SetInt64(2)
	g := new(big.Int)

	pm1 := new(big.Int).Sub(p, one)
	e := new(big.Int).Div(pm1, q)

	for {
		g.Exp(h, e, p)
		if g.Cmp(one) == 0 {
			h.Add(h, one)
			continue
		}

		params.G = g
		return nil
	}
}

ATN9TatXh0q+ogMr7008CcYMPSyAjGvlCUqAICEll3VKomec4kwah/1jTQQeOKB4
t9peT3eZJLFqQOC8nSFe8ee0iVBYSkZq8OhuiVsb5qL9CrE+9CcAHHv6vRTZWgpo
iBtQekLDk0oqNog6maaYGgheAZYApXPf4twisQIpMYTFXQ5v/i7bIK8IvUaWMDqY
lrC+Dj4nsvwUG03o9CwyRzZhCm1nr4K8R30ML9O4Nh+pM1/+6aGL7cmmIoOP4pae
Ieo2ji06N73rTS7Ndh7SPeLOEy5Dzt40pgH6qy5eBJf2JledbrVrwNJqEJWyrWPz
pagX4dp9mMWM+Mb4lF/0nmLx0q0UT8rwKPuN2SUL2Vr7gUiH/O7x26f20O3t0a7e
95fx9tK5AQ0EVYnHNwEIALuPFPvjDXIRbow6UHbw9XXed3UbSUgo7wXJGy7zD433