It was the Bitcointalk forum that inspired us to create Bitcointalksearch.org - Bitcointalk is an excellent site that should be the default page for anybody dealing in cryptocurrency, since it is a virtual gold-mine of data. However, our experience and user feedback led us create our site; Bitcointalk's search is slow, and difficult to get the results you need, because you need to log in first to find anything useful - furthermore, there are rate limiters for their search functionality.
The aim of our project is to create a faster website that yields more results and faster without having to create an account and eliminate the need to log in - your personal data, therefore, will never be in jeopardy since we are not asking for any of your data and you don't need to provide them to use our site with all of its capabilities.
We created this website with the sole purpose of users being able to search quickly and efficiently in the field of cryptocurrency so they will have access to the latest and most accurate information and thereby assisting the crypto-community at large.
With master public key:
┌───────────┐ m/84'/0'/0'/0/0 ┌────────────┐ bc1q8g4...fjyjy ┌────────────┐
│ Home node │◄───────────────────►│ Server │◄──────────────────────►│ Visitor #1 │
└───────────┘ └────────────┘ └────────────┘
┌───────────┐ m/84'/0'/0'/0/1 ┌────────────┐ bc1qeud...ccr6f ┌────────────┐
│ Home node │◄───────────────────►│ Server │◄──────────────────────►│ Visitor #2 │
└───────────┘ └────────────┘ └────────────┘
┌───────────┐ m/84'/0'/0'/0/2 ┌────────────┐ bc1qwzx...2dxz7 ┌────────────┐
│ Home node │◄───────────────────►│ Server │◄──────────────────────►│ Visitor #3 │
└───────────┘ └────────────┘ └────────────┘
Et cetera.
With master public key:
┌───────────┐ m/84'/0'/0'/0/0 ┌────────────┐ bc1q8g4...fjyjy ┌────────────┐
│ Home node │◄───────────────────►│ Server │◄──────────────────────►│ Visitor #1 │
└───────────┘ └────────────┘ └────────────┘
┌───────────┐ m/84'/0'/0'/0/1 ┌────────────┐ bc1qeud...ccr6f ┌────────────┐
│ Home node │◄───────────────────►│ Server │◄──────────────────────►│ Visitor #2 │
└───────────┘ └────────────┘ └────────────┘
┌───────────┐ m/84'/0'/0'/0/2 ┌────────────┐ bc1qwzx...2dxz7 ┌────────────┐
│ Home node │◄───────────────────►│ Server │◄──────────────────────►│ Visitor #3 │
└───────────┘ └────────────┘ └────────────┘
Et cetera.
┌────────────┐ 03aae...ccdf7 ┌───────────────────┐
┌──────►│ Visitor #3 ├──────────────────────►│ Construct Address │
With silent payments: │ └────────────┘ └───────────────────┘
│
│
┌────────┐ 02efa...e4da1 │ ┌────────────┐ 03da2...64a2d ┌───────────────────┐
│ Server ├───────────────────────────┼──────►│ Visitor #2 ├──────────────────────►│ Construct Address │
└───┬────┘ │ └────────────┘ └───────────────────┘
│ │
│ │
│ │ ┌────────────┐ 02d80...239e1 ┌───────────────────┐
│ └──────►│ Visitor #3 ├──────────────────────►│ Construct Address │
│ └────────────┘ └───────────────────┘
│
┌────────┴─────────┐
│ Scans the chain │
└──────────────────┘
struct Pair {
PublicKey P;
PrivateKey p;
};
bool FindSilentKey(std::vectorAA, std::vector Keys, PublicKey C, PublicKey& RetP, Pair& RetPair) {
// Pseudo C++ for checking if public key `C` combines with any of the wallet public keys `Keys` to create a key that is in the set of silent keys `AA`.
// Returns true if found and sets `RetP` and `RetPair`, else returns false.
// An efficient implementation that uses thousands of silent keys should use a bloom filter instead of a vector.
for (auto K: Keys) {
// This nested loop can be replaced with bloom filter check
for (auto A: AA) {
uint64_t cof = Hash(K.p * C) + K.p;
if (cof * G == A) {
RetP = A;
RetPair = K;
return true;
}
}
}
RetP = nullptr;
RetPair = nullptr;
return false;
}