Recently Landsberg and Ressayre announced an exponential lower bound for permanent's determinantal complexity assuming certain symmetry conditions.
What is the status of the problem of Permanent's determinantal complexity after this proof? What more needs to be done to close the loop? Will the natural proof barrier affect whatever needs to be done? In short what progress does this proof intend to give on this important problem?