Block #360,975

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2014, 6:45:46 PM · Difficulty 10.4016 · 6,454,871 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a466e8ec45b12d57b4c2667d53754f2730176e0254fa33a276cf4f4dc5551eb7

Height

#360,975

Difficulty

10.401643

Transactions

7

Size

2.03 KB

Version

2

Bits

0a66d211

Nonce

109,252

Timestamp

1/15/2014, 6:45:46 PM

Confirmations

6,454,871

Merkle Root

5a10737015ec4d74347677777a625571519b9612e983f2fe0efbde53d12bab85
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.241 × 10¹⁰³(104-digit number)
22419718029361460605…42633412764659356161
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.241 × 10¹⁰³(104-digit number)
22419718029361460605…42633412764659356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.483 × 10¹⁰³(104-digit number)
44839436058722921210…85266825529318712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.967 × 10¹⁰³(104-digit number)
89678872117445842421…70533651058637424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.793 × 10¹⁰⁴(105-digit number)
17935774423489168484…41067302117274849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.587 × 10¹⁰⁴(105-digit number)
35871548846978336968…82134604234549698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.174 × 10¹⁰⁴(105-digit number)
71743097693956673937…64269208469099397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.434 × 10¹⁰⁵(106-digit number)
14348619538791334787…28538416938198794241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.869 × 10¹⁰⁵(106-digit number)
28697239077582669575…57076833876397588481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.739 × 10¹⁰⁵(106-digit number)
57394478155165339150…14153667752795176961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.147 × 10¹⁰⁶(107-digit number)
11478895631033067830…28307335505590353921
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,770,878 XPM·at block #6,815,845 · 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