From 860029ee0e42636d914311e0208832c71c8b7824 Mon Sep 17 00:00:00 2001
From: dmigwi <migwindungu0@gmail.com>
Date: Fri, 18 Aug 2023 12:08:53 +0300
Subject: [PATCH] Delete unused package uniformprng

---
 libwallet/internal/uniformprng/prng.go | 89 --------------------------
 1 file changed, 89 deletions(-)
 delete mode 100644 libwallet/internal/uniformprng/prng.go

diff --git a/libwallet/internal/uniformprng/prng.go b/libwallet/internal/uniformprng/prng.go
deleted file mode 100644
index 0cca7f69b..000000000
--- a/libwallet/internal/uniformprng/prng.go
+++ /dev/null
@@ -1,89 +0,0 @@
-// Package uniformprng implements a uniform, cryptographically secure
-// pseudo-random number generator.
-package uniformprng
-
-import (
-	"encoding/binary"
-	"io"
-	"math/bits"
-
-	"golang.org/x/crypto/chacha20"
-)
-
-// Source returns cryptographically-secure pseudorandom numbers with uniform
-// distribution.
-type Source struct {
-	buf    [8]byte
-	cipher *chacha20.Cipher
-}
-
-var nonce = make([]byte, chacha20.NonceSize)
-
-// NewSource seeds a Source from a 32-byte key.
-func NewSource(seed *[32]byte) *Source {
-	cipher, _ := chacha20.NewUnauthenticatedCipher(seed[:], nonce)
-	return &Source{cipher: cipher}
-}
-
-// RandSource creates a Source with seed randomness read from rand.
-func RandSource(rand io.Reader) (*Source, error) {
-	seed := new([32]byte)
-	_, err := io.ReadFull(rand, seed[:])
-	if err != nil {
-		return nil, err
-	}
-	return NewSource(seed), nil
-}
-
-// Uint32 returns a pseudo-random uint32.
-func (s *Source) Uint32() uint32 {
-	b := s.buf[:4]
-	for i := range b {
-		b[i] = 0
-	}
-	s.cipher.XORKeyStream(b, b)
-	return binary.LittleEndian.Uint32(b)
-}
-
-// Uint32n returns a pseudo-random uint32 in range [0,n) without modulo bias.
-func (s *Source) Uint32n(n uint32) uint32 {
-	if n < 2 {
-		return 0
-	}
-	n--
-	mask := ^uint32(0) >> bits.LeadingZeros32(n)
-	for {
-		u := s.Uint32() & mask
-		if u <= n {
-			return u
-		}
-	}
-}
-
-// Int63 returns a pseudo-random 63-bit positive integer as an int64 without
-// modulo bias.
-func (s *Source) Int63() int64 {
-	b := s.buf[:]
-	for i := range b {
-		b[i] = 0
-	}
-	s.cipher.XORKeyStream(b, b)
-	return int64(binary.LittleEndian.Uint64(b) &^ (1 << 63))
-}
-
-// Int63n returns, as an int64, a pseudo-random 63-bit positive integer in [0,n)
-// without modulo bias.
-// It panics if n <= 0.
-func (s *Source) Int63n(n int64) int64 {
-	if n <= 0 {
-		panic("invalid argument to Int63n")
-	}
-	n--
-	mask := int64(^uint64(0) >> bits.LeadingZeros64(uint64(n)))
-	for {
-		i := s.Int63() & mask
-		if i <= n {
-			return i
-		}
-	}
-}