how to understand the precomputes of Miller Loop in noble-bls12-381?

[xichan-ms]

Miller Loop is a basic but important algorithm to calculate pairing.

noble-bls12-381 is a clean and independent implementation of bls12-381 pairing without library dependency.

I know the original Miller Loop algorithm, but in above implementation, there exist a tricky pairingPrecomputes, is there any material or description about this pre-computing? thanks a lot

https://github.com/paulmillr/noble-bls12-381/blob/main/index.ts#L395

[xichan-ms]

also open issue in noble-bls12-381

paulmillr/noble-bls12-381#61