Block #391,758

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 1:13:14 AM · Difficulty 10.4302 · 6,424,411 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
81686dfa4f7a5bb672e1b8880298548fe8af048516f0ed55be8ddbc72e19f6b0

Height

#391,758

Difficulty

10.430230

Transactions

8

Size

12.73 KB

Version

2

Bits

0a6e2393

Nonce

455,237

Timestamp

2/6/2014, 1:13:14 AM

Confirmations

6,424,411

Merkle Root

7e331133b6ae17c336258667e77820bbc778719cce2a0ac046d13ffe26a80c53
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.

1.187 × 10¹⁰⁰(101-digit number)
11871779666499047409…58494372643234963901
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
1.187 × 10¹⁰⁰(101-digit number)
11871779666499047409…58494372643234963901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.374 × 10¹⁰⁰(101-digit number)
23743559332998094818…16988745286469927801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.748 × 10¹⁰⁰(101-digit number)
47487118665996189637…33977490572939855601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.497 × 10¹⁰⁰(101-digit number)
94974237331992379274…67954981145879711201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.899 × 10¹⁰¹(102-digit number)
18994847466398475854…35909962291759422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.798 × 10¹⁰¹(102-digit number)
37989694932796951709…71819924583518844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.597 × 10¹⁰¹(102-digit number)
75979389865593903419…43639849167037689601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.519 × 10¹⁰²(103-digit number)
15195877973118780683…87279698334075379201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.039 × 10¹⁰²(103-digit number)
30391755946237561367…74559396668150758401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.078 × 10¹⁰²(103-digit number)
60783511892475122735…49118793336301516801
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,773,475 XPM·at block #6,816,168 · 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