Block #3,085,408

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2019, 12:42:26 PM · Difficulty 11.0322 · 3,752,015 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a7f7643d0a1ebbc0b4b4ce70ab5c765cb35c4cf619d8cac4433e510f9e2d0a59

Height

#3,085,408

Difficulty

11.032209

Transactions

6

Size

2.50 KB

Version

2

Bits

0b083edc

Nonce

62,258,399

Timestamp

3/9/2019, 12:42:26 PM

Confirmations

3,752,015

Merkle Root

2b2219966ea3303f895e8c6848ec9e212d7c57e854fb3a8a5fb7d8a5123e05dd
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.

4.561 × 10⁹⁴(95-digit number)
45613157708418993785…09047132446233699939
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
4.561 × 10⁹⁴(95-digit number)
45613157708418993785…09047132446233699939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.122 × 10⁹⁴(95-digit number)
91226315416837987571…18094264892467399879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.824 × 10⁹⁵(96-digit number)
18245263083367597514…36188529784934799759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.649 × 10⁹⁵(96-digit number)
36490526166735195028…72377059569869599519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.298 × 10⁹⁵(96-digit number)
72981052333470390057…44754119139739199039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.459 × 10⁹⁶(97-digit number)
14596210466694078011…89508238279478398079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.919 × 10⁹⁶(97-digit number)
29192420933388156022…79016476558956796159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.838 × 10⁹⁶(97-digit number)
58384841866776312045…58032953117913592319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.167 × 10⁹⁷(98-digit number)
11676968373355262409…16065906235827184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.335 × 10⁹⁷(98-digit number)
23353936746710524818…32131812471654369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.670 × 10⁹⁷(98-digit number)
46707873493421049636…64263624943308738559
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,943,705 XPM·at block #6,837,422 · 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