Block #1,147,767

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/10/2015, 12:16:07 AM · Difficulty 10.9392 · 5,661,995 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1af54b64fc739ee5313ca637ac8b2525c94908f76b678bd7dcf0c6c4820be2c

Height

#1,147,767

Difficulty

10.939164

Transactions

25

Size

10.06 KB

Version

2

Bits

0af06d0f

Nonce

479,958,107

Timestamp

7/10/2015, 12:16:07 AM

Confirmations

5,661,995

Merkle Root

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

1.224 × 10⁹⁶(97-digit number)
12242276351409851664…77489370428876056319
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
1.224 × 10⁹⁶(97-digit number)
12242276351409851664…77489370428876056319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.448 × 10⁹⁶(97-digit number)
24484552702819703329…54978740857752112639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.896 × 10⁹⁶(97-digit number)
48969105405639406658…09957481715504225279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.793 × 10⁹⁶(97-digit number)
97938210811278813316…19914963431008450559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.958 × 10⁹⁷(98-digit number)
19587642162255762663…39829926862016901119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.917 × 10⁹⁷(98-digit number)
39175284324511525326…79659853724033802239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.835 × 10⁹⁷(98-digit number)
78350568649023050653…59319707448067604479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.567 × 10⁹⁸(99-digit number)
15670113729804610130…18639414896135208959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.134 × 10⁹⁸(99-digit number)
31340227459609220261…37278829792270417919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.268 × 10⁹⁸(99-digit number)
62680454919218440522…74557659584540835839
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,722,183 XPM·at block #6,809,761 · 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