We show that the largest density of factor of i.i.d. independent sets in the d-regular tree is asymptotically at most (logd)/d as d → ∞. This matches the lower bound given by previous constructions.