Block #365,653

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 10:02:39 PM · Difficulty 10.4230 · 6,445,424 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3bdc7c1ac732ec56ca8844dadad9a2999d9faa06ed270de486c5935b76904b3

Height

#365,653

Difficulty

10.423012

Transactions

5

Size

1.52 KB

Version

2

Bits

0a6c4a7f

Nonce

233,150

Timestamp

1/18/2014, 10:02:39 PM

Confirmations

6,445,424

Merkle Root

24116fe2512c520a113f58c5a47bad14518ebcbd6a9a76d0d80132032fb5a216
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.116 × 10¹⁰³(104-digit number)
21162384139957685962…45530121787889226801
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.116 × 10¹⁰³(104-digit number)
21162384139957685962…45530121787889226801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.232 × 10¹⁰³(104-digit number)
42324768279915371924…91060243575778453601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.464 × 10¹⁰³(104-digit number)
84649536559830743849…82120487151556907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.692 × 10¹⁰⁴(105-digit number)
16929907311966148769…64240974303113814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.385 × 10¹⁰⁴(105-digit number)
33859814623932297539…28481948606227628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.771 × 10¹⁰⁴(105-digit number)
67719629247864595079…56963897212455257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.354 × 10¹⁰⁵(106-digit number)
13543925849572919015…13927794424910515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.708 × 10¹⁰⁵(106-digit number)
27087851699145838031…27855588849821030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.417 × 10¹⁰⁵(106-digit number)
54175703398291676063…55711177699642060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.083 × 10¹⁰⁶(107-digit number)
10835140679658335212…11422355399284121601
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,732,722 XPM·at block #6,811,076 · 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