Block #517,560

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2014, 1:02:16 AM · Difficulty 10.8514 · 6,295,186 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f41c9deb89aac331f49d9fcd13b5302caab6e363c64fb29f317937195e939123

Height

#517,560

Difficulty

10.851416

Transactions

3

Size

1.51 KB

Version

2

Bits

0ad9f65e

Nonce

226,426,697

Timestamp

4/30/2014, 1:02:16 AM

Confirmations

6,295,186

Merkle Root

9a4ba6d6a9e0569e047ae435ae94069cb0ef766af0b90152940e3e190f087ab1
Transactions (3)
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.

3.518 × 10⁹⁹(100-digit number)
35182576423329211538…14028802428329553599
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
3.518 × 10⁹⁹(100-digit number)
35182576423329211538…14028802428329553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.036 × 10⁹⁹(100-digit number)
70365152846658423076…28057604856659107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.407 × 10¹⁰⁰(101-digit number)
14073030569331684615…56115209713318214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.814 × 10¹⁰⁰(101-digit number)
28146061138663369230…12230419426636428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.629 × 10¹⁰⁰(101-digit number)
56292122277326738461…24460838853272857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.125 × 10¹⁰¹(102-digit number)
11258424455465347692…48921677706545715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.251 × 10¹⁰¹(102-digit number)
22516848910930695384…97843355413091430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.503 × 10¹⁰¹(102-digit number)
45033697821861390769…95686710826182860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.006 × 10¹⁰¹(102-digit number)
90067395643722781538…91373421652365721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.801 × 10¹⁰²(103-digit number)
18013479128744556307…82746843304731443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.602 × 10¹⁰²(103-digit number)
36026958257489112615…65493686609462886399
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,746,011 XPM·at block #6,812,745 · 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