Block #302,656

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 10:45:51 PM · Difficulty 9.9928 · 6,524,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e2820ee505d08da85fc6ebe115663df38bf251a02fb4fc0a619840989e07bcc

Height

#302,656

Difficulty

9.992774

Transactions

10

Size

2.76 KB

Version

2

Bits

09fe2673

Nonce

99,880

Timestamp

12/9/2013, 10:45:51 PM

Confirmations

6,524,248

Merkle Root

409b6b57aba49f9a579b171d2e772e4c8ee1f524bf189f0b0fde625e4a71cce2
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.167 × 10⁹⁷(98-digit number)
11676492989533083225…78733108289461120001
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.167 × 10⁹⁷(98-digit number)
11676492989533083225…78733108289461120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.335 × 10⁹⁷(98-digit number)
23352985979066166451…57466216578922240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.670 × 10⁹⁷(98-digit number)
46705971958132332903…14932433157844480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.341 × 10⁹⁷(98-digit number)
93411943916264665807…29864866315688960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.868 × 10⁹⁸(99-digit number)
18682388783252933161…59729732631377920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.736 × 10⁹⁸(99-digit number)
37364777566505866322…19459465262755840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.472 × 10⁹⁸(99-digit number)
74729555133011732645…38918930525511680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.494 × 10⁹⁹(100-digit number)
14945911026602346529…77837861051023360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.989 × 10⁹⁹(100-digit number)
29891822053204693058…55675722102046720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.978 × 10⁹⁹(100-digit number)
59783644106409386116…11351444204093440001
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,859,399 XPM·at block #6,826,903 · 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