Block #387,678

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/3/2014, 7:17:24 AM · Difficulty 10.4154 · 6,428,354 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d4f80e89180776c4b8f7f11fd8bfbac51b89ba9d0430550d8f99c05fcdf2175d

Height

#387,678

Difficulty

10.415436

Transactions

5

Size

1.62 KB

Version

2

Bits

0a6a5a01

Nonce

1,445

Timestamp

2/3/2014, 7:17:24 AM

Confirmations

6,428,354

Merkle Root

83a73fc893567a173002d1ef043e8c648f812eef3e73f4367920e85208188baf
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.

2.720 × 10⁹⁹(100-digit number)
27200588743102189791…56442036067100625921
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
2.720 × 10⁹⁹(100-digit number)
27200588743102189791…56442036067100625921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.440 × 10⁹⁹(100-digit number)
54401177486204379583…12884072134201251841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.088 × 10¹⁰⁰(101-digit number)
10880235497240875916…25768144268402503681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.176 × 10¹⁰⁰(101-digit number)
21760470994481751833…51536288536805007361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.352 × 10¹⁰⁰(101-digit number)
43520941988963503667…03072577073610014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.704 × 10¹⁰⁰(101-digit number)
87041883977927007334…06145154147220029441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.740 × 10¹⁰¹(102-digit number)
17408376795585401466…12290308294440058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.481 × 10¹⁰¹(102-digit number)
34816753591170802933…24580616588880117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.963 × 10¹⁰¹(102-digit number)
69633507182341605867…49161233177760235521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.392 × 10¹⁰²(103-digit number)
13926701436468321173…98322466355520471041
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,772,369 XPM·at block #6,816,031 · 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