Block #308,659

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 5:20:21 AM · Difficulty 9.9946 · 6,505,244 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c9fc0f77a898ecd7a36e52429b138cf42ad49e92b2f348c330dee6a7d9a369e

Height

#308,659

Difficulty

9.994579

Transactions

1

Size

1.18 KB

Version

2

Bits

09fe9cbd

Nonce

11,372

Timestamp

12/13/2013, 5:20:21 AM

Confirmations

6,505,244

Merkle Root

283251e294e866560e0bf21381d4fc203ec4189b5d6f76a3a1a7f745f80a758b
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.567 × 10¹⁰⁰(101-digit number)
35672921587808140875…41156285443325285119
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.567 × 10¹⁰⁰(101-digit number)
35672921587808140875…41156285443325285119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.134 × 10¹⁰⁰(101-digit number)
71345843175616281751…82312570886650570239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.426 × 10¹⁰¹(102-digit number)
14269168635123256350…64625141773301140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.853 × 10¹⁰¹(102-digit number)
28538337270246512700…29250283546602280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.707 × 10¹⁰¹(102-digit number)
57076674540493025401…58500567093204561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.141 × 10¹⁰²(103-digit number)
11415334908098605080…17001134186409123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.283 × 10¹⁰²(103-digit number)
22830669816197210160…34002268372818247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.566 × 10¹⁰²(103-digit number)
45661339632394420320…68004536745636495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.132 × 10¹⁰²(103-digit number)
91322679264788840641…36009073491272990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.826 × 10¹⁰³(104-digit number)
18264535852957768128…72018146982545981439
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,755,303 XPM·at block #6,813,902 · 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