Block #3,506,392

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/9/2020, 7:02:15 AM · Difficulty 10.9306 · 3,336,392 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
3cadafef24dbd70a7ec7877ce70e704e71630a56be08926f3ef4f33c3cecdb23

Height

#3,506,392

Difficulty

10.930557

Transactions

11

Size

72.87 KB

Version

2

Bits

0aee38fb

Nonce

407,904,111

Timestamp

1/9/2020, 7:02:15 AM

Confirmations

3,336,392

Merkle Root

8a5e389eaf4e1730cd6c5e149191a1cbddb0ae956912047e062327ff20889f6d
Transactions (11)
1 in → 1 out9.1600 XPM109 B
50 in → 1 out50.1363 XPM7.27 KB
50 in → 1 out50.1242 XPM7.27 KB
50 in → 1 out50.1320 XPM7.27 KB
50 in → 1 out50.1199 XPM7.26 KB
50 in → 1 out50.1403 XPM7.26 KB
50 in → 1 out50.1513 XPM7.27 KB
50 in → 1 out50.1476 XPM7.27 KB
50 in → 1 out1531.0776 XPM7.27 KB
50 in → 1 out50.1441 XPM7.27 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.

6.585 × 10⁹⁵(96-digit number)
65854125862986929301…22803955318433471359
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
6.585 × 10⁹⁵(96-digit number)
65854125862986929301…22803955318433471359
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
6.585 × 10⁹⁵(96-digit number)
65854125862986929301…22803955318433471361
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.317 × 10⁹⁶(97-digit number)
13170825172597385860…45607910636866942719
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.317 × 10⁹⁶(97-digit number)
13170825172597385860…45607910636866942721
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
2.634 × 10⁹⁶(97-digit number)
26341650345194771720…91215821273733885439
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.634 × 10⁹⁶(97-digit number)
26341650345194771720…91215821273733885441
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
5.268 × 10⁹⁶(97-digit number)
52683300690389543441…82431642547467770879
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
5.268 × 10⁹⁶(97-digit number)
52683300690389543441…82431642547467770881
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.053 × 10⁹⁷(98-digit number)
10536660138077908688…64863285094935541759
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.053 × 10⁹⁷(98-digit number)
10536660138077908688…64863285094935541761
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)
Level 5 — Twin Prime Pair (2^5 × origin ± 1)
2^5 × origin − 1
2.107 × 10⁹⁷(98-digit number)
21073320276155817376…29726570189871083519
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,986,612 XPM·at block #6,842,783 · 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