Block #535,102

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2014, 5:25:22 PM · Difficulty 10.9038 · 6,277,951 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a94bb0a2ed3f8a992da53377e23351e65b6b6f6c45f8ee77f07618a6689c22a

Height

#535,102

Difficulty

10.903837

Transactions

4

Size

20.50 KB

Version

2

Bits

0ae761d6

Nonce

187,734,278

Timestamp

5/10/2014, 5:25:22 PM

Confirmations

6,277,951

Merkle Root

8edbe51a86bd22620c4136020e71f39d60117fc9e3da87345230c92086c49833
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.199 × 10⁹⁸(99-digit number)
21990292200622110386…79234306547474189529
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.199 × 10⁹⁸(99-digit number)
21990292200622110386…79234306547474189529
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.398 × 10⁹⁸(99-digit number)
43980584401244220772…58468613094948379059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.796 × 10⁹⁸(99-digit number)
87961168802488441544…16937226189896758119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.759 × 10⁹⁹(100-digit number)
17592233760497688308…33874452379793516239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.518 × 10⁹⁹(100-digit number)
35184467520995376617…67748904759587032479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.036 × 10⁹⁹(100-digit number)
70368935041990753235…35497809519174064959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.407 × 10¹⁰⁰(101-digit number)
14073787008398150647…70995619038348129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.814 × 10¹⁰⁰(101-digit number)
28147574016796301294…41991238076696259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.629 × 10¹⁰⁰(101-digit number)
56295148033592602588…83982476153392519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.125 × 10¹⁰¹(102-digit number)
11259029606718520517…67964952306785039359
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,748,469 XPM·at block #6,813,052 · 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