Block #541,845

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/13/2014, 4:42:21 PM · Difficulty 10.9412 · 6,263,845 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
1d0278d921bdfc78783c933a1784bce3cc9026bb3033a7bcbdf801ba60ed689e

Height

#541,845

Difficulty

10.941216

Transactions

10

Size

2.41 KB

Version

2

Bits

0af0f384

Nonce

110,519,522

Timestamp

5/13/2014, 4:42:21 PM

Confirmations

6,263,845

Merkle Root

1c211680a90cd460e49782bcd88eeac2f967eb22a267b83774d25033a90df9b2
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.533 × 10¹⁰²(103-digit number)
15338746996486767224…79897195315700367359
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.533 × 10¹⁰²(103-digit number)
15338746996486767224…79897195315700367359
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.533 × 10¹⁰²(103-digit number)
15338746996486767224…79897195315700367361
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
3.067 × 10¹⁰²(103-digit number)
30677493992973534449…59794390631400734719
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
3.067 × 10¹⁰²(103-digit number)
30677493992973534449…59794390631400734721
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
6.135 × 10¹⁰²(103-digit number)
61354987985947068899…19588781262801469439
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
6.135 × 10¹⁰²(103-digit number)
61354987985947068899…19588781262801469441
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.227 × 10¹⁰³(104-digit number)
12270997597189413779…39177562525602938879
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.227 × 10¹⁰³(104-digit number)
12270997597189413779…39177562525602938881
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.454 × 10¹⁰³(104-digit number)
24541995194378827559…78355125051205877759
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.454 × 10¹⁰³(104-digit number)
24541995194378827559…78355125051205877761
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.908 × 10¹⁰³(104-digit number)
49083990388757655119…56710250102411755519
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,689,602 XPM·at block #6,805,689 · 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.