Assume that we have an unbounded fan-in circuit family of depth $d(n)$ and $poly(n)$ size.

What is the best depth (in $d(n)$ and $n$) $poly(n)$ size bounded fan-in circuit family that can be obtained for it?

In particular what is the largest depth $d(n)$ for which we know poly size unbounded fan-in circuit families of depth $d(n)$ are in $\mathsf{NC^1}$?

Assume that we have an unbounded fan-in circuit family of depth $d(n)$ and size $s(n)$.

What is the smallest depth (in terms of $d(n)$ and $n$ and $s(n)$) bounded fan-in circuit family of size $poly(s)$ for it?

In particular what is the largest depth $d(n)$ for which we know polynomial size unbounded fan-in circuit families of depth $d(n)$ are in $\mathsf{NC^1}$?

Assume that we have an unbounded fan-in circuit family of depth $d(n)$ and $poly(n)$ size.

What is the best depth (in $d(n)$ and $n$) $poly(n)$ size bounded fan-in circuit family that can be obtained for it?

Assume that we have an unbounded fan-in circuit family of depth $d(n)$ and $poly(n)$ size.

What is the best depth (in $d(n)$ and $n$) $poly(n)$ size bounded fan-in circuit family that can be obtained for it?

In particular what is the largest depth $d(n)$ for which we know poly size unbounded fan-in circuit families of depth $d(n)$ are in $\mathsf{NC^1}$?

Assume that we have an unbounded fan-in circuit of depth $d$ and poly size. What is the best depth poly size bounded fan-in circuit that can be obtained for it?

Assume that we have an unbounded fan-in circuit family of depth $d(n)$ and $poly(n)$ size. 

What is the best depth (in $d(n)$ and $n$) $poly(n)$ size bounded fan-in circuit family that can be obtained for it?