Block #526,719

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2014, 1:54:19 PM · Difficulty 10.8832 · 6,287,163 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5eb3422c763a8c934f69ae07a8e8f8733f4f081b63ada4ef36a62c8989849d17

Height

#526,719

Difficulty

10.883153

Transactions

8

Size

2.29 KB

Version

2

Bits

0ae21657

Nonce

7,403,390

Timestamp

5/5/2014, 1:54:19 PM

Confirmations

6,287,163

Merkle Root

4809b8478fb80423ed4c594b40c4ac351724559c1ed81de3460e4e4c8310f06f
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.036 × 10¹⁰⁰(101-digit number)
20364561942157977579…10979013973388001279
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.036 × 10¹⁰⁰(101-digit number)
20364561942157977579…10979013973388001279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.072 × 10¹⁰⁰(101-digit number)
40729123884315955159…21958027946776002559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.145 × 10¹⁰⁰(101-digit number)
81458247768631910319…43916055893552005119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.629 × 10¹⁰¹(102-digit number)
16291649553726382063…87832111787104010239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.258 × 10¹⁰¹(102-digit number)
32583299107452764127…75664223574208020479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.516 × 10¹⁰¹(102-digit number)
65166598214905528255…51328447148416040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.303 × 10¹⁰²(103-digit number)
13033319642981105651…02656894296832081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.606 × 10¹⁰²(103-digit number)
26066639285962211302…05313788593664163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.213 × 10¹⁰²(103-digit number)
52133278571924422604…10627577187328327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.042 × 10¹⁰³(104-digit number)
10426655714384884520…21255154374656655359
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,755,131 XPM·at block #6,813,881 · 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