Block #232,114

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/28/2013, 9:42:20 PM · Difficulty 9.9410 · 6,611,011 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3454c4b17a73c2c614e10b3a1c4dab8834bf3b4d1c0db288468533df80ffee46

Height

#232,114

Difficulty

9.940954

Transactions

4

Size

1.55 KB

Version

2

Bits

09f0e264

Nonce

4,481

Timestamp

10/28/2013, 9:42:20 PM

Confirmations

6,611,011

Merkle Root

8a5dbc1d12b705b40d88c6ce3215b32b8cc82ecd9dbecc639de45348aa370695
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.344 × 10⁹⁵(96-digit number)
13443231385202139221…56206974347949767761
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.344 × 10⁹⁵(96-digit number)
13443231385202139221…56206974347949767761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.688 × 10⁹⁵(96-digit number)
26886462770404278442…12413948695899535521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.377 × 10⁹⁵(96-digit number)
53772925540808556884…24827897391799071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.075 × 10⁹⁶(97-digit number)
10754585108161711376…49655794783598142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.150 × 10⁹⁶(97-digit number)
21509170216323422753…99311589567196284161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.301 × 10⁹⁶(97-digit number)
43018340432646845507…98623179134392568321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.603 × 10⁹⁶(97-digit number)
86036680865293691014…97246358268785136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.720 × 10⁹⁷(98-digit number)
17207336173058738202…94492716537570273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.441 × 10⁹⁷(98-digit number)
34414672346117476405…88985433075140546561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.882 × 10⁹⁷(98-digit number)
68829344692234952811…77970866150281093121
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,989,366 XPM·at block #6,843,124 · 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