Block #361,676

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2014, 5:33:08 AM · Difficulty 10.4081 · 6,463,639 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6c3191fb5b22af5b38dab91a9c40e22d5885e5b461f116465ffc0f7077c041f

Height

#361,676

Difficulty

10.408075

Transactions

7

Size

2.83 KB

Version

2

Bits

0a6877a2

Nonce

103,081

Timestamp

1/16/2014, 5:33:08 AM

Confirmations

6,463,639

Merkle Root

9d1cfa10cada7de7eaba0956dbedf595c9c26e3891658ebcdb55ebfb33d50467
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.646 × 10⁹⁶(97-digit number)
26468145585169624614…37545651806205615101
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.646 × 10⁹⁶(97-digit number)
26468145585169624614…37545651806205615101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.293 × 10⁹⁶(97-digit number)
52936291170339249229…75091303612411230201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.058 × 10⁹⁷(98-digit number)
10587258234067849845…50182607224822460401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.117 × 10⁹⁷(98-digit number)
21174516468135699691…00365214449644920801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.234 × 10⁹⁷(98-digit number)
42349032936271399383…00730428899289841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.469 × 10⁹⁷(98-digit number)
84698065872542798767…01460857798579683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.693 × 10⁹⁸(99-digit number)
16939613174508559753…02921715597159366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.387 × 10⁹⁸(99-digit number)
33879226349017119506…05843431194318732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.775 × 10⁹⁸(99-digit number)
67758452698034239013…11686862388637465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.355 × 10⁹⁹(100-digit number)
13551690539606847802…23373724777274931201
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,846,624 XPM·at block #6,825,314 · 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