Block #494,827

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 8:31:29 AM · Difficulty 10.7262 · 6,312,044 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d79ee0155858f37972ea2f2d7c123eadfbed1fea913a6fc79af6f67ed4093571

Height

#494,827

Difficulty

10.726230

Transactions

8

Size

2.36 KB

Version

2

Bits

0ab9ea32

Nonce

138,899

Timestamp

4/16/2014, 8:31:29 AM

Confirmations

6,312,044

Merkle Root

904cf1ff64ec7befaeb7d1276fce98ced43d3e300f84f9d533cc0c4c39e87431
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.923 × 10⁹⁹(100-digit number)
19234769469795675686…79099466678565727361
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.923 × 10⁹⁹(100-digit number)
19234769469795675686…79099466678565727361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.846 × 10⁹⁹(100-digit number)
38469538939591351372…58198933357131454721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.693 × 10⁹⁹(100-digit number)
76939077879182702745…16397866714262909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.538 × 10¹⁰⁰(101-digit number)
15387815575836540549…32795733428525818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.077 × 10¹⁰⁰(101-digit number)
30775631151673081098…65591466857051637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.155 × 10¹⁰⁰(101-digit number)
61551262303346162196…31182933714103275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.231 × 10¹⁰¹(102-digit number)
12310252460669232439…62365867428206551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.462 × 10¹⁰¹(102-digit number)
24620504921338464878…24731734856413102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.924 × 10¹⁰¹(102-digit number)
49241009842676929757…49463469712826204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.848 × 10¹⁰¹(102-digit number)
98482019685353859514…98926939425652408321
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,699,075 XPM·at block #6,806,870 · 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