Block #462,907

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 3/27/2014, 6:01:19 PM · Difficulty 10.4167 · 6,329,497 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
92c3a6e61f3ae82c9f89a15642abda3b261e0febe9f5d2e54dc7e2731ec5f14c

Height

#462,907

Difficulty

10.416662

Transactions

9

Size

1.96 KB

Version

2

Bits

0a6aaa5c

Nonce

58,941

Timestamp

3/27/2014, 6:01:19 PM

Confirmations

6,329,497

Merkle Root

477ffb03bb622cfe68ec5d4c320e4bb7449b44e981003ff79c017fda3c7b54dc
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.

2.353 × 10⁹⁹(100-digit number)
23532653406569223966…60906026343946495999
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
2.353 × 10⁹⁹(100-digit number)
23532653406569223966…60906026343946495999
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.353 × 10⁹⁹(100-digit number)
23532653406569223966…60906026343946496001
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
4.706 × 10⁹⁹(100-digit number)
47065306813138447932…21812052687892991999
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
4.706 × 10⁹⁹(100-digit number)
47065306813138447932…21812052687892992001
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
9.413 × 10⁹⁹(100-digit number)
94130613626276895864…43624105375785983999
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
9.413 × 10⁹⁹(100-digit number)
94130613626276895864…43624105375785984001
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.882 × 10¹⁰⁰(101-digit number)
18826122725255379172…87248210751571967999
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.882 × 10¹⁰⁰(101-digit number)
18826122725255379172…87248210751571968001
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
3.765 × 10¹⁰⁰(101-digit number)
37652245450510758345…74496421503143935999
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
3.765 × 10¹⁰⁰(101-digit number)
37652245450510758345…74496421503143936001
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
7.530 × 10¹⁰⁰(101-digit number)
75304490901021516691…48992843006287871999
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,583,192 XPM·at block #6,792,403 · 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.