Block #247,516

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/6/2013, 7:51:49 PM · Difficulty 9.9649 · 6,569,408 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4fe2c1cfe3194eb7cd437ee00b3ccab183b73dd5e0d7228dd20203a9be706d14

Height

#247,516

Difficulty

9.964937

Transactions

5

Size

1.69 KB

Version

2

Bits

09f70617

Nonce

17,155

Timestamp

11/6/2013, 7:51:49 PM

Confirmations

6,569,408

Merkle Root

282c40f6fe06c09b5431a5c5ff80b74ee9e50ba8310a969aa71077fa325f960c
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.159 × 10⁹⁶(97-digit number)
11598451277788657384…87685765419479616001
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
1.159 × 10⁹⁶(97-digit number)
11598451277788657384…87685765419479616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.319 × 10⁹⁶(97-digit number)
23196902555577314768…75371530838959232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.639 × 10⁹⁶(97-digit number)
46393805111154629537…50743061677918464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.278 × 10⁹⁶(97-digit number)
92787610222309259075…01486123355836928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.855 × 10⁹⁷(98-digit number)
18557522044461851815…02972246711673856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.711 × 10⁹⁷(98-digit number)
37115044088923703630…05944493423347712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.423 × 10⁹⁷(98-digit number)
74230088177847407260…11888986846695424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.484 × 10⁹⁸(99-digit number)
14846017635569481452…23777973693390848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.969 × 10⁹⁸(99-digit number)
29692035271138962904…47555947386781696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.938 × 10⁹⁸(99-digit number)
59384070542277925808…95111894773563392001
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,779,433 XPM·at block #6,816,923 · 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