Block #307,784

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 6:45:27 PM · Difficulty 9.9943 · 6,499,796 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cc0918b21f600df0194098e362c75790f0be02bd98d0f55f589cc29e1d5e1ea7

Height

#307,784

Difficulty

9.994284

Transactions

7

Size

2.30 KB

Version

2

Bits

09fe8968

Nonce

5,014

Timestamp

12/12/2013, 6:45:27 PM

Confirmations

6,499,796

Merkle Root

ab1eb24870ee84245546137c24c895b24ef09b1968600e029493960b03b55072
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.745 × 10¹⁰³(104-digit number)
37450001201596580561…29883521062349766401
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.745 × 10¹⁰³(104-digit number)
37450001201596580561…29883521062349766401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.490 × 10¹⁰³(104-digit number)
74900002403193161123…59767042124699532801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.498 × 10¹⁰⁴(105-digit number)
14980000480638632224…19534084249399065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.996 × 10¹⁰⁴(105-digit number)
29960000961277264449…39068168498798131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.992 × 10¹⁰⁴(105-digit number)
59920001922554528898…78136336997596262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.198 × 10¹⁰⁵(106-digit number)
11984000384510905779…56272673995192524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.396 × 10¹⁰⁵(106-digit number)
23968000769021811559…12545347990385049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.793 × 10¹⁰⁵(106-digit number)
47936001538043623119…25090695980770099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.587 × 10¹⁰⁵(106-digit number)
95872003076087246238…50181391961540198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.917 × 10¹⁰⁶(107-digit number)
19174400615217449247…00362783923080396801
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,704,669 XPM·at block #6,807,579 · 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.

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