Block #391,846

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 2:47:52 AM · Difficulty 10.4294 · 6,435,144 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dcfa3ea43933698c198045357072c45c1ae17b22418a883c12ad9a20489154a9

Height

#391,846

Difficulty

10.429405

Transactions

7

Size

2.06 KB

Version

2

Bits

0a6ded77

Nonce

12,138

Timestamp

2/6/2014, 2:47:52 AM

Confirmations

6,435,144

Merkle Root

4a57bb2e6fa40b2e14b7206259a962a06869a1013af157657bfb40f292210d86
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.455 × 10⁹⁴(95-digit number)
74553510832236103020…64487220393860554241
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.455 × 10⁹⁴(95-digit number)
74553510832236103020…64487220393860554241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.491 × 10⁹⁵(96-digit number)
14910702166447220604…28974440787721108481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.982 × 10⁹⁵(96-digit number)
29821404332894441208…57948881575442216961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.964 × 10⁹⁵(96-digit number)
59642808665788882416…15897763150884433921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.192 × 10⁹⁶(97-digit number)
11928561733157776483…31795526301768867841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.385 × 10⁹⁶(97-digit number)
23857123466315552966…63591052603537735681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.771 × 10⁹⁶(97-digit number)
47714246932631105932…27182105207075471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.542 × 10⁹⁶(97-digit number)
95428493865262211865…54364210414150942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.908 × 10⁹⁷(98-digit number)
19085698773052442373…08728420828301885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.817 × 10⁹⁷(98-digit number)
38171397546104884746…17456841656603770881
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,860,094 XPM·at block #6,826,989 · 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