Block #234,545

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/30/2013, 9:19:29 AM · Difficulty 9.9444 · 6,581,370 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
015f24c5a22de33645df232dc3983158ac535db59919d8d69dc0d6bab37cb8bb

Height

#234,545

Difficulty

9.944404

Transactions

8

Size

4.20 KB

Version

2

Bits

09f1c479

Nonce

27,137

Timestamp

10/30/2013, 9:19:29 AM

Confirmations

6,581,370

Merkle Root

f51afdce95625043dc6a78fe7e8ed7126261d384ee0f5b87b8e331beff204f23
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.685 × 10⁹⁵(96-digit number)
36855463557377958078…67247615167527172721
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.685 × 10⁹⁵(96-digit number)
36855463557377958078…67247615167527172721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.371 × 10⁹⁵(96-digit number)
73710927114755916157…34495230335054345441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.474 × 10⁹⁶(97-digit number)
14742185422951183231…68990460670108690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.948 × 10⁹⁶(97-digit number)
29484370845902366463…37980921340217381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.896 × 10⁹⁶(97-digit number)
58968741691804732926…75961842680434763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.179 × 10⁹⁷(98-digit number)
11793748338360946585…51923685360869527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.358 × 10⁹⁷(98-digit number)
23587496676721893170…03847370721739054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.717 × 10⁹⁷(98-digit number)
47174993353443786340…07694741443478108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.434 × 10⁹⁷(98-digit number)
94349986706887572681…15389482886956216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.886 × 10⁹⁸(99-digit number)
18869997341377514536…30778965773912432641
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,771,430 XPM·at block #6,815,914 · 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