We describe a peer-to-peer system similar to Ka­demlia based on the De-Brujin topology with provable consistency and allowing every message exchange to reinforce contact information. Ultimately simple routing tables are achieved by maintaining only two «buckets» of neighbors and providing maximal accuracy of routing tables.