Block #455,705

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2014, 5:21:03 PM · Difficulty 10.4163 · 6,369,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
516f3d978bfe1904c2bdb7abdedfde7aef658a24f4d43b18605ea507e1a95e49

Height

#455,705

Difficulty

10.416256

Transactions

3

Size

1.33 KB

Version

2

Bits

0a6a8fba

Nonce

408,885

Timestamp

3/22/2014, 5:21:03 PM

Confirmations

6,369,487

Merkle Root

90638a6fb1e7e0287cd0ee81d81a556d7bf0ad2f5f6248948a04aa7b6384b896
Transactions (3)
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.933 × 10⁹⁷(98-digit number)
19337729536878475452…20583053958481940481
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.933 × 10⁹⁷(98-digit number)
19337729536878475452…20583053958481940481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.867 × 10⁹⁷(98-digit number)
38675459073756950905…41166107916963880961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.735 × 10⁹⁷(98-digit number)
77350918147513901811…82332215833927761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.547 × 10⁹⁸(99-digit number)
15470183629502780362…64664431667855523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.094 × 10⁹⁸(99-digit number)
30940367259005560724…29328863335711047681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.188 × 10⁹⁸(99-digit number)
61880734518011121448…58657726671422095361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.237 × 10⁹⁹(100-digit number)
12376146903602224289…17315453342844190721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.475 × 10⁹⁹(100-digit number)
24752293807204448579…34630906685688381441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.950 × 10⁹⁹(100-digit number)
49504587614408897159…69261813371376762881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.900 × 10⁹⁹(100-digit number)
99009175228817794318…38523626742753525761
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,845,627 XPM·at block #6,825,191 · 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