1. #6,841,3512CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #1,631,322

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2016, 4:47:47 PM · Difficulty 10.6026 · 5,210,030 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c93877ccf83c5c0263bb99ca106dde8a69b5f70dbacc3480e4c7faaad1c4101b

Height

#1,631,322

Difficulty

10.602610

Transactions

2

Size

573 B

Version

2

Bits

0a9a44a8

Nonce

705,566,113

Timestamp

6/16/2016, 4:47:47 PM

Confirmations

5,210,030

Merkle Root

1e7cd2ac6cf38aee9191ed0c4a49363ee10776244419cbead4602705c190bd29
Transactions (2)
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.051 × 10⁹²(93-digit number)
60513758743369853778…85743381673634100959
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.051 × 10⁹²(93-digit number)
60513758743369853778…85743381673634100959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.210 × 10⁹³(94-digit number)
12102751748673970755…71486763347268201919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.420 × 10⁹³(94-digit number)
24205503497347941511…42973526694536403839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.841 × 10⁹³(94-digit number)
48411006994695883022…85947053389072807679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.682 × 10⁹³(94-digit number)
96822013989391766045…71894106778145615359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.936 × 10⁹⁴(95-digit number)
19364402797878353209…43788213556291230719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.872 × 10⁹⁴(95-digit number)
38728805595756706418…87576427112582461439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.745 × 10⁹⁴(95-digit number)
77457611191513412836…75152854225164922879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.549 × 10⁹⁵(96-digit number)
15491522238302682567…50305708450329845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.098 × 10⁹⁵(96-digit number)
30983044476605365134…00611416900659691519
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,975,183 XPM·at block #6,841,351 · 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