Block #365,380

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 5:11:02 PM · Difficulty 10.4251 · 6,444,426 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
084a0dd0f74ace910d03cac1863f7cac80872006a319da3c5e2e9be43dd4814e

Height

#365,380

Difficulty

10.425068

Transactions

5

Size

1.37 KB

Version

2

Bits

0a6cd143

Nonce

393,910

Timestamp

1/18/2014, 5:11:02 PM

Confirmations

6,444,426

Merkle Root

6b29845128a879f7593925f7a53d98315f08b54fd4db779542cbcb36c9f119ac
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.647 × 10⁹³(94-digit number)
26471019323188813737…06495345651252478341
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.647 × 10⁹³(94-digit number)
26471019323188813737…06495345651252478341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.294 × 10⁹³(94-digit number)
52942038646377627474…12990691302504956681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.058 × 10⁹⁴(95-digit number)
10588407729275525494…25981382605009913361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.117 × 10⁹⁴(95-digit number)
21176815458551050989…51962765210019826721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.235 × 10⁹⁴(95-digit number)
42353630917102101979…03925530420039653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.470 × 10⁹⁴(95-digit number)
84707261834204203958…07851060840079306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.694 × 10⁹⁵(96-digit number)
16941452366840840791…15702121680158613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.388 × 10⁹⁵(96-digit number)
33882904733681681583…31404243360317227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.776 × 10⁹⁵(96-digit number)
67765809467363363167…62808486720634455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.355 × 10⁹⁶(97-digit number)
13553161893472672633…25616973441268910081
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,722,530 XPM·at block #6,809,805 · 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