Block #229,739

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/27/2013, 9:07:33 AM · Difficulty 9.9386 · 6,586,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
de341f14136e6892d76c8391903b0497f636dc34ce1a8077e7cf34dddd0c18f3

Height

#229,739

Difficulty

9.938644

Transactions

8

Size

2.09 KB

Version

2

Bits

09f04afe

Nonce

81,244

Timestamp

10/27/2013, 9:07:33 AM

Confirmations

6,586,919

Merkle Root

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

5.416 × 10⁹³(94-digit number)
54162580662997506264…86399601208729679361
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
5.416 × 10⁹³(94-digit number)
54162580662997506264…86399601208729679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.083 × 10⁹⁴(95-digit number)
10832516132599501252…72799202417459358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.166 × 10⁹⁴(95-digit number)
21665032265199002505…45598404834918717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.333 × 10⁹⁴(95-digit number)
43330064530398005011…91196809669837434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.666 × 10⁹⁴(95-digit number)
86660129060796010023…82393619339674869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.733 × 10⁹⁵(96-digit number)
17332025812159202004…64787238679349739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.466 × 10⁹⁵(96-digit number)
34664051624318404009…29574477358699479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.932 × 10⁹⁵(96-digit number)
69328103248636808019…59148954717398958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.386 × 10⁹⁶(97-digit number)
13865620649727361603…18297909434797916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.773 × 10⁹⁶(97-digit number)
27731241299454723207…36595818869595832321
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,777,382 XPM·at block #6,816,657 · 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