Block #897,832

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2015, 7:49:44 PM · Difficulty 10.9454 · 5,911,295 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea180f73acf820424f2851dc4b76c8e0902f7f41f648192b107570e8ebbe0ba6

Height

#897,832

Difficulty

10.945395

Transactions

9

Size

2.84 KB

Version

2

Bits

0af20565

Nonce

2,473,519,961

Timestamp

1/16/2015, 7:49:44 PM

Confirmations

5,911,295

Merkle Root

40d19cc539f053e0bb895982d6e373eacb551a54ede949c08911378ee7058f78
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.

4.595 × 10⁹⁷(98-digit number)
45951704923461072342…75068835667657318399
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
4.595 × 10⁹⁷(98-digit number)
45951704923461072342…75068835667657318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.190 × 10⁹⁷(98-digit number)
91903409846922144685…50137671335314636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.838 × 10⁹⁸(99-digit number)
18380681969384428937…00275342670629273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.676 × 10⁹⁸(99-digit number)
36761363938768857874…00550685341258547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.352 × 10⁹⁸(99-digit number)
73522727877537715748…01101370682517094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.470 × 10⁹⁹(100-digit number)
14704545575507543149…02202741365034188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.940 × 10⁹⁹(100-digit number)
29409091151015086299…04405482730068377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.881 × 10⁹⁹(100-digit number)
58818182302030172598…08810965460136755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.176 × 10¹⁰⁰(101-digit number)
11763636460406034519…17621930920273510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.352 × 10¹⁰⁰(101-digit number)
23527272920812069039…35243861840547020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.705 × 10¹⁰⁰(101-digit number)
47054545841624138078…70487723681094041599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,717,075 XPM·at block #6,809,126 · 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.

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