Block #486,747

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2014, 6:24:40 PM · Difficulty 10.6315 · 6,330,400 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
ee379511c54b0477021a549e4e5b20045afcc1bcb199be99dadb4ed72eac842e

Height

#486,747

Difficulty

10.631505

Transactions

9

Size

1.95 KB

Version

2

Bits

0aa1aa4c

Nonce

2,989,414,561

Timestamp

4/11/2014, 6:24:40 PM

Confirmations

6,330,400

Merkle Root

82476a22ebedee14d34ae6e35d96ab9b9a344050f3f15ce50eb3a0d14bb2d88a
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.263 × 10¹⁰⁹(110-digit number)
22639147811518069599…10971380766175662081
Discovered Prime Numbers
p_k = 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.

1
origin + 1
2.263 × 10¹⁰⁹(110-digit number)
22639147811518069599…10971380766175662081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.527 × 10¹⁰⁹(110-digit number)
45278295623036139198…21942761532351324161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.055 × 10¹⁰⁹(110-digit number)
90556591246072278397…43885523064702648321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.811 × 10¹¹⁰(111-digit number)
18111318249214455679…87771046129405296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.622 × 10¹¹⁰(111-digit number)
36222636498428911359…75542092258810593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.244 × 10¹¹⁰(111-digit number)
72445272996857822718…51084184517621186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.448 × 10¹¹¹(112-digit number)
14489054599371564543…02168369035242373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.897 × 10¹¹¹(112-digit number)
28978109198743129087…04336738070484746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.795 × 10¹¹¹(112-digit number)
57956218397486258174…08673476140969492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.159 × 10¹¹²(113-digit number)
11591243679497251634…17346952281938984961
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,781,212 XPM·at block #6,817,146 · 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