What is the sup of the cardinalities of the chains in $\mathcal P(X)$, where $X$ is a set?
Here chain means totally ordered set, and $\mathcal P(X)$ is the power set of $X$ (ordered by inclusion).
We can assume that $X$ is infinite, because otherwise the answer is obvious.
We can assume that $X$ is uncountable, because otherwise the answer is given in these posts of Asaf Karagila and Noah Schweber.
Clearly, the sup $s$ in question satisfies $\operatorname{Card}(X)\le s\le2^{\operatorname{Card}(X)}$. (If $X$ is countable we have $s=2^{\operatorname{Card}(X)}$.)