Block #1,276,301

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/11/2015, 1:07:30 AM · Difficulty 10.8270 · 5,550,537 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7336a8873d6301e4e9678687e5c71219d3247e36ca2495ec11823b61366b7708

Height

#1,276,301

Difficulty

10.826995

Transactions

9

Size

2.94 KB

Version

2

Bits

0ad3b5f7

Nonce

830,309,033

Timestamp

10/11/2015, 1:07:30 AM

Confirmations

5,550,537

Merkle Root

9008c3402722913f079c12454ad45030916e8fdf3b76f47115573f5fb1ec498c
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.200 × 10⁹⁴(95-digit number)
12004389840787324070…91059451082074395739
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.200 × 10⁹⁴(95-digit number)
12004389840787324070…91059451082074395739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.400 × 10⁹⁴(95-digit number)
24008779681574648140…82118902164148791479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.801 × 10⁹⁴(95-digit number)
48017559363149296280…64237804328297582959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.603 × 10⁹⁴(95-digit number)
96035118726298592560…28475608656595165919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.920 × 10⁹⁵(96-digit number)
19207023745259718512…56951217313190331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.841 × 10⁹⁵(96-digit number)
38414047490519437024…13902434626380663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.682 × 10⁹⁵(96-digit number)
76828094981038874048…27804869252761327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.536 × 10⁹⁶(97-digit number)
15365618996207774809…55609738505522654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.073 × 10⁹⁶(97-digit number)
30731237992415549619…11219477011045309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.146 × 10⁹⁶(97-digit number)
61462475984831099238…22438954022090618879
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,858,871 XPM·at block #6,826,837 · 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