Block #505,952

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/22/2014, 6:46:22 PM · Difficulty 10.8125 · 6,303,874 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c26f0629864957240134b01994fde24be9c8d608047beb932a868f9c8cfb2078

Height

#505,952

Difficulty

10.812514

Transactions

6

Size

1.73 KB

Version

2

Bits

0ad000eb

Nonce

48,623,634

Timestamp

4/22/2014, 6:46:22 PM

Confirmations

6,303,874

Merkle Root

1027d48961fc79eeeb5f1d6ea70ac90b6752253a91f7f0420c40ffe8b15e02c7
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.851 × 10¹⁰⁰(101-digit number)
18516782355618592287…04176586850615385601
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.851 × 10¹⁰⁰(101-digit number)
18516782355618592287…04176586850615385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.703 × 10¹⁰⁰(101-digit number)
37033564711237184574…08353173701230771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.406 × 10¹⁰⁰(101-digit number)
74067129422474369148…16706347402461542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.481 × 10¹⁰¹(102-digit number)
14813425884494873829…33412694804923084801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.962 × 10¹⁰¹(102-digit number)
29626851768989747659…66825389609846169601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.925 × 10¹⁰¹(102-digit number)
59253703537979495318…33650779219692339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.185 × 10¹⁰²(103-digit number)
11850740707595899063…67301558439384678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.370 × 10¹⁰²(103-digit number)
23701481415191798127…34603116878769356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.740 × 10¹⁰²(103-digit number)
47402962830383596254…69206233757538713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.480 × 10¹⁰²(103-digit number)
94805925660767192509…38412467515077427201
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,722,693 XPM·at block #6,809,825 · 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