Block #511,913

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/26/2014, 1:20:35 PM · Difficulty 10.8315 · 6,302,218 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0fbf6fd2e84ee2f130bb48fa1843485056c53d3878b94ab1e888a19bf20c1d72

Height

#511,913

Difficulty

10.831488

Transactions

7

Size

1.96 KB

Version

2

Bits

0ad4dc60

Nonce

35,744,228

Timestamp

4/26/2014, 1:20:35 PM

Confirmations

6,302,218

Merkle Root

9c74abc0949c271cd39c2ababbedb88d64d5621c0aade0b572ed31fb360731aa
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.610 × 10¹⁰¹(102-digit number)
16102372274667171448…83112820128415252481
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.610 × 10¹⁰¹(102-digit number)
16102372274667171448…83112820128415252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.220 × 10¹⁰¹(102-digit number)
32204744549334342896…66225640256830504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.440 × 10¹⁰¹(102-digit number)
64409489098668685792…32451280513661009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.288 × 10¹⁰²(103-digit number)
12881897819733737158…64902561027322019841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.576 × 10¹⁰²(103-digit number)
25763795639467474317…29805122054644039681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.152 × 10¹⁰²(103-digit number)
51527591278934948634…59610244109288079361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.030 × 10¹⁰³(104-digit number)
10305518255786989726…19220488218576158721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.061 × 10¹⁰³(104-digit number)
20611036511573979453…38440976437152317441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.122 × 10¹⁰³(104-digit number)
41222073023147958907…76881952874304634881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.244 × 10¹⁰³(104-digit number)
82444146046295917814…53763905748609269761
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,757,131 XPM·at block #6,814,130 · 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