1. #6,807,9692CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #414,265

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/21/2014, 8:55:34 PM · Difficulty 10.4073 · 6,393,705 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
daed7a712e7a5c2dfefe6322ab71ff5cb4743df05051f976916558bf6329f8fb

Height

#414,265

Difficulty

10.407349

Transactions

4

Size

884 B

Version

2

Bits

0a684804

Nonce

33,557,628

Timestamp

2/21/2014, 8:55:34 PM

Confirmations

6,393,705

Merkle Root

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

2.380 × 10⁹⁵(96-digit number)
23804094535133926880…70087523725965205761
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
2.380 × 10⁹⁵(96-digit number)
23804094535133926880…70087523725965205761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.760 × 10⁹⁵(96-digit number)
47608189070267853761…40175047451930411521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.521 × 10⁹⁵(96-digit number)
95216378140535707523…80350094903860823041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.904 × 10⁹⁶(97-digit number)
19043275628107141504…60700189807721646081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.808 × 10⁹⁶(97-digit number)
38086551256214283009…21400379615443292161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.617 × 10⁹⁶(97-digit number)
76173102512428566018…42800759230886584321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.523 × 10⁹⁷(98-digit number)
15234620502485713203…85601518461773168641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.046 × 10⁹⁷(98-digit number)
30469241004971426407…71203036923546337281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.093 × 10⁹⁷(98-digit number)
60938482009942852814…42406073847092674561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.218 × 10⁹⁸(99-digit number)
12187696401988570562…84812147694185349121
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,707,804 XPM·at block #6,807,969 · 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