Block #386,816

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/2/2014, 5:16:07 PM · Difficulty 10.3976 · 6,421,170 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
999759328c3abf62388906e218dcd7663cafb500f1c34659a4ae11c9b01aed36

Height

#386,816

Difficulty

10.397551

Transactions

2

Size

993 B

Version

2

Bits

0a65c5e8

Nonce

5,567

Timestamp

2/2/2014, 5:16:07 PM

Confirmations

6,421,170

Merkle Root

c84b96036eb70b29ef50a416e4748455e8e0a21e50279e14ffb6c359147fd414
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.223 × 10¹⁰¹(102-digit number)
12230529456116106972…96528523961289077761
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.223 × 10¹⁰¹(102-digit number)
12230529456116106972…96528523961289077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.446 × 10¹⁰¹(102-digit number)
24461058912232213945…93057047922578155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.892 × 10¹⁰¹(102-digit number)
48922117824464427891…86114095845156311041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.784 × 10¹⁰¹(102-digit number)
97844235648928855783…72228191690312622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.956 × 10¹⁰²(103-digit number)
19568847129785771156…44456383380625244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.913 × 10¹⁰²(103-digit number)
39137694259571542313…88912766761250488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.827 × 10¹⁰²(103-digit number)
78275388519143084627…77825533522500976641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.565 × 10¹⁰³(104-digit number)
15655077703828616925…55651067045001953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.131 × 10¹⁰³(104-digit number)
31310155407657233850…11302134090003906561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.262 × 10¹⁰³(104-digit number)
62620310815314467701…22604268180007813121
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,707,934 XPM·at block #6,807,985 · 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