Block #530,021

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2014, 2:59:27 PM · Difficulty 10.8911 · 6,279,327 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
71ad698fa07aa66848801181c6a7032700445e1f7045ef44521ca48268a51903

Height

#530,021

Difficulty

10.891097

Transactions

3

Size

643 B

Version

2

Bits

0ae41eef

Nonce

101,807

Timestamp

5/7/2014, 2:59:27 PM

Confirmations

6,279,327

Merkle Root

f9200f257f552d5249406edfae475e169b0d366b40652825670db2f002503101
Transactions (3)
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.

4.962 × 10⁹⁵(96-digit number)
49627669577057778902…25990854858732380879
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
4.962 × 10⁹⁵(96-digit number)
49627669577057778902…25990854858732380879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.925 × 10⁹⁵(96-digit number)
99255339154115557804…51981709717464761759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.985 × 10⁹⁶(97-digit number)
19851067830823111560…03963419434929523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.970 × 10⁹⁶(97-digit number)
39702135661646223121…07926838869859047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.940 × 10⁹⁶(97-digit number)
79404271323292446243…15853677739718094079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.588 × 10⁹⁷(98-digit number)
15880854264658489248…31707355479436188159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.176 × 10⁹⁷(98-digit number)
31761708529316978497…63414710958872376319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.352 × 10⁹⁷(98-digit number)
63523417058633956994…26829421917744752639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.270 × 10⁹⁸(99-digit number)
12704683411726791398…53658843835489505279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.540 × 10⁹⁸(99-digit number)
25409366823453582797…07317687670979010559
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,718,850 XPM·at block #6,809,347 · 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