Block #364,463

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 2:21:18 AM · Difficulty 10.4214 · 6,472,450 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
25676830b4390e2dce77a968ef0ebcefcaed8ec24cf04b3290a770675c636ae4

Height

#364,463

Difficulty

10.421375

Transactions

1

Size

1004 B

Version

2

Bits

0a6bdf37

Nonce

11,438

Timestamp

1/18/2014, 2:21:18 AM

Confirmations

6,472,450

Merkle Root

a06bf362efc26a7ce6048e77d322486a5121dad41254db4d99c914bd7c2e8e7d
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.744 × 10⁹⁵(96-digit number)
87440715525086035817…71076231964934813201
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.744 × 10⁹⁵(96-digit number)
87440715525086035817…71076231964934813201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.748 × 10⁹⁶(97-digit number)
17488143105017207163…42152463929869626401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.497 × 10⁹⁶(97-digit number)
34976286210034414327…84304927859739252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.995 × 10⁹⁶(97-digit number)
69952572420068828654…68609855719478505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.399 × 10⁹⁷(98-digit number)
13990514484013765730…37219711438957011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.798 × 10⁹⁷(98-digit number)
27981028968027531461…74439422877914022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.596 × 10⁹⁷(98-digit number)
55962057936055062923…48878845755828044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.119 × 10⁹⁸(99-digit number)
11192411587211012584…97757691511656089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.238 × 10⁹⁸(99-digit number)
22384823174422025169…95515383023312179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.476 × 10⁹⁸(99-digit number)
44769646348844050338…91030766046624358401
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,939,598 XPM·at block #6,836,912 · 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