Block #474,741

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/4/2014, 6:24:34 PM · Difficulty 10.4558 · 6,357,347 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d2694f12e11254af19e03c07ae7bfe611070442562a2e938973fdae275f1b6d0

Height

#474,741

Difficulty

10.455763

Transactions

6

Size

1.23 KB

Version

2

Bits

0a74acdf

Nonce

363,948

Timestamp

4/4/2014, 6:24:34 PM

Confirmations

6,357,347

Merkle Root

b332f52a26df3a0373320cea389f32628af63c68a94b4d9cd7898c1d2c5297d8
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.

3.636 × 10¹⁰⁴(105-digit number)
36367565246642449267…83751773873944560641
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
3.636 × 10¹⁰⁴(105-digit number)
36367565246642449267…83751773873944560641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.273 × 10¹⁰⁴(105-digit number)
72735130493284898535…67503547747889121281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.454 × 10¹⁰⁵(106-digit number)
14547026098656979707…35007095495778242561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.909 × 10¹⁰⁵(106-digit number)
29094052197313959414…70014190991556485121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.818 × 10¹⁰⁵(106-digit number)
58188104394627918828…40028381983112970241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.163 × 10¹⁰⁶(107-digit number)
11637620878925583765…80056763966225940481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.327 × 10¹⁰⁶(107-digit number)
23275241757851167531…60113527932451880961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.655 × 10¹⁰⁶(107-digit number)
46550483515702335062…20227055864903761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.310 × 10¹⁰⁶(107-digit number)
93100967031404670125…40454111729807523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.862 × 10¹⁰⁷(108-digit number)
18620193406280934025…80908223459615047681
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,900,832 XPM·at block #6,832,087 · 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