Block #372,291

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/23/2014, 12:17:27 PM · Difficulty 10.4271 · 6,438,560 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8aa50f774521a3668748b5977e039f31d349a6e0691c547adb96309a4c036621

Height

#372,291

Difficulty

10.427134

Transactions

10

Size

10.84 KB

Version

2

Bits

0a6d58a4

Nonce

31,511

Timestamp

1/23/2014, 12:17:27 PM

Confirmations

6,438,560

Merkle Root

904f0c3b6601fee0d4e7e3ac0a69b5d2ebda10ab888b4037a95a71b47bd8d2c3
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.095 × 10⁹⁵(96-digit number)
20958524527133355194…92115687921849323761
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.095 × 10⁹⁵(96-digit number)
20958524527133355194…92115687921849323761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.191 × 10⁹⁵(96-digit number)
41917049054266710388…84231375843698647521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.383 × 10⁹⁵(96-digit number)
83834098108533420776…68462751687397295041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.676 × 10⁹⁶(97-digit number)
16766819621706684155…36925503374794590081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.353 × 10⁹⁶(97-digit number)
33533639243413368310…73851006749589180161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.706 × 10⁹⁶(97-digit number)
67067278486826736620…47702013499178360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.341 × 10⁹⁷(98-digit number)
13413455697365347324…95404026998356720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.682 × 10⁹⁷(98-digit number)
26826911394730694648…90808053996713441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.365 × 10⁹⁷(98-digit number)
53653822789461389296…81616107993426882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.073 × 10⁹⁸(99-digit number)
10730764557892277859…63232215986853765121
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,730,904 XPM·at block #6,810,850 · 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