In the framework of holographic principle, bit threads are unoriented bulk curves which end on the boundary and subject to the rule that the thread density is less than \(1/4{G_N}\)  everywhere [1]}, [2]}, [3]}. When one takes the Hodge dual of bit threads one gets calibrated geometries, which mathematicians (geometers) use to identify minimal surfaces. This is a viewpoint adopted in [4]}. Mathematically, this thread density bound implies that the number of threads passing through the minimal surface \(\gamma \left( A \right)\)  that separates a boundary subregion \(A\)  and its complement \({{A_{\rm {c}}}}\)  cannot exceed its area \(Area\left( {\gamma \left( A \right)} \right)\) , hence the flux of bit threads \(Flux\left( A \right)\)  connecting \(A\)  and its complement \({{A_{\rm {c}}}}\)  does not exceed \(Area\left( {\gamma \left( A \right)} \right)\) :
\( Flux\left( A \right) \le \frac{1}{{4{G_N}}} \cdot Area\left( {\gamma \left( A \right)} \right).\) 
