arXiv:2610.13914v1 Announce Type: new Abstract: We consider the demand-private coded caching problem with heterogeneous file sizes and cache capacities, where each user must recover its requested file without learning any information about the demands of the other users. We first extend the virtual-user reduction technique to accommodate heterogeneous cache sizes, thereby enabling the construction of demand-private coded caching schemes from non-private schemes. Our main contribution is an exact characterization of the memory-rate trade-off for the fundamental setting of two users and two files with arbitrary file sizes and cache capacities. Specifically, we characterize the optimal trade-off through eight linear inequalities and establish achievability by constructing explicit coded caching schemes for the non-trivial corner points, followed by memory sharing. These constructions include novel asymmetric cache placement strategies tailored to heterogeneous file sizes and cache capacities. For the converse, we exploit the distributional equivalences induced by demand privacy to derive information-theoretic lower bounds that explicitly account for the underlying heterogeneity. Our results generalize the exact memory-rate trade-off characterization for the homogeneous demand-private coded caching setting with two users and two files, while quantifying the additional transmission cost imposed by demand privacy compared with the non-private heterogeneous setting.