Block #362,602

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2014, 8:00:44 PM · Difficulty 10.4153 · 6,455,236 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
08d1fe61b53779da4b8f43e8d4b2c9ce725adf056eafdd4683f3c87772caed7c

Height

#362,602

Difficulty

10.415271

Transactions

6

Size

2.17 KB

Version

2

Bits

0a6a4f2d

Nonce

83,891,381

Timestamp

1/16/2014, 8:00:44 PM

Confirmations

6,455,236

Merkle Root

9a0967ed53c170ad369adde39763fdb70fab4a509dea8e998827fed73c4731d8
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.

3.654 × 10⁹⁵(96-digit number)
36549292121598124883…81292923725339528479
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
3.654 × 10⁹⁵(96-digit number)
36549292121598124883…81292923725339528479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.309 × 10⁹⁵(96-digit number)
73098584243196249766…62585847450679056959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.461 × 10⁹⁶(97-digit number)
14619716848639249953…25171694901358113919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.923 × 10⁹⁶(97-digit number)
29239433697278499906…50343389802716227839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.847 × 10⁹⁶(97-digit number)
58478867394556999812…00686779605432455679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.169 × 10⁹⁷(98-digit number)
11695773478911399962…01373559210864911359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.339 × 10⁹⁷(98-digit number)
23391546957822799925…02747118421729822719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.678 × 10⁹⁷(98-digit number)
46783093915645599850…05494236843459645439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.356 × 10⁹⁷(98-digit number)
93566187831291199700…10988473686919290879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.871 × 10⁹⁸(99-digit number)
18713237566258239940…21976947373838581759
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,786,768 XPM·at block #6,817,837 · 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