In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed time stamp server to generate computational proof of the chronological order of transactions.
Eka phepha leri, hi ringanyeta leswaku xintshuxo xa xiphiqo xo hakela hi ka mbirhi hi ku tirhisa netiweke ya tintangha yi hangalasiwa eka sevha ya timestamp ku endlela ku endla vumbhoni bya khomphyuta bya ndlela yo landzelelana ka tithiranzekixini.