Block #525,546

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2014, 8:12:13 PM · Difficulty 10.8803 · 6,283,254 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4b757469b4da56242c27347697234e33826ed1f94f176a04d674f988b3b4f1ad

Height

#525,546

Difficulty

10.880347

Transactions

4

Size

886 B

Version

2

Bits

0ae15e6c

Nonce

69,579,374

Timestamp

5/4/2014, 8:12:13 PM

Confirmations

6,283,254

Merkle Root

0d6f17c9601e7ae10247ac93d214fd046f9a7770cd12bd547ebc38279ba37f09
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.355 × 10¹⁰¹(102-digit number)
23551329380447566409…87528038753857044479
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.355 × 10¹⁰¹(102-digit number)
23551329380447566409…87528038753857044479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.710 × 10¹⁰¹(102-digit number)
47102658760895132818…75056077507714088959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.420 × 10¹⁰¹(102-digit number)
94205317521790265636…50112155015428177919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.884 × 10¹⁰²(103-digit number)
18841063504358053127…00224310030856355839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.768 × 10¹⁰²(103-digit number)
37682127008716106254…00448620061712711679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.536 × 10¹⁰²(103-digit number)
75364254017432212508…00897240123425423359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.507 × 10¹⁰³(104-digit number)
15072850803486442501…01794480246850846719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.014 × 10¹⁰³(104-digit number)
30145701606972885003…03588960493701693439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.029 × 10¹⁰³(104-digit number)
60291403213945770007…07177920987403386879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.205 × 10¹⁰⁴(105-digit number)
12058280642789154001…14355841974806773759
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,714,454 XPM·at block #6,808,799 · 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