Block #353,804

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 4:00:13 AM · Difficulty 10.3335 · 6,471,088 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92738d6f4fe092830fbd1af8feba0d70fd2977ea9649dcc2646326ced3801bdb

Height

#353,804

Difficulty

10.333486

Transactions

1

Size

1004 B

Version

2

Bits

0a555f50

Nonce

15,827

Timestamp

1/11/2014, 4:00:13 AM

Confirmations

6,471,088

Merkle Root

106d46e1e458b5f8b91dc5d001395f00b77b430f44dbc688ddb994781f73ac6d
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.

7.575 × 10⁹⁶(97-digit number)
75757392557795546046…27001155536959641601
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
7.575 × 10⁹⁶(97-digit number)
75757392557795546046…27001155536959641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.515 × 10⁹⁷(98-digit number)
15151478511559109209…54002311073919283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.030 × 10⁹⁷(98-digit number)
30302957023118218418…08004622147838566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.060 × 10⁹⁷(98-digit number)
60605914046236436837…16009244295677132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.212 × 10⁹⁸(99-digit number)
12121182809247287367…32018488591354265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.424 × 10⁹⁸(99-digit number)
24242365618494574734…64036977182708531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.848 × 10⁹⁸(99-digit number)
48484731236989149469…28073954365417062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.696 × 10⁹⁸(99-digit number)
96969462473978298939…56147908730834124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.939 × 10⁹⁹(100-digit number)
19393892494795659787…12295817461668249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.878 × 10⁹⁹(100-digit number)
38787784989591319575…24591634923336499201
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,843,217 XPM·at block #6,824,891 · 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