New congruences modulo 2, 4, and 8 for the number of tagged parts over the partitions with designated summands

Recently, Lin introduced two new partition functions PDt(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {PD}_{\mathrm{t}}(n)$$\end{document} and PDOt(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {PDO}_{\mathrm{t}}(n)$$\end{document}, which count the total number of tagged parts over all partitions of n with designated summands and the total number of tagged parts over all partitions of n with designated summands in which all parts are odd. Lin also proved some congruences modulo 3 and 9 for PDt(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {PD}_{\mathrm{t}}(n)$$\end{document} and PDOt(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {PDO}_{\mathrm{t}}(n)$$\end{document}, and conjectured some congruences modulo 8. In this paper, we prove the congruences modulo 8 conjectured by Lin and also find many new congruences and infinite families of congruences modulo some small powers of 2.