Block #500,332

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2014, 2:38:33 AM · Difficulty 10.7988 · 6,308,060 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51b9d0e27f35671088193bfa2f1e06e73e933efc412a86eae1565d11bfb67324

Height

#500,332

Difficulty

10.798836

Transactions

5

Size

15.38 KB

Version

2

Bits

0acc808b

Nonce

6,771,574

Timestamp

4/19/2014, 2:38:33 AM

Confirmations

6,308,060

Merkle Root

f93124aac964d67f273e352d81acad4c048a4854d60242ca26db86daf598df9b
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.621 × 10⁹⁹(100-digit number)
16217300831252066087…97738166642477879039
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.621 × 10⁹⁹(100-digit number)
16217300831252066087…97738166642477879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.243 × 10⁹⁹(100-digit number)
32434601662504132174…95476333284955758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.486 × 10⁹⁹(100-digit number)
64869203325008264348…90952666569911516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.297 × 10¹⁰⁰(101-digit number)
12973840665001652869…81905333139823032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.594 × 10¹⁰⁰(101-digit number)
25947681330003305739…63810666279646064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.189 × 10¹⁰⁰(101-digit number)
51895362660006611478…27621332559292129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.037 × 10¹⁰¹(102-digit number)
10379072532001322295…55242665118584258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.075 × 10¹⁰¹(102-digit number)
20758145064002644591…10485330237168517119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.151 × 10¹⁰¹(102-digit number)
41516290128005289183…20970660474337034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.303 × 10¹⁰¹(102-digit number)
83032580256010578366…41941320948674068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.660 × 10¹⁰²(103-digit number)
16606516051202115673…83882641897348136959
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 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
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 1CC formula:

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