We model our triples algorithm based on a combination of features from DLPNO-CCSD(T) in ORCA and PNO-LCCSD(T) in Molpro, in order to optimize speed and accuracy. First, we use the triples prescreening algorithm as presented by Ma and Werner. We first compute the semicanonincal (T0) energy for each possible triplet ijk, derived from combinations of pairs ij, jk, and ik, at least one of which is a strong pair, at a weaker TNO tolerance (T CUT TNO PRE ). All triplets ijk for which the absolute value of the energy is lower than (T CUT TRIPLES PRE ) are screened out and not further considered, but the sum of their energy contributions is saved and accounted for. We will term these triplets that did not survive the prescreening as the "screened triplets." The rest of the algorithm is derived from the work of Neese and coworkers, where the TNOs of the surviving triplets are then recomputed at a tighter tolerance (T CU T T N O ), in order to obtain a more accurate semi-canonical (T0) energy. The TNOs are then recomputed at a looser tolerance for the iterative (T) step to reduce the cost of storing triples amplitudes and intermediates. To this end, the energies of the triplets are sorted and the approximately 20% of triplets that account for at least 90% of the semi-canonical (T0) energy are deemed "strong triplets," and the rest deemed "weak triplets," For the "strong triplets," the TNOs are recomputed at a looser tolerance T CUT TNO • T STRONG SCALE and the "weak triplets" at T CUT TNO • T WEAK SCALE for the full iterative (T) algorithm. The final (T) energy is as follows: