Remark 3.2 As pointed out earlier, it is not required to explicitly find a sequential betting strategy that achieves the wealth process to construct a confidence sequence.
We remark, however, that the so-called Krichevsky–Trofimov (KT) strategy [1]} defined as \(b_t(c^{t-1})=(\sum _{i=1}^{t-1}c_i+\frac{1}{2})/(t+1)\)  achieves the wealth lower bound, for any \(o_1,o_2>0\) .
blackIt can be readily verified based on the argument of Theorem REF , but we explicitly explain the special case
in Appendix  for completeness.

