Block #534,234

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2014, 4:50:35 AM · Difficulty 10.9016 · 6,278,509 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c209ebbd6e036669a24212a65d2fd77ef55473ed79af9ff62bd4435ac3af793

Height

#534,234

Difficulty

10.901584

Transactions

6

Size

2.17 KB

Version

2

Bits

0ae6ce36

Nonce

41,712,889

Timestamp

5/10/2014, 4:50:35 AM

Confirmations

6,278,509

Merkle Root

6b7b3784ede28566c290dc1876bb0d29e56a9bc64692271d6c3ba6aa141b4620
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.099 × 10⁹⁸(99-digit number)
50996096084663945530…12683616650793432199
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.099 × 10⁹⁸(99-digit number)
50996096084663945530…12683616650793432199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.019 × 10⁹⁹(100-digit number)
10199219216932789106…25367233301586864399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.039 × 10⁹⁹(100-digit number)
20398438433865578212…50734466603173728799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.079 × 10⁹⁹(100-digit number)
40796876867731156424…01468933206347457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.159 × 10⁹⁹(100-digit number)
81593753735462312848…02937866412694915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.631 × 10¹⁰⁰(101-digit number)
16318750747092462569…05875732825389830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.263 × 10¹⁰⁰(101-digit number)
32637501494184925139…11751465650779660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.527 × 10¹⁰⁰(101-digit number)
65275002988369850278…23502931301559321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.305 × 10¹⁰¹(102-digit number)
13055000597673970055…47005862603118643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.611 × 10¹⁰¹(102-digit number)
26110001195347940111…94011725206237286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.222 × 10¹⁰¹(102-digit number)
52220002390695880222…88023450412474572799
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,745,987 XPM·at block #6,812,742 · 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