Error bound during multiplication and addition operation operation

[ayushmohod]

There is an error bound in SEAL, as with each multiplication, the error increases. Eventually, there comes a point where the error exceeds a certain threshold, resulting in incorrect decryption. I would like to know about the limits of operations that SEAL can perform for each polynomial degree, such that the error stays within the bound required for correct decryption. Specifically, I am interested in understanding the limit of multiplication and addition operations that SEAL can handle without exceeding the error bound. Additionally, I would like to know how this error bound is calculated and the parameters upon which it depends.