Block #509,821

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 7:04:15 AM · Difficulty 10.8219 · 6,307,113 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0f609010a8e08d240e63ce89452fa19069c27fd6658cfcdf0ad82058d5545bd5

Height

#509,821

Difficulty

10.821862

Transactions

4

Size

7.80 KB

Version

2

Bits

0ad2658c

Nonce

17,968

Timestamp

4/25/2014, 7:04:15 AM

Confirmations

6,307,113

Merkle Root

51cd7c2c0b5a08ce75279ee3b99e76b79ab011f4dcf9a5215fdd92dfe71626f3
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.

1.985 × 10⁹⁹(100-digit number)
19858263640980172018…06906496824679536639
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
1.985 × 10⁹⁹(100-digit number)
19858263640980172018…06906496824679536639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.971 × 10⁹⁹(100-digit number)
39716527281960344037…13812993649359073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.943 × 10⁹⁹(100-digit number)
79433054563920688074…27625987298718146559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.588 × 10¹⁰⁰(101-digit number)
15886610912784137614…55251974597436293119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.177 × 10¹⁰⁰(101-digit number)
31773221825568275229…10503949194872586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.354 × 10¹⁰⁰(101-digit number)
63546443651136550459…21007898389745172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.270 × 10¹⁰¹(102-digit number)
12709288730227310091…42015796779490344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.541 × 10¹⁰¹(102-digit number)
25418577460454620183…84031593558980689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.083 × 10¹⁰¹(102-digit number)
50837154920909240367…68063187117961379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.016 × 10¹⁰²(103-digit number)
10167430984181848073…36126374235922759679
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,779,514 XPM·at block #6,816,933 · 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.
Privacy Policy·

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