Elimination of redundant data has become a critical concern in the design of storage architectures. Content addressable storage engines eliminate data at the block level by mapping data blocks with the same content to the same physical storage location. Intelligent object partitioning techniques leverage block level content addressing in order to improve duplicate elimination. In this paper, we propose a novel object partitioning technique -fingerdiff that is designed to improve storage consumption of existing object partitioning techniques while at the same time reducing associated costs. We present a detailed evaluation of fingerdiff and other existing object partitioning schemes, and we show that fingerdiff meets its design goals as it improves the effectiveness of block level duplicate elimination while reducing overhead costs.