Block #3,141,819

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2019, 12:16:52 PM · Difficulty 11.3139 · 3,700,766 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
00aea2b77059e610bb4e6cc830d38814dad99bc541056ea6f06e50a5f06a2f91

Height

#3,141,819

Difficulty

11.313880

Transactions

4

Size

1.00 KB

Version

2

Bits

0b505a73

Nonce

637,087,464

Timestamp

4/16/2019, 12:16:52 PM

Confirmations

3,700,766

Merkle Root

fd8a4505469bafb0ad61e1d2986fb3198646973e0e954486d9bf46b36490095f
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.435 × 10⁹⁵(96-digit number)
64351831123738505061…89480132759792975359
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.435 × 10⁹⁵(96-digit number)
64351831123738505061…89480132759792975359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.287 × 10⁹⁶(97-digit number)
12870366224747701012…78960265519585950719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.574 × 10⁹⁶(97-digit number)
25740732449495402024…57920531039171901439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.148 × 10⁹⁶(97-digit number)
51481464898990804049…15841062078343802879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.029 × 10⁹⁷(98-digit number)
10296292979798160809…31682124156687605759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.059 × 10⁹⁷(98-digit number)
20592585959596321619…63364248313375211519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.118 × 10⁹⁷(98-digit number)
41185171919192643239…26728496626750423039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.237 × 10⁹⁷(98-digit number)
82370343838385286478…53456993253500846079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.647 × 10⁹⁸(99-digit number)
16474068767677057295…06913986507001692159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.294 × 10⁹⁸(99-digit number)
32948137535354114591…13827973014003384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.589 × 10⁹⁸(99-digit number)
65896275070708229182…27655946028006768639
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,985,109 XPM·at block #6,842,584 · 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