Block #3,000,710

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2019, 12:14:02 PM · Difficulty 11.2165 · 3,843,709 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01648eff31b562d8ee3219d0c7e6f4c3d6e3dd9940c40886651abf9763448203

Height

#3,000,710

Difficulty

11.216493

Transactions

21

Size

6.77 KB

Version

2

Bits

0b376c1d

Nonce

141,392,702

Timestamp

1/8/2019, 12:14:02 PM

Confirmations

3,843,709

Merkle Root

121f9b9d156f6c43f206108210049edf1495611fa93b464b27d8aa78466ab20a
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.031 × 10⁹³(94-digit number)
10315976198928455786…19381149044849309759
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.031 × 10⁹³(94-digit number)
10315976198928455786…19381149044849309759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.063 × 10⁹³(94-digit number)
20631952397856911572…38762298089698619519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.126 × 10⁹³(94-digit number)
41263904795713823145…77524596179397239039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.252 × 10⁹³(94-digit number)
82527809591427646290…55049192358794478079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.650 × 10⁹⁴(95-digit number)
16505561918285529258…10098384717588956159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.301 × 10⁹⁴(95-digit number)
33011123836571058516…20196769435177912319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.602 × 10⁹⁴(95-digit number)
66022247673142117032…40393538870355824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.320 × 10⁹⁵(96-digit number)
13204449534628423406…80787077740711649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.640 × 10⁹⁵(96-digit number)
26408899069256846813…61574155481423298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.281 × 10⁹⁵(96-digit number)
52817798138513693626…23148310962846597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.056 × 10⁹⁶(97-digit number)
10563559627702738725…46296621925693194239
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,999,747 XPM·at block #6,844,418 · 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