Block #3,506,378

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/9/2020, 6:48:37 AM · Difficulty 10.9306 · 3,310,728 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
9d17185ef613307d42d51fca1a215110352ccd6899bd411521edfa144cf98c2d

Height

#3,506,378

Difficulty

10.930555

Transactions

11

Size

72.91 KB

Version

2

Bits

0aee38d5

Nonce

1,533,020,454

Timestamp

1/9/2020, 6:48:37 AM

Confirmations

3,310,728

Merkle Root

1f43c07d16442513d7e72ae67e358769ca62da6ea4330cb60debef243d3b4265
Transactions (11)
1 in → 1 out9.1600 XPM109 B
50 in → 1 out50.3403 XPM7.28 KB
50 in → 1 out50.3161 XPM7.27 KB
50 in → 1 out50.3502 XPM7.27 KB
50 in → 1 out50.3587 XPM7.28 KB
50 in → 1 out50.3353 XPM7.27 KB
50 in → 1 out50.3303 XPM7.27 KB
50 in → 1 out50.3260 XPM7.27 KB
50 in → 1 out50.3211 XPM7.27 KB
50 in → 1 out50.3455 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.

9.133 × 10⁹⁵(96-digit number)
91333247140732852578…92670624480756994559
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
9.133 × 10⁹⁵(96-digit number)
91333247140732852578…92670624480756994559
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
9.133 × 10⁹⁵(96-digit number)
91333247140732852578…92670624480756994561
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.826 × 10⁹⁶(97-digit number)
18266649428146570515…85341248961513989119
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.826 × 10⁹⁶(97-digit number)
18266649428146570515…85341248961513989121
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.653 × 10⁹⁶(97-digit number)
36533298856293141031…70682497923027978239
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.653 × 10⁹⁶(97-digit number)
36533298856293141031…70682497923027978241
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
7.306 × 10⁹⁶(97-digit number)
73066597712586282063…41364995846055956479
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
7.306 × 10⁹⁶(97-digit number)
73066597712586282063…41364995846055956481
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.461 × 10⁹⁷(98-digit number)
14613319542517256412…82729991692111912959
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.461 × 10⁹⁷(98-digit number)
14613319542517256412…82729991692111912961
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.922 × 10⁹⁷(98-digit number)
29226639085034512825…65459983384223825919
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,780,887 XPM·at block #6,817,105 · 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