Block #535,239

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2014, 7:26:31 PM · Difficulty 10.9042 · 6,275,281 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f1ed668bb2b82bd4c68ef2b2f9eb695ebc729a7cb08978caca103f9a0936798

Height

#535,239

Difficulty

10.904160

Transactions

15

Size

4.63 KB

Version

2

Bits

0ae77708

Nonce

60,695,765

Timestamp

5/10/2014, 7:26:31 PM

Confirmations

6,275,281

Merkle Root

f8a15945dddb6040c43ab1549d56b3f687ed52689b27735481efbabef1cfbe94
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.527 × 10¹⁰⁰(101-digit number)
25277076874862024711…57226404571320948479
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.527 × 10¹⁰⁰(101-digit number)
25277076874862024711…57226404571320948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.055 × 10¹⁰⁰(101-digit number)
50554153749724049422…14452809142641896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.011 × 10¹⁰¹(102-digit number)
10110830749944809884…28905618285283793919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.022 × 10¹⁰¹(102-digit number)
20221661499889619769…57811236570567587839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.044 × 10¹⁰¹(102-digit number)
40443322999779239538…15622473141135175679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.088 × 10¹⁰¹(102-digit number)
80886645999558479076…31244946282270351359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.617 × 10¹⁰²(103-digit number)
16177329199911695815…62489892564540702719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.235 × 10¹⁰²(103-digit number)
32354658399823391630…24979785129081405439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.470 × 10¹⁰²(103-digit number)
64709316799646783261…49959570258162810879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.294 × 10¹⁰³(104-digit number)
12941863359929356652…99919140516325621759
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,728,246 XPM·at block #6,810,519 · 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