Block #1,282,657

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2015, 3:05:51 AM · Difficulty 10.8428 · 5,534,442 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8cedc6f3c9d48dc39c7bb20b7d3fc39953ffb89f4477e59f8f22cd682332f844

Height

#1,282,657

Difficulty

10.842780

Transactions

4

Size

877 B

Version

2

Bits

0ad7c06a

Nonce

422,966,739

Timestamp

10/15/2015, 3:05:51 AM

Confirmations

5,534,442

Merkle Root

b1a0a1c0ab2a6438b1a4b28eece681591d1ce9508edcf668eaa2d7ad4078ca11
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.575 × 10⁹⁵(96-digit number)
35757858242913813301…68627144249508411839
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.575 × 10⁹⁵(96-digit number)
35757858242913813301…68627144249508411839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.151 × 10⁹⁵(96-digit number)
71515716485827626602…37254288499016823679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.430 × 10⁹⁶(97-digit number)
14303143297165525320…74508576998033647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.860 × 10⁹⁶(97-digit number)
28606286594331050641…49017153996067294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.721 × 10⁹⁶(97-digit number)
57212573188662101282…98034307992134589439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.144 × 10⁹⁷(98-digit number)
11442514637732420256…96068615984269178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.288 × 10⁹⁷(98-digit number)
22885029275464840512…92137231968538357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.577 × 10⁹⁷(98-digit number)
45770058550929681025…84274463937076715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.154 × 10⁹⁷(98-digit number)
91540117101859362051…68548927874153431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.830 × 10⁹⁸(99-digit number)
18308023420371872410…37097855748306862079
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,780,830 XPM·at block #6,817,098 · 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