Block #524,420

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2014, 4:31:23 AM · Difficulty 10.8758 · 6,302,001 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e4ae920c456d4c57cce83bd1fb8e11ad6c9cd68fdd8f25997898f5db96eb59b

Height

#524,420

Difficulty

10.875755

Transactions

7

Size

1.67 KB

Version

2

Bits

0ae03183

Nonce

186,664,642

Timestamp

5/4/2014, 4:31:23 AM

Confirmations

6,302,001

Merkle Root

354edee563008e4e1d6a7e826fa919e52e90ff1dfd57175a89827d725f73cda3
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.079 × 10⁹⁹(100-digit number)
30791827279359329468…45245344254219607999
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.079 × 10⁹⁹(100-digit number)
30791827279359329468…45245344254219607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.158 × 10⁹⁹(100-digit number)
61583654558718658937…90490688508439215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.231 × 10¹⁰⁰(101-digit number)
12316730911743731787…80981377016878431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.463 × 10¹⁰⁰(101-digit number)
24633461823487463574…61962754033756863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.926 × 10¹⁰⁰(101-digit number)
49266923646974927149…23925508067513727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.853 × 10¹⁰⁰(101-digit number)
98533847293949854299…47851016135027455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.970 × 10¹⁰¹(102-digit number)
19706769458789970859…95702032270054911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.941 × 10¹⁰¹(102-digit number)
39413538917579941719…91404064540109823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.882 × 10¹⁰¹(102-digit number)
78827077835159883439…82808129080219647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.576 × 10¹⁰²(103-digit number)
15765415567031976687…65616258160439295999
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,855,502 XPM·at block #6,826,420 · 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