Block #386,506

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/2/2014, 12:31:47 PM · Difficulty 10.4084 · 6,440,256 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
68b30a345f49b27f8624ad43ffd280048058237adce15b3f09109fc2e697efd0

Height

#386,506

Difficulty

10.408374

Transactions

6

Size

1.41 KB

Version

2

Bits

0a688b33

Nonce

51,759

Timestamp

2/2/2014, 12:31:47 PM

Confirmations

6,440,256

Merkle Root

2e218cd5901ac981de8bb5258d0ecd17d66a655583df448272e06f3bf6d2e71f
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.544 × 10¹⁰²(103-digit number)
85447638398646695201…94284212336100720641
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.544 × 10¹⁰²(103-digit number)
85447638398646695201…94284212336100720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.708 × 10¹⁰³(104-digit number)
17089527679729339040…88568424672201441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.417 × 10¹⁰³(104-digit number)
34179055359458678080…77136849344402882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.835 × 10¹⁰³(104-digit number)
68358110718917356161…54273698688805765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.367 × 10¹⁰⁴(105-digit number)
13671622143783471232…08547397377611530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.734 × 10¹⁰⁴(105-digit number)
27343244287566942464…17094794755223060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.468 × 10¹⁰⁴(105-digit number)
54686488575133884928…34189589510446120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.093 × 10¹⁰⁵(106-digit number)
10937297715026776985…68379179020892241921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.187 × 10¹⁰⁵(106-digit number)
21874595430053553971…36758358041784483841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.374 × 10¹⁰⁵(106-digit number)
43749190860107107943…73516716083568967681
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,858,255 XPM·at block #6,826,761 · 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