Block #1,371,832

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2015, 6:47:50 PM · Difficulty 10.8104 · 5,472,998 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6af203edc771bcc79c17e6748065d9b809a0a0cb98965fce4094b6440fb15efe

Height

#1,371,832

Difficulty

10.810391

Transactions

1

Size

201 B

Version

2

Bits

0acf75c4

Nonce

1,655,845,463

Timestamp

12/16/2015, 6:47:50 PM

Confirmations

5,472,998

Merkle Root

17a4eb8979edfb76a6a482f435c44f3dd1261c7e98c8dc5ff4b9648e19bf265a
Transactions (1)
1 in → 1 out8.5400 XPM110 B
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.918 × 10⁹⁶(97-digit number)
39186847408605345024…51825476908319150079
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.918 × 10⁹⁶(97-digit number)
39186847408605345024…51825476908319150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.837 × 10⁹⁶(97-digit number)
78373694817210690049…03650953816638300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.567 × 10⁹⁷(98-digit number)
15674738963442138009…07301907633276600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.134 × 10⁹⁷(98-digit number)
31349477926884276019…14603815266553200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.269 × 10⁹⁷(98-digit number)
62698955853768552039…29207630533106401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.253 × 10⁹⁸(99-digit number)
12539791170753710407…58415261066212802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.507 × 10⁹⁸(99-digit number)
25079582341507420815…16830522132425605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.015 × 10⁹⁸(99-digit number)
50159164683014841631…33661044264851210239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.003 × 10⁹⁹(100-digit number)
10031832936602968326…67322088529702420479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.006 × 10⁹⁹(100-digit number)
20063665873205936652…34644177059404840959
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:58,003,049 XPM·at block #6,844,829 · 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