Block #1,114,338

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/18/2015, 12:12:57 AM · Difficulty 10.9126 · 5,712,560 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aae027794cea84f9cc912f5302d52644b56f3fcc889f5607154b8aac2393de40

Height

#1,114,338

Difficulty

10.912639

Transactions

59

Size

21.99 KB

Version

2

Bits

0ae9a2ba

Nonce

170,432,210

Timestamp

6/18/2015, 12:12:57 AM

Confirmations

5,712,560

Merkle Root

9dd6680e8a4b51c063941217893075bd1e66958edc03d9de68d327878de6cd58
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.

7.316 × 10⁹³(94-digit number)
73169563544936773950…21138339675044695069
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
7.316 × 10⁹³(94-digit number)
73169563544936773950…21138339675044695069
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.463 × 10⁹⁴(95-digit number)
14633912708987354790…42276679350089390139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.926 × 10⁹⁴(95-digit number)
29267825417974709580…84553358700178780279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.853 × 10⁹⁴(95-digit number)
58535650835949419160…69106717400357560559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.170 × 10⁹⁵(96-digit number)
11707130167189883832…38213434800715121119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.341 × 10⁹⁵(96-digit number)
23414260334379767664…76426869601430242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.682 × 10⁹⁵(96-digit number)
46828520668759535328…52853739202860484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.365 × 10⁹⁵(96-digit number)
93657041337519070656…05707478405720968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.873 × 10⁹⁶(97-digit number)
18731408267503814131…11414956811441937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.746 × 10⁹⁶(97-digit number)
37462816535007628262…22829913622883875839
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,859,350 XPM·at block #6,826,897 · 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