Block #416,760

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/23/2014, 3:50:09 PM · Difficulty 10.3992 · 6,400,041 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
899d913ce0b19fe3d3e381a0c7ee83b823cda86b4dfacaf3224395eb170bdd3b

Height

#416,760

Difficulty

10.399198

Transactions

8

Size

2.46 KB

Version

2

Bits

0a6631d7

Nonce

11,330,231

Timestamp

2/23/2014, 3:50:09 PM

Confirmations

6,400,041

Merkle Root

6af6dea8daa9b804c8cdd19130529747e8d8fd7dd8e0c8b4e9890613f0399dee
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.321 × 10⁹⁴(95-digit number)
13215482093551291823…99460798969486528321
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.321 × 10⁹⁴(95-digit number)
13215482093551291823…99460798969486528321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.643 × 10⁹⁴(95-digit number)
26430964187102583647…98921597938973056641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.286 × 10⁹⁴(95-digit number)
52861928374205167295…97843195877946113281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.057 × 10⁹⁵(96-digit number)
10572385674841033459…95686391755892226561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.114 × 10⁹⁵(96-digit number)
21144771349682066918…91372783511784453121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.228 × 10⁹⁵(96-digit number)
42289542699364133836…82745567023568906241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.457 × 10⁹⁵(96-digit number)
84579085398728267673…65491134047137812481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.691 × 10⁹⁶(97-digit number)
16915817079745653534…30982268094275624961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.383 × 10⁹⁶(97-digit number)
33831634159491307069…61964536188551249921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.766 × 10⁹⁶(97-digit number)
67663268318982614138…23929072377102499841
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,778,444 XPM·at block #6,816,800 · 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