Block #474,607

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/4/2014, 4:34:13 PM · Difficulty 10.4538 · 6,336,297 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ddf32065b4978b10194b3254e6acc5587aab5b77f092fa8de2f93c9bb3d69216

Height

#474,607

Difficulty

10.453769

Transactions

2

Size

710 B

Version

2

Bits

0a742a36

Nonce

69,758

Timestamp

4/4/2014, 4:34:13 PM

Confirmations

6,336,297

Merkle Root

ed775307b724bafe25a27da91c9136527f7d20a1913dcca7949ee018e13d2c31
Transactions (2)
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.114 × 10⁹⁵(96-digit number)
31148974440501465745…15634118667801703601
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.114 × 10⁹⁵(96-digit number)
31148974440501465745…15634118667801703601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.229 × 10⁹⁵(96-digit number)
62297948881002931491…31268237335603407201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.245 × 10⁹⁶(97-digit number)
12459589776200586298…62536474671206814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.491 × 10⁹⁶(97-digit number)
24919179552401172596…25072949342413628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.983 × 10⁹⁶(97-digit number)
49838359104802345192…50145898684827257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.967 × 10⁹⁶(97-digit number)
99676718209604690385…00291797369654515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.993 × 10⁹⁷(98-digit number)
19935343641920938077…00583594739309030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.987 × 10⁹⁷(98-digit number)
39870687283841876154…01167189478618060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.974 × 10⁹⁷(98-digit number)
79741374567683752308…02334378957236121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.594 × 10⁹⁸(99-digit number)
15948274913536750461…04668757914472243201
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,731,331 XPM·at block #6,810,903 · 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.

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