Block #496,702

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 5:30:04 AM · Difficulty 10.7580 · 6,319,376 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7447ccf5cb4d8c5caaf5fc80638ab4d941a7dceed6dc924e45a30bc02143bedf

Height

#496,702

Difficulty

10.758010

Transactions

7

Size

2.11 KB

Version

2

Bits

0ac20cf8

Nonce

693,441,261

Timestamp

4/17/2014, 5:30:04 AM

Confirmations

6,319,376

Merkle Root

1f2ecfef96c96978f2bba6cfb6bd5467b86f4784775b6719919e92ce3b179097
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.271 × 10¹⁰⁰(101-digit number)
12719029334789831819…09674060234435481601
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.271 × 10¹⁰⁰(101-digit number)
12719029334789831819…09674060234435481601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.543 × 10¹⁰⁰(101-digit number)
25438058669579663639…19348120468870963201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.087 × 10¹⁰⁰(101-digit number)
50876117339159327278…38696240937741926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.017 × 10¹⁰¹(102-digit number)
10175223467831865455…77392481875483852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.035 × 10¹⁰¹(102-digit number)
20350446935663730911…54784963750967705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.070 × 10¹⁰¹(102-digit number)
40700893871327461822…09569927501935411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.140 × 10¹⁰¹(102-digit number)
81401787742654923645…19139855003870822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.628 × 10¹⁰²(103-digit number)
16280357548530984729…38279710007741644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.256 × 10¹⁰²(103-digit number)
32560715097061969458…76559420015483289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.512 × 10¹⁰²(103-digit number)
65121430194123938916…53118840030966579201
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,772,742 XPM·at block #6,816,077 · 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