Block #397,162

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 9:41:01 PM · Difficulty 10.4152 · 6,417,761 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a55e994b315ac9a005e443d641e6feb4e87768cdd051bdcbd58ba6f73235270c

Height

#397,162

Difficulty

10.415150

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6a4749

Nonce

3,157

Timestamp

2/9/2014, 9:41:01 PM

Confirmations

6,417,761

Merkle Root

a9b14938981e4c58c9b0273a914845be032ab6a1db1b8916a637548c9a4cd4cf
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.

4.616 × 10⁹⁹(100-digit number)
46166657370414084746…76563971981406120161
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
4.616 × 10⁹⁹(100-digit number)
46166657370414084746…76563971981406120161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.233 × 10⁹⁹(100-digit number)
92333314740828169492…53127943962812240321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.846 × 10¹⁰⁰(101-digit number)
18466662948165633898…06255887925624480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.693 × 10¹⁰⁰(101-digit number)
36933325896331267796…12511775851248961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.386 × 10¹⁰⁰(101-digit number)
73866651792662535593…25023551702497922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.477 × 10¹⁰¹(102-digit number)
14773330358532507118…50047103404995845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.954 × 10¹⁰¹(102-digit number)
29546660717065014237…00094206809991690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.909 × 10¹⁰¹(102-digit number)
59093321434130028475…00188413619983380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.181 × 10¹⁰²(103-digit number)
11818664286826005695…00376827239966760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.363 × 10¹⁰²(103-digit number)
23637328573652011390…00753654479933521921
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,763,477 XPM·at block #6,814,922 · 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