We propose a simple idea for improving the randomized algorithm of Hertli (2014) [2] for the Unique 3SAT problem. Using recently developed techniques (Hertli (2015) [3] and Scheder–Steinberger (2017) [7]), we can derive from this algorithm currently the fastest randomized algorithm for the general 3SAT problem. Though the efficiency improvement is extremely small, we hope that this idea would lead to better improvements.