Block #376,530

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2014, 11:35:09 AM · Difficulty 10.4242 · 6,435,896 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5667dea01ce3f325e290391bad54a4a0277e3694c680305ccfda9d144c882eec

Height

#376,530

Difficulty

10.424187

Transactions

5

Size

1.51 KB

Version

2

Bits

0a6c9788

Nonce

389,593

Timestamp

1/26/2014, 11:35:09 AM

Confirmations

6,435,896

Merkle Root

833c32a235aa77f601c797d4d616e186aed1cb49b843cf6e7432bbfa15aaa2d9
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.

9.871 × 10⁹⁶(97-digit number)
98719248865506658208…97066890653147161601
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
9.871 × 10⁹⁶(97-digit number)
98719248865506658208…97066890653147161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.974 × 10⁹⁷(98-digit number)
19743849773101331641…94133781306294323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.948 × 10⁹⁷(98-digit number)
39487699546202663283…88267562612588646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.897 × 10⁹⁷(98-digit number)
78975399092405326566…76535125225177292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.579 × 10⁹⁸(99-digit number)
15795079818481065313…53070250450354585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.159 × 10⁹⁸(99-digit number)
31590159636962130626…06140500900709171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.318 × 10⁹⁸(99-digit number)
63180319273924261253…12281001801418342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.263 × 10⁹⁹(100-digit number)
12636063854784852250…24562003602836684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.527 × 10⁹⁹(100-digit number)
25272127709569704501…49124007205673369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.054 × 10⁹⁹(100-digit number)
50544255419139409002…98248014411346739201
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,743,430 XPM·at block #6,812,425 · 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