Block #3,506,397

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/9/2020, 7:11:46 AM · Difficulty 10.9305 · 3,308,581 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
a6e19ab94975413d8c75c5b8026e5fdd3789ff563fea03bef273209a9dacc563

Height

#3,506,397

Difficulty

10.930503

Transactions

11

Size

72.87 KB

Version

2

Bits

0aee3570

Nonce

48,046,087

Timestamp

1/9/2020, 7:11:46 AM

Confirmations

3,308,581

Merkle Root

f9513bb0daf6d8bb6f01349f8320ccbffceacd26f1a6672b13b86a6c545db70f
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out3584.2896 XPM7.26 KB
50 in → 1 out50.0456 XPM7.26 KB
50 in → 1 out50.0323 XPM7.27 KB
50 in → 1 out50.0419 XPM7.27 KB
50 in → 1 out50.0288 XPM7.27 KB
50 in → 1 out50.0228 XPM7.27 KB
50 in → 1 out50.0193 XPM7.27 KB
50 in → 1 out50.0388 XPM7.27 KB
50 in → 1 out50.0356 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.

1.449 × 10⁹⁶(97-digit number)
14492046968960903068…55506074291786480639
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
1.449 × 10⁹⁶(97-digit number)
14492046968960903068…55506074291786480639
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.449 × 10⁹⁶(97-digit number)
14492046968960903068…55506074291786480641
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
2.898 × 10⁹⁶(97-digit number)
28984093937921806137…11012148583572961279
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.898 × 10⁹⁶(97-digit number)
28984093937921806137…11012148583572961281
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
5.796 × 10⁹⁶(97-digit number)
57968187875843612275…22024297167145922559
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
5.796 × 10⁹⁶(97-digit number)
57968187875843612275…22024297167145922561
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
1.159 × 10⁹⁷(98-digit number)
11593637575168722455…44048594334291845119
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.159 × 10⁹⁷(98-digit number)
11593637575168722455…44048594334291845121
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
2.318 × 10⁹⁷(98-digit number)
23187275150337444910…88097188668583690239
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.318 × 10⁹⁷(98-digit number)
23187275150337444910…88097188668583690241
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
4.637 × 10⁹⁷(98-digit number)
46374550300674889820…76194377337167380479
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,763,911 XPM·at block #6,814,977 · 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