Block #411,057

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/19/2014, 12:00:05 PM · Difficulty 10.4308 · 6,406,037 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8c08b77bd046215d2dae4f71d6e81398610613970782a5b4bcf0c25baee639db

Height

#411,057

Difficulty

10.430753

Transactions

5

Size

1.97 KB

Version

2

Bits

0a6e45d7

Nonce

266,487

Timestamp

2/19/2014, 12:00:05 PM

Confirmations

6,406,037

Merkle Root

43621603338ec8a515ad91b70a27d9b7dba60c627ef49c5ae41c7ec9a600e7ac
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.433 × 10¹⁰⁰(101-digit number)
14332342303258176471…26041203399865660401
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.433 × 10¹⁰⁰(101-digit number)
14332342303258176471…26041203399865660401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.866 × 10¹⁰⁰(101-digit number)
28664684606516352943…52082406799731320801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.732 × 10¹⁰⁰(101-digit number)
57329369213032705886…04164813599462641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.146 × 10¹⁰¹(102-digit number)
11465873842606541177…08329627198925283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.293 × 10¹⁰¹(102-digit number)
22931747685213082354…16659254397850566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.586 × 10¹⁰¹(102-digit number)
45863495370426164709…33318508795701132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.172 × 10¹⁰¹(102-digit number)
91726990740852329419…66637017591402265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.834 × 10¹⁰²(103-digit number)
18345398148170465883…33274035182804531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.669 × 10¹⁰²(103-digit number)
36690796296340931767…66548070365609062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.338 × 10¹⁰²(103-digit number)
73381592592681863535…33096140731218124801
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,780,789 XPM·at block #6,817,093 · 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