Block #497,168

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2014, 11:17:37 AM · Difficulty 10.7637 · 6,329,893 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c220dae701fcb2c35ef6345c57cf1c67446076cc1a17c2005426a6ba95078f7

Height

#497,168

Difficulty

10.763714

Transactions

4

Size

1.69 KB

Version

2

Bits

0ac382bd

Nonce

215,420

Timestamp

4/17/2014, 11:17:37 AM

Confirmations

6,329,893

Merkle Root

66cc89dbc3162fa91f6afa7fde504b1c741dc7420defd09c41a423b98c915571
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.

2.277 × 10⁹⁵(96-digit number)
22779194419825412159…32135923863398051521
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
2.277 × 10⁹⁵(96-digit number)
22779194419825412159…32135923863398051521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.555 × 10⁹⁵(96-digit number)
45558388839650824318…64271847726796103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.111 × 10⁹⁵(96-digit number)
91116777679301648636…28543695453592206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.822 × 10⁹⁶(97-digit number)
18223355535860329727…57087390907184412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.644 × 10⁹⁶(97-digit number)
36446711071720659454…14174781814368824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.289 × 10⁹⁶(97-digit number)
72893422143441318909…28349563628737648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.457 × 10⁹⁷(98-digit number)
14578684428688263781…56699127257475297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.915 × 10⁹⁷(98-digit number)
29157368857376527563…13398254514950594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.831 × 10⁹⁷(98-digit number)
58314737714753055127…26796509029901189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.166 × 10⁹⁸(99-digit number)
11662947542950611025…53593018059802378241
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,860,671 XPM·at block #6,827,060 · 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