Block #3,011,249

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2019, 9:44:03 PM · Difficulty 11.1996 · 3,805,059 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b672d6b2bdfd5b2c3d2a50824922c9548d66ebb136d5db583efaf183fb4d783f

Height

#3,011,249

Difficulty

11.199607

Transactions

3

Size

1.56 KB

Version

2

Bits

0b331970

Nonce

957,701,901

Timestamp

1/15/2019, 9:44:03 PM

Confirmations

3,805,059

Merkle Root

e5d161f16bde2db1053a7554f50b4f267a695e21f01ad7cc21d6defd5589a573
Transactions (3)
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.

2.482 × 10⁹³(94-digit number)
24826836231649164142…57633626598832163839
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
2.482 × 10⁹³(94-digit number)
24826836231649164142…57633626598832163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.965 × 10⁹³(94-digit number)
49653672463298328284…15267253197664327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.930 × 10⁹³(94-digit number)
99307344926596656568…30534506395328655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.986 × 10⁹⁴(95-digit number)
19861468985319331313…61069012790657310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.972 × 10⁹⁴(95-digit number)
39722937970638662627…22138025581314621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.944 × 10⁹⁴(95-digit number)
79445875941277325254…44276051162629242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.588 × 10⁹⁵(96-digit number)
15889175188255465050…88552102325258485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.177 × 10⁹⁵(96-digit number)
31778350376510930101…77104204650516971519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.355 × 10⁹⁵(96-digit number)
63556700753021860203…54208409301033943039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.271 × 10⁹⁶(97-digit number)
12711340150604372040…08416818602067886079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.542 × 10⁹⁶(97-digit number)
25422680301208744081…16833637204135772159
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,774,584 XPM·at block #6,816,307 · 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