Block #543,239

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2014, 7:42:07 AM · Difficulty 10.9467 · 6,269,596 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c28e487e3d04b2ce618bf3e955cfdcab67a38f1ad127b771d0591a0858a87d87

Height

#543,239

Difficulty

10.946749

Transactions

1

Size

869 B

Version

2

Bits

0af25e23

Nonce

64,617

Timestamp

5/14/2014, 7:42:07 AM

Confirmations

6,269,596

Merkle Root

4367b6a9df5a3499028fd31a71ee5f46e22624076a66d745702cd0ca96c1ebee
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.343 × 10⁹⁸(99-digit number)
33433975099837151308…11428653456310019839
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.343 × 10⁹⁸(99-digit number)
33433975099837151308…11428653456310019839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.686 × 10⁹⁸(99-digit number)
66867950199674302616…22857306912620039679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.337 × 10⁹⁹(100-digit number)
13373590039934860523…45714613825240079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.674 × 10⁹⁹(100-digit number)
26747180079869721046…91429227650480158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.349 × 10⁹⁹(100-digit number)
53494360159739442092…82858455300960317439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.069 × 10¹⁰⁰(101-digit number)
10698872031947888418…65716910601920634879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.139 × 10¹⁰⁰(101-digit number)
21397744063895776837…31433821203841269759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.279 × 10¹⁰⁰(101-digit number)
42795488127791553674…62867642407682539519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.559 × 10¹⁰⁰(101-digit number)
85590976255583107348…25735284815365079039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.711 × 10¹⁰¹(102-digit number)
17118195251116621469…51470569630730158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.423 × 10¹⁰¹(102-digit number)
34236390502233242939…02941139261460316159
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,746,725 XPM·at block #6,812,834 · 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