Block #544,030

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2014, 4:46:46 PM · Difficulty 10.9493 · 6,282,545 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e209154f6a663b151a68c65ee8e400819af2372ba0dc5d8536a702caae21fe5

Height

#544,030

Difficulty

10.949321

Transactions

5

Size

1.52 KB

Version

2

Bits

0af306ad

Nonce

856,793,587

Timestamp

5/14/2014, 4:46:46 PM

Confirmations

6,282,545

Merkle Root

d23d1dd41ddeac0ba5969c12222ad5c1c28d1dbba401addd16b1ac2858162ee7
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.141 × 10⁹⁸(99-digit number)
31411289913965454393…32131222905229843999
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.141 × 10⁹⁸(99-digit number)
31411289913965454393…32131222905229843999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.282 × 10⁹⁸(99-digit number)
62822579827930908787…64262445810459687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.256 × 10⁹⁹(100-digit number)
12564515965586181757…28524891620919375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.512 × 10⁹⁹(100-digit number)
25129031931172363515…57049783241838751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.025 × 10⁹⁹(100-digit number)
50258063862344727030…14099566483677503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.005 × 10¹⁰⁰(101-digit number)
10051612772468945406…28199132967355007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.010 × 10¹⁰⁰(101-digit number)
20103225544937890812…56398265934710015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.020 × 10¹⁰⁰(101-digit number)
40206451089875781624…12796531869420031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.041 × 10¹⁰⁰(101-digit number)
80412902179751563248…25593063738840063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.608 × 10¹⁰¹(102-digit number)
16082580435950312649…51186127477680127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.216 × 10¹⁰¹(102-digit number)
32165160871900625299…02372254955360255999
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,856,749 XPM·at block #6,826,574 · 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