This paper introduces a new way to hide a message in a digital image on a spatial domain. In this way two bit messages are embedded in one pixel, which can not only change the most important bit pixel, but also the second bit level and the fourth bit level, but the embedding process at each stage only allows a bit of alternation to occur. This fast and versatile solution achieves cutting-edge results in steganographic applications with linear time and space complexity with respect to Number of cover elements. We report extensive test results for a large number of relative payloads and various distorted profiles, including the wet paper channel. Compared to the LSB-matching method, the results show that they have an acceptable ability to embed this data and that the steganalysis algorithm cannot detect it. Most newer coding schemes used in steganography (matrix embedding, wet paper codes, etc.) can be implemented using this framework.