Block #512,853

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2014, 3:46:31 AM · Difficulty 10.8340 · 6,296,663 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6ec6fa4185044f3b747fafc777aa41db208a07359e00f5711a5985ea7b55475f

Height

#512,853

Difficulty

10.833997

Transactions

7

Size

26.44 KB

Version

2

Bits

0ad580cf

Nonce

18,000

Timestamp

4/27/2014, 3:46:31 AM

Confirmations

6,296,663

Merkle Root

11dee88a8b8c40c194940f803f26f4529ad50c359f05b34debfe0b1900195752
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.

9.002 × 10¹⁰⁰(101-digit number)
90029225305817502871…07561322917192638079
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
9.002 × 10¹⁰⁰(101-digit number)
90029225305817502871…07561322917192638079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.800 × 10¹⁰¹(102-digit number)
18005845061163500574…15122645834385276159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.601 × 10¹⁰¹(102-digit number)
36011690122327001148…30245291668770552319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.202 × 10¹⁰¹(102-digit number)
72023380244654002297…60490583337541104639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.440 × 10¹⁰²(103-digit number)
14404676048930800459…20981166675082209279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.880 × 10¹⁰²(103-digit number)
28809352097861600918…41962333350164418559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.761 × 10¹⁰²(103-digit number)
57618704195723201837…83924666700328837119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.152 × 10¹⁰³(104-digit number)
11523740839144640367…67849333400657674239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.304 × 10¹⁰³(104-digit number)
23047481678289280735…35698666801315348479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.609 × 10¹⁰³(104-digit number)
46094963356578561470…71397333602630696959
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,720,204 XPM·at block #6,809,515 · 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