Block #520,017

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2014, 2:36:25 PM · Difficulty 10.8574 · 6,289,635 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf730fc3e6ab1a402252c22448a0ea7e0fc9024337905e929a8549bceccc25ae

Height

#520,017

Difficulty

10.857438

Transactions

2

Size

432 B

Version

2

Bits

0adb8114

Nonce

35,738,702

Timestamp

5/1/2014, 2:36:25 PM

Confirmations

6,289,635

Merkle Root

1cfcc54aa32e682cde43ae4b68fcc2bbb87ed74bdcd2e9b104e26ec6b904038e
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.309 × 10⁹⁸(99-digit number)
13096616331610040272…04676848008653107639
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.309 × 10⁹⁸(99-digit number)
13096616331610040272…04676848008653107639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.619 × 10⁹⁸(99-digit number)
26193232663220080544…09353696017306215279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.238 × 10⁹⁸(99-digit number)
52386465326440161089…18707392034612430559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.047 × 10⁹⁹(100-digit number)
10477293065288032217…37414784069224861119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.095 × 10⁹⁹(100-digit number)
20954586130576064435…74829568138449722239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.190 × 10⁹⁹(100-digit number)
41909172261152128871…49659136276899444479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.381 × 10⁹⁹(100-digit number)
83818344522304257743…99318272553798888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.676 × 10¹⁰⁰(101-digit number)
16763668904460851548…98636545107597777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.352 × 10¹⁰⁰(101-digit number)
33527337808921703097…97273090215195555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.705 × 10¹⁰⁰(101-digit number)
67054675617843406194…94546180430391111679
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,721,297 XPM·at block #6,809,651 · 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