Block #3,505,404

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/8/2020, 2:39:54 PM · Difficulty 10.9304 · 3,328,220 confirmations

TWN
Bi-Twin Chain

Interleaved pairs of primes that differ by 2, forming twin prime pairs at each level.

Block Header
Block Hash
c2d5c199073bd23e747b36f98980f15402b77dcd8c31b881e65b18ec8835fbd4

Height

#3,505,404

Difficulty

10.930441

Transactions

8

Size

51.11 KB

Version

2

Bits

0aee3162

Nonce

643,939,468

Timestamp

1/8/2020, 2:39:54 PM

Confirmations

3,328,220

Merkle Root

cce890e0157d70b95611be7ba976ce0581ce80a2d3901a91bc1800e80e470bb6
Transactions (8)
1 in → 1 out8.9200 XPM110 B
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.28 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.28 KB
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

7.533 × 10⁹⁷(98-digit number)
75339725320734026799…73044932797751674879
Discovered Prime Numbers
Lower: 2^k × origin − 1 | Upper: 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

Level 0 — Twin Prime Pair (origin ± 1)
origin − 1
7.533 × 10⁹⁷(98-digit number)
75339725320734026799…73044932797751674879
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
7.533 × 10⁹⁷(98-digit number)
75339725320734026799…73044932797751674881
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: origin + 1 − origin − 1 = 2 (twin primes ✓)
Level 1 — Twin Prime Pair (2^1 × origin ± 1)
2^1 × origin − 1
1.506 × 10⁹⁸(99-digit number)
15067945064146805359…46089865595503349759
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.506 × 10⁹⁸(99-digit number)
15067945064146805359…46089865595503349761
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^1 × origin + 1 − 2^1 × origin − 1 = 2 (twin primes ✓)
Level 2 — Twin Prime Pair (2^2 × origin ± 1)
2^2 × origin − 1
3.013 × 10⁹⁸(99-digit number)
30135890128293610719…92179731191006699519
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.013 × 10⁹⁸(99-digit number)
30135890128293610719…92179731191006699521
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^2 × origin + 1 − 2^2 × origin − 1 = 2 (twin primes ✓)
Level 3 — Twin Prime Pair (2^3 × origin ± 1)
2^3 × origin − 1
6.027 × 10⁹⁸(99-digit number)
60271780256587221439…84359462382013399039
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.027 × 10⁹⁸(99-digit number)
60271780256587221439…84359462382013399041
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^3 × origin + 1 − 2^3 × origin − 1 = 2 (twin primes ✓)
Level 4 — Twin Prime Pair (2^4 × origin ± 1)
2^4 × origin − 1
1.205 × 10⁹⁹(100-digit number)
12054356051317444287…68718924764026798079
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.205 × 10⁹⁹(100-digit number)
12054356051317444287…68718924764026798081
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Bi-Twin Chain. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the TWN formula:

TWN: twin pairs (p, p+2) where p = origin/primorial − 1 and p+2 = origin/primorial + 1
Circulating Supply:57,913,202 XPM·at block #6,833,623 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy