Block #363,784

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 3:44:13 PM · Difficulty 10.4157 · 6,442,794 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5f7489c798e692931444a1612594e25973331fcd5e2512bd391672ed97f91109

Height

#363,784

Difficulty

10.415722

Transactions

3

Size

3.39 KB

Version

2

Bits

0a6a6cc3

Nonce

34,446

Timestamp

1/17/2014, 3:44:13 PM

Confirmations

6,442,794

Merkle Root

278cad4fbc5c93f981aae6852a6a8af7a5658e645244cfd5a453da58e5ad20da
Transactions (3)
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.

8.744 × 10¹⁰⁰(101-digit number)
87447697256678222166…39236133699148288001
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
8.744 × 10¹⁰⁰(101-digit number)
87447697256678222166…39236133699148288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.748 × 10¹⁰¹(102-digit number)
17489539451335644433…78472267398296576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.497 × 10¹⁰¹(102-digit number)
34979078902671288866…56944534796593152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.995 × 10¹⁰¹(102-digit number)
69958157805342577733…13889069593186304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.399 × 10¹⁰²(103-digit number)
13991631561068515546…27778139186372608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.798 × 10¹⁰²(103-digit number)
27983263122137031093…55556278372745216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.596 × 10¹⁰²(103-digit number)
55966526244274062186…11112556745490432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.119 × 10¹⁰³(104-digit number)
11193305248854812437…22225113490980864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.238 × 10¹⁰³(104-digit number)
22386610497709624874…44450226981961728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.477 × 10¹⁰³(104-digit number)
44773220995419249749…88900453963923456001
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,696,719 XPM·at block #6,806,577 · 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.

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