priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
	priv.Precomputed.Dq.Mod(priv.D, priv.Precomputed.Dq)

	priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])

	r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
	priv.Precomputed.CRTValues = make([]CRTValue, len(priv.Primes)-2)
	for i := 2; i < len(priv.Primes); i++ {
		prime := priv.Primes[i]
		values := &priv.Precomputed.CRTValues[i-2]

	pc=4815228 func=38 file=31 line=27
Stack id=12 nframes=1
	pc=4815680 func=34 file=31 line=37
Stack id=6 nframes=1
	pc=4544768 func=43 file=42 line=868
Stack id=2 nframes=3
	pc=4538523 func=45 file=42 line=238
	pc=4814277 func=37 file=36 line=125
	pc=4815228 func=38 file=31 line=27
Stack id=13 nframes=1
	pc=4815492 func=38 file=31 line=37
Stack id=4 nframes=1
	pc=4547456 func=56 file=50 line=42

Stack id=65 nframes=2
	pc=4803943 func=112 file=113 line=64
	pc=4803629 func=114 file=113 line=47
Stack id=28 nframes=1
	pc=4804691 func=124 file=113 line=70
Stack id=48 nframes=2
	pc=4803943 func=112 file=113 line=64
	pc=4803589 func=114 file=113 line=45
Stack id=61 nframes=3
	pc=4599892 func=130 file=131 line=195
	pc=4804036 func=112 file=113 line=83
	pc=4803609 func=114 file=113 line=46
Stack id=13 nframes=2

	if len(v.abs) == 0 {
		return true
	}

	r := new(Int)
	q, r := new(Int).QuoRem(u, v, r)

	if r.Cmp(v) >= 0 {
		return false
	}

	uprime := new(Int).Set(q)
	uprime.Mul(uprime, v)
	uprime.Add(uprime, r)

	return uprime.Cmp(u) == 0
}

var quoTests = []struct {
	x, y string
	q, r string
}{
	{

		// Read how many frames are in each stack.
		nFrames, err := binary.ReadUvarint(r)
		if err != nil {
			return err
		}
		if nFrames > go122.MaxFramesPerStack {
			return fmt.Errorf("invalid stack size %d, maximum is %d", nFrames, go122.MaxFramesPerStack)
		}

		// Each frame consists of 4 fields: pc, funcID (string), fileID (string), line.
		frames := make([]uint64, 0, nFrames)
		for i := uint64(0); i < nFrames; i++ {

	pc=5078500 func=35 file=36 line=68
Stack id=13 nframes=1
	pc=5077820 func=35 file=36 line=28
Stack id=65 nframes=2
	pc=4224086 func=57 file=58 line=145
	pc=5080123 func=59 file=36 line=94
Stack id=21 nframes=3
	pc=4640852 func=60 file=61 line=195
	pc=5081128 func=62 file=36 line=125
	pc=5077843 func=35 file=36 line=32
Stack id=11 nframes=1
	pc=5077754 func=35 file=36 line=27
Stack id=10 nframes=1

			return v
		}
		v = v.LogValuer().LogValue()
	}
	err := fmt.Errorf("LogValue called too many times on Value of type %T", orig.Any())
	return AnyValue(err)
}

func stack(skip, nFrames int) string {
	pcs := make([]uintptr, nFrames+1)
	n := runtime.Callers(skip+1, pcs)
	if n == 0 {
		return "(no stack)"
	}
	frames := runtime.CallersFrames(pcs[:n])
	var b strings.Builder
	i := 0
	for {

	}
	if priv.PublicKey.N.Cmp(priv2.PublicKey.N) != 0 ||
		priv.PublicKey.E != priv2.PublicKey.E ||
		priv.D.Cmp(priv2.D) != 0 ||
		len(priv2.Primes) != 3 ||
		priv.Primes[0].Cmp(priv2.Primes[0]) != 0 ||
		priv.Primes[1].Cmp(priv2.Primes[1]) != 0 ||
		priv.Primes[2].Cmp(priv2.Primes[2]) != 0 {
		t.Errorf("got:%+v want:%+v", priv, priv2)
	}
}

func TestMarshalRSAPublicKey(t *testing.T) {
	pub := &rsa.PublicKey{

	pc=4804475 func=32 file=33 line=60
Stack id=14 nframes=1
	pc=4546157 func=24 file=23 line=874
Stack id=17 nframes=1
	pc=0 func=0 file=0 line=0
Stack id=19 nframes=2
	pc=4540420 func=22 file=23 line=353
	pc=4546157 func=24 file=23 line=874
Stack id=13 nframes=1
	pc=0 func=0 file=0 line=0
Stack id=5 nframes=2
	pc=4418893 func=60 file=61 line=402
	pc=4301860 func=62 file=35 line=1297

	k8s.io/utils v0.0.0-20230726121419-3b25d923346b
	sigs.k8s.io/json v0.0.0-20221116044647-bc3834ca7abd
	sigs.k8s.io/structured-merge-diff/v4 v4.4.1
	sigs.k8s.io/yaml v1.4.0
)

require (
	github.com/NYTimes/gziphandler v1.1.1 // indirect
	github.com/antlr4-go/antlr/v4 v4.13.0 // indirect
	github.com/asaskevich/govalidator v0.0.0-20190424111038-f61b66f89f4a // indirect
	github.com/beorn7/perks v1.0.1 // indirect