Block #525,041

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2014, 1:05:01 PM · Difficulty 10.8784 · 6,282,048 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2bcba28dfaaf5c2cbef601bf65eee1fe149265ed55f1fc8868d3be8586d0a17

Height

#525,041

Difficulty

10.878406

Transactions

2

Size

433 B

Version

2

Bits

0ae0df33

Nonce

112,994,245

Timestamp

5/4/2014, 1:05:01 PM

Confirmations

6,282,048

Merkle Root

f789cc07b8572ec5e74ad6ccb92043bf0dfd505efa4b1d7a34610903f9100c3c
Transactions (2)
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.

5.591 × 10¹⁰⁰(101-digit number)
55913595915827984306…22787941539581588479
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
5.591 × 10¹⁰⁰(101-digit number)
55913595915827984306…22787941539581588479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.118 × 10¹⁰¹(102-digit number)
11182719183165596861…45575883079163176959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.236 × 10¹⁰¹(102-digit number)
22365438366331193722…91151766158326353919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.473 × 10¹⁰¹(102-digit number)
44730876732662387445…82303532316652707839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.946 × 10¹⁰¹(102-digit number)
89461753465324774890…64607064633305415679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.789 × 10¹⁰²(103-digit number)
17892350693064954978…29214129266610831359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.578 × 10¹⁰²(103-digit number)
35784701386129909956…58428258533221662719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.156 × 10¹⁰²(103-digit number)
71569402772259819912…16856517066443325439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.431 × 10¹⁰³(104-digit number)
14313880554451963982…33713034132886650879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.862 × 10¹⁰³(104-digit number)
28627761108903927965…67426068265773301759
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,700,809 XPM·at block #6,807,088 · 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