Over three decades ago an algebraic factoring algorithm was created as part of active logic synthesis efforts in the semiconductor industry. It initiated logic synthesis successes and steered synthesis in the direction of practical design tools: they can now take a design from its initial state to the final chip that meets a complex set of constraints. The evolved computing platforms today stimulate new exploratory avenues to extend the functionality of fundamental synthesis algorithms. We reexamine logic factoring in an effort to establish a stronger connection to the functional intent rather than structural implications of a design description within synthesis. A scalable factoring algorithm that reduces its dependence on the two-level minimization is described to improve the area of synthesized circuits. It is implemented using a new distributed environment that harnesses the key-value concept to find solutions through systematic transformations of a data set.