Block #525,142

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2014, 2:37:36 PM · Difficulty 10.8787 · 6,283,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
99084e77f65adda5a82102fdc5919822b4096de955d0484f177a1a878045b565

Height

#525,142

Difficulty

10.878661

Transactions

5

Size

1.69 KB

Version

2

Bits

0ae0efed

Nonce

433,632

Timestamp

5/4/2014, 2:37:36 PM

Confirmations

6,283,734

Merkle Root

730fb2830c36393e1e7d493581cad6280c1a133e4fb58765628ba07dc9943759
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.792 × 10¹⁰²(103-digit number)
17922899574576027840…17467576192630451199
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.792 × 10¹⁰²(103-digit number)
17922899574576027840…17467576192630451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.584 × 10¹⁰²(103-digit number)
35845799149152055681…34935152385260902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.169 × 10¹⁰²(103-digit number)
71691598298304111363…69870304770521804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.433 × 10¹⁰³(104-digit number)
14338319659660822272…39740609541043609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.867 × 10¹⁰³(104-digit number)
28676639319321644545…79481219082087219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.735 × 10¹⁰³(104-digit number)
57353278638643289090…58962438164174438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.147 × 10¹⁰⁴(105-digit number)
11470655727728657818…17924876328348876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.294 × 10¹⁰⁴(105-digit number)
22941311455457315636…35849752656697753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.588 × 10¹⁰⁴(105-digit number)
45882622910914631272…71699505313395507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.176 × 10¹⁰⁴(105-digit number)
91765245821829262544…43399010626791014399
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,715,059 XPM·at block #6,808,875 · 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