Block #536,847

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 2:18:01 PM · Difficulty 10.9129 · 6,273,608 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c7a1c88e64c764206463b3faf1efdbfc8f3735c1a89ca62268bde7d94c45f038

Height

#536,847

Difficulty

10.912858

Transactions

3

Size

957 B

Version

2

Bits

0ae9b10e

Nonce

59,328,175

Timestamp

5/11/2014, 2:18:01 PM

Confirmations

6,273,608

Merkle Root

5884d6331b5bcde4f58ddc1451ee9bf43ba612e45ac1a92a8ec8233750de0ef7
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.923 × 10⁹⁹(100-digit number)
39236190353706952561…06623416072815238399
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.923 × 10⁹⁹(100-digit number)
39236190353706952561…06623416072815238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.847 × 10⁹⁹(100-digit number)
78472380707413905123…13246832145630476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.569 × 10¹⁰⁰(101-digit number)
15694476141482781024…26493664291260953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.138 × 10¹⁰⁰(101-digit number)
31388952282965562049…52987328582521907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.277 × 10¹⁰⁰(101-digit number)
62777904565931124098…05974657165043814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.255 × 10¹⁰¹(102-digit number)
12555580913186224819…11949314330087628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.511 × 10¹⁰¹(102-digit number)
25111161826372449639…23898628660175257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.022 × 10¹⁰¹(102-digit number)
50222323652744899278…47797257320350515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.004 × 10¹⁰²(103-digit number)
10044464730548979855…95594514640701030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.008 × 10¹⁰²(103-digit number)
20088929461097959711…91189029281402060799
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,727,726 XPM·at block #6,810,454 · 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