Block #573,620

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2014, 8:03:29 PM · Difficulty 10.9670 · 6,253,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
ddd584e097727a8082a83a59efa12d44f4e7d46f515869e3cc09220c0dc3b944

Height

#573,620

Difficulty

10.967006

Transactions

5

Size

1.52 KB

Version

2

Bits

0af78dba

Nonce

12,686,146

Timestamp

6/2/2014, 8:03:29 PM

Confirmations

6,253,545

Merkle Root

ea94c62e79d5baebd8cfadd5c46e13ed450d3a631cb39558629932aa5dd84c86
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.

2.331 × 10⁹⁸(99-digit number)
23313966418683753541…64309417149243699839
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
2.331 × 10⁹⁸(99-digit number)
23313966418683753541…64309417149243699839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.662 × 10⁹⁸(99-digit number)
46627932837367507083…28618834298487399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.325 × 10⁹⁸(99-digit number)
93255865674735014166…57237668596974799359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.865 × 10⁹⁹(100-digit number)
18651173134947002833…14475337193949598719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.730 × 10⁹⁹(100-digit number)
37302346269894005666…28950674387899197439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.460 × 10⁹⁹(100-digit number)
74604692539788011333…57901348775798394879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.492 × 10¹⁰⁰(101-digit number)
14920938507957602266…15802697551596789759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.984 × 10¹⁰⁰(101-digit number)
29841877015915204533…31605395103193579519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.968 × 10¹⁰⁰(101-digit number)
59683754031830409066…63210790206387159039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.193 × 10¹⁰¹(102-digit number)
11936750806366081813…26421580412774318079
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,861,415 XPM·at block #6,827,164 · 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