1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
// Copyright (c) 2026 Bitflash developers
// Distributed under the MIT/X11 software license.
//
// Peer discovery over Nostr relays -- replaces the old ThreadIRCSeed. Each
// node publishes a replaceable event (NIP-78, kind 30078) containing its
// "ip:port", signed with Schnorr/secp256k1 (BIP340, the same scheme used by
// Nostr), and subscribes to receive the announcements of other nodes, feeding
// them into the Bitflash address manager.
#ifndef BITFLASH_NOSTR_H
#define BITFLASH_NOSTR_H
#include <string>
#include <vector>
#include <map>
// Thread entry point (signature compatible with _beginthread)
void ThreadNostrSeed(void* parg);
void ThreadBtfPoolAnnouncer(void* parg);
// Set to true to make ThreadBtfPoolAnnouncer publish immediately instead of
// waiting for its ~60s sleep loop (e.g. right after the operator changes pool
// name/fee/dashboard URL in Options). The announcer clears it after publishing.
extern volatile bool gAnnounceNow;
// Public relays used for discovery. Tunable.
extern const char* pszNostrRelays[];
extern const int nNostrRelays;
// Rendezvous meeting relays ("host:port") this node can register its .btf
// service at. It registers at the first reachable one and advertises that in
// its descriptor; if the relay dies it fails over to another, so attacking a
// single relay's IP can't take the network down. Overridable with /rvrelay.
extern std::vector<std::string> vBtfMeetingRelays;
// The relay this node is currently registered at (set by ThreadBtfAccept).
extern std::string strBtfActiveRelay;
// The relay we are registered at, or "" if registration hasn't succeeded yet.
// Never guesses a seed: an unregistered node has no meeting node to advertise.
std::string BtfActiveRelay();
// Record the relay this node just registered its service at (thread-safe).
void BtfSetActiveRelay(const std::string& relay);
// If set (via /announcerelay=host:port), this node announces that relay on
// Nostr so other nodes discover it automatically -- no manual seed-list edit.
extern std::string strBtfAnnounceRelay;
// True when /rvrelay pinned the meeting relay list: BtfAllRelays then returns
// ONLY vBtfMeetingRelays, never Nostr-discovered volunteer relays. Without
// this, a pool that pins one public relay still spawns an accept thread per
// discovered relay, and each thread's optimistic BtfSetActiveRelay makes the
// published descriptor flap to relays the pool may not be reachable at.
extern bool fBtfRelayPinned;
// Basic sanity check on a "host:port" relay address (numeric port 1..65535).
bool LooksLikeRelay(const std::string& r);
// Every relay to try: curated seeds + relays discovered from Nostr announcements.
std::vector<std::string> BtfAllRelays();
struct BtfPoolAnnouncement
{
std::string btfAddress;
std::string poolName;
std::string dashboardUrl;
double feePercent;
int connectedMiners;
int blocksFound;
double hashRate;
int64 createdAt;
BtfPoolAnnouncement()
: feePercent(0.0), connectedMiners(0), blocksFound(0), hashRate(0.0), createdAt(0)
{
}
};
// Number of .btf peers discovered from Nostr relays (includes not-yet-connected).
int GetDiscoveredPeerCount();
// Current live pool announcements discovered from Nostr relays.
void BtfGetPoolAnnouncements(std::vector<BtfPoolAnnouncement>& out);
// Publish a live pool announcement on Nostr.
bool BtfPublishPoolAnnouncement(const BtfPoolAnnouncement& ann);
// Query the latest pool announcement for a specific .btf pool address.
bool BtfQueryPoolAnnouncement(const std::string& poolBtfAddr, BtfPoolAnnouncement& out);
// Copy this node's .btf identity (lazily loading or generating it): the x-only
// pubkey (= the .btf address) and the x25519 secret for the end-to-end channel.
bool BtfGetIdentity(unsigned char pubkey[32], unsigned char enc_sk[32]);
// This node's printable .btf address, or "" if the identity failed to load.
std::string BtfLocalAddress();
// This node's own signed descriptor, ready to hand to a peer over the wire.
// "" until ThreadBtfAccept has registered at a rendezvous.
std::string BtfLocalDescriptor();
// The shared secp256k1 context, for btf::VerifyDescriptor (which takes it as
// void* to keep headers free of secp). NULL if the identity failed to load.
void* BtfSecpContext();
// Resolve a .btf address via the public discovery relays: fetch the owner's
// self-certified descriptor and return its meeting node ("host:port") and
// x25519 public key for the end-to-end channel.
bool BtfResolve(const std::string& btfAddr, std::string& meetingHostPort,
unsigned char enc_pub[32]);
// Result of resolving one .btf address via BtfResolveMany.
struct BtfResolvedPeer
{
std::string meetingHostPort;
unsigned char enc_pub[32];
};
// Resolve many .btf addresses at once. Batches all still-unresolved addresses
// into a single Nostr REQ per relay (multiple "authors"), instead of opening
// one relay connection per address like BtfResolve does. Use this whenever
// resolving more than a handful of addresses in the same pass -- e.g. before
// dialing several discovered peers in parallel -- to avoid hammering the
// same few public relays with a burst of simultaneous connections. Returns
// true if at least one address resolved; check `out` for which ones.
bool BtfResolveMany(const std::vector<std::string>& btfAddrs,
std::map<std::string, BtfResolvedPeer>& out);
#endif
|