Block #372,593

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/23/2014, 5:15:32 PM · Difficulty 10.4277 · 6,441,266 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
40a2c9cf4b6798ddb402f09903d97665a677248f60657cae026926e6330eb90a

Height

#372,593

Difficulty

10.427664

Transactions

7

Size

1.92 KB

Version

2

Bits

0a6d7b6b

Nonce

13,437

Timestamp

1/23/2014, 5:15:32 PM

Confirmations

6,441,266

Merkle Root

230a1fdad9d7c426b8ec95fcaaf4988399bdf8a88d638e9d1934b990c1f1e215
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.279 × 10⁹²(93-digit number)
12791858279877083000…88314679795008390001
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.279 × 10⁹²(93-digit number)
12791858279877083000…88314679795008390001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.558 × 10⁹²(93-digit number)
25583716559754166001…76629359590016780001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.116 × 10⁹²(93-digit number)
51167433119508332003…53258719180033560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.023 × 10⁹³(94-digit number)
10233486623901666400…06517438360067120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.046 × 10⁹³(94-digit number)
20466973247803332801…13034876720134240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.093 × 10⁹³(94-digit number)
40933946495606665602…26069753440268480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.186 × 10⁹³(94-digit number)
81867892991213331205…52139506880536960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.637 × 10⁹⁴(95-digit number)
16373578598242666241…04279013761073920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.274 × 10⁹⁴(95-digit number)
32747157196485332482…08558027522147840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.549 × 10⁹⁴(95-digit number)
65494314392970664964…17116055044295680001
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,754,944 XPM·at block #6,813,858 · 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