Block #288,345

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 5:00:21 PM · Difficulty 9.9876 · 6,529,574 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7311b7a89a6e22593c6c590cf967e80a29e7254ec70ca190efed72da44ace39f

Height

#288,345

Difficulty

9.987632

Transactions

10

Size

3.87 KB

Version

2

Bits

09fcd57b

Nonce

31,306

Timestamp

12/1/2013, 5:00:21 PM

Confirmations

6,529,574

Merkle Root

3272ff789c04d38497109cf304f12d338631ea21911c4b6c6dc0820a09d2ef98
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.807 × 10⁹⁰(91-digit number)
58071001548181589887…82947878520610828161
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.807 × 10⁹⁰(91-digit number)
58071001548181589887…82947878520610828161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.161 × 10⁹¹(92-digit number)
11614200309636317977…65895757041221656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.322 × 10⁹¹(92-digit number)
23228400619272635955…31791514082443312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.645 × 10⁹¹(92-digit number)
46456801238545271910…63583028164886625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.291 × 10⁹¹(92-digit number)
92913602477090543820…27166056329773250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.858 × 10⁹²(93-digit number)
18582720495418108764…54332112659546501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.716 × 10⁹²(93-digit number)
37165440990836217528…08664225319093002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.433 × 10⁹²(93-digit number)
74330881981672435056…17328450638186004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.486 × 10⁹³(94-digit number)
14866176396334487011…34656901276372008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.973 × 10⁹³(94-digit number)
29732352792668974022…69313802552744017921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.946 × 10⁹³(94-digit number)
59464705585337948045…38627605105488035841
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,787,417 XPM·at block #6,817,918 · 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