Lower Bounds and Explicit Constructions Through the Lens of Total Search Problems