Block #363,382

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 9:20:14 AM · Difficulty 10.4133 · 6,463,754 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e6d55910fd8c782ea49871ce541fec353c3e0f2622aee63a88f9998ea43de95

Height

#363,382

Difficulty

10.413347

Transactions

5

Size

1.08 KB

Version

2

Bits

0a69d11a

Nonce

30,521

Timestamp

1/17/2014, 9:20:14 AM

Confirmations

6,463,754

Merkle Root

0cd290626f76666780049c813e4378a048181cb1891d3656a0bfe1062909a33f
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.

6.324 × 10⁹³(94-digit number)
63245403401339235110…15071540288083165401
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
6.324 × 10⁹³(94-digit number)
63245403401339235110…15071540288083165401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.264 × 10⁹⁴(95-digit number)
12649080680267847022…30143080576166330801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.529 × 10⁹⁴(95-digit number)
25298161360535694044…60286161152332661601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.059 × 10⁹⁴(95-digit number)
50596322721071388088…20572322304665323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.011 × 10⁹⁵(96-digit number)
10119264544214277617…41144644609330646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.023 × 10⁹⁵(96-digit number)
20238529088428555235…82289289218661292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.047 × 10⁹⁵(96-digit number)
40477058176857110470…64578578437322585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.095 × 10⁹⁵(96-digit number)
80954116353714220941…29157156874645171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.619 × 10⁹⁶(97-digit number)
16190823270742844188…58314313749290342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.238 × 10⁹⁶(97-digit number)
32381646541485688376…16628627498580684801
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,861,269 XPM·at block #6,827,135 · 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