Block #1,407,665

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2016, 7:06:29 PM · Difficulty 10.8046 · 5,419,640 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4196fd1ee7a3b6f6f5fd0e9abbe5ce3957d65ca03f76dd7ed6f41bd22b2331c4

Height

#1,407,665

Difficulty

10.804601

Transactions

2

Size

972 B

Version

2

Bits

0acdfa51

Nonce

709,514,611

Timestamp

1/10/2016, 7:06:29 PM

Confirmations

5,419,640

Merkle Root

e4a8e4e4f5d5d84533e572dc5c7f83b0b2c891e9ae8e1e0a07d1bb922c8f0472
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.

5.117 × 10⁹⁶(97-digit number)
51172649463915513927…53621260715311697919
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
5.117 × 10⁹⁶(97-digit number)
51172649463915513927…53621260715311697919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.023 × 10⁹⁷(98-digit number)
10234529892783102785…07242521430623395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.046 × 10⁹⁷(98-digit number)
20469059785566205571…14485042861246791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.093 × 10⁹⁷(98-digit number)
40938119571132411142…28970085722493583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.187 × 10⁹⁷(98-digit number)
81876239142264822284…57940171444987166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.637 × 10⁹⁸(99-digit number)
16375247828452964456…15880342889974333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.275 × 10⁹⁸(99-digit number)
32750495656905928913…31760685779948666879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.550 × 10⁹⁸(99-digit number)
65500991313811857827…63521371559897333759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.310 × 10⁹⁹(100-digit number)
13100198262762371565…27042743119794667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.620 × 10⁹⁹(100-digit number)
26200396525524743131…54085486239589335039
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,862,551 XPM·at block #6,827,304 · 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