Block #1,284,929

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/16/2015, 3:35:46 PM · Difficulty 10.8454 · 5,539,592 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
20b74a9700d19681cc057f743316b4e04618846a90995db2563bcc67bf6d54b8

Height

#1,284,929

Difficulty

10.845395

Transactions

3

Size

6.50 KB

Version

2

Bits

0ad86bd4

Nonce

396,055,664

Timestamp

10/16/2015, 3:35:46 PM

Confirmations

5,539,592

Merkle Root

4f18568dfa29b497d9fe0bfb981e7415d4739a1e08c603b2a5a67cd02fcd6667
Transactions (3)
1 in → 1 out8.6200 XPM109 B
22 in → 1 out1000.0000 XPM3.22 KB
21 in → 1 out1000.0000 XPM3.08 KB
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.

6.974 × 10⁹²(93-digit number)
69749856845578671906…40697742461766013919
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
6.974 × 10⁹²(93-digit number)
69749856845578671906…40697742461766013919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.394 × 10⁹³(94-digit number)
13949971369115734381…81395484923532027839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.789 × 10⁹³(94-digit number)
27899942738231468762…62790969847064055679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.579 × 10⁹³(94-digit number)
55799885476462937525…25581939694128111359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.115 × 10⁹⁴(95-digit number)
11159977095292587505…51163879388256222719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.231 × 10⁹⁴(95-digit number)
22319954190585175010…02327758776512445439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.463 × 10⁹⁴(95-digit number)
44639908381170350020…04655517553024890879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.927 × 10⁹⁴(95-digit number)
89279816762340700040…09311035106049781759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.785 × 10⁹⁵(96-digit number)
17855963352468140008…18622070212099563519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.571 × 10⁹⁵(96-digit number)
35711926704936280016…37244140424199127039
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,840,231 XPM·at block #6,824,520 · 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