Block #365,362

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 4:52:16 PM · Difficulty 10.4251 · 6,450,651 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
de5ef2175226a9388af8841b42443391ec908d998cbceff05b8ae16b9c69e079

Height

#365,362

Difficulty

10.425126

Transactions

8

Size

7.31 KB

Version

2

Bits

0a6cd515

Nonce

58,896

Timestamp

1/18/2014, 4:52:16 PM

Confirmations

6,450,651

Merkle Root

7979d44848744d63e46fe9dc98252b453ab8d1c10fa2c0f407ab0298484fd4ad
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.

3.565 × 10⁹³(94-digit number)
35656805336918302402…54205885521151621121
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
3.565 × 10⁹³(94-digit number)
35656805336918302402…54205885521151621121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.131 × 10⁹³(94-digit number)
71313610673836604804…08411771042303242241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.426 × 10⁹⁴(95-digit number)
14262722134767320960…16823542084606484481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.852 × 10⁹⁴(95-digit number)
28525444269534641921…33647084169212968961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.705 × 10⁹⁴(95-digit number)
57050888539069283843…67294168338425937921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.141 × 10⁹⁵(96-digit number)
11410177707813856768…34588336676851875841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.282 × 10⁹⁵(96-digit number)
22820355415627713537…69176673353703751681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.564 × 10⁹⁵(96-digit number)
45640710831255427074…38353346707407503361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.128 × 10⁹⁵(96-digit number)
91281421662510854149…76706693414815006721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.825 × 10⁹⁶(97-digit number)
18256284332502170829…53413386829630013441
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,772,222 XPM·at block #6,816,012 · 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