We improve the known linear lower bound for the number of perfect matchings in cubic bridgeless graphs.