Is there a relation between BBH (black box hypothesis) and SETH (strong exponential time hypothesis)? Is there a relation between  BBH (black box hypothesis) and SETH (strong exponential time hypothesis)?
Adding to Sasha's answer. Roughly speaking, BBH posits that every property of functions that is hard to decide with only query access to the function (black box access) is also hard to decide when you're given a circuit for the function.

The paper:

https://eccc.weizmann.ac.il/report/2017/109/

shows that certain counterexamples to BBH would refute a non-uniform version of ETH (Circuit SAT has $2^{o(n)}$ size circuits). They conjecture something like that "non-uniform ETH for Circuit SAT &lt;=> BBH is true".

Note in the other direction, if SETH is false for circuits, this would refute some version of BBH: we cannot possibly solve SAT for black boxes in $o(2^n)$ time.