 In February 2014, distributed.net began the search to find optimal Golomb rulers ("OGRs") of order-28.Currently, the complexity of finding OGRs of arbitrary order "n" (where "n" is given in unary) is unknown.In the past there was some speculation that it is an NP-hard problem.