Block #368,692

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2014, 9:35:17 PM · Difficulty 10.4445 · 6,455,939 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12ea67eb78b421e8320e3043c189c5b3d772aab9d0c9a1e568e8718cc8049fdb

Height

#368,692

Difficulty

10.444514

Transactions

4

Size

1.28 KB

Version

2

Bits

0a71cba4

Nonce

25,225

Timestamp

1/20/2014, 9:35:17 PM

Confirmations

6,455,939

Merkle Root

927edfb8d0ac9d9029dc74afba8a7a52b4cc1572c7700e08dfab431de6fea0a9
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.139 × 10⁹⁶(97-digit number)
21399488043471889732…52583164067592351899
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.139 × 10⁹⁶(97-digit number)
21399488043471889732…52583164067592351899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.279 × 10⁹⁶(97-digit number)
42798976086943779464…05166328135184703799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.559 × 10⁹⁶(97-digit number)
85597952173887558928…10332656270369407599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.711 × 10⁹⁷(98-digit number)
17119590434777511785…20665312540738815199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.423 × 10⁹⁷(98-digit number)
34239180869555023571…41330625081477630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.847 × 10⁹⁷(98-digit number)
68478361739110047142…82661250162955260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.369 × 10⁹⁸(99-digit number)
13695672347822009428…65322500325910521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.739 × 10⁹⁸(99-digit number)
27391344695644018856…30645000651821043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.478 × 10⁹⁸(99-digit number)
54782689391288037713…61290001303642086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.095 × 10⁹⁹(100-digit number)
10956537878257607542…22580002607284172799
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,841,111 XPM·at block #6,824,630 · 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