Block #3,144,043

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/18/2019, 12:16:24 AM · Difficulty 11.3223 · 3,695,309 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a61682ca7393f7e76cb092dee7e8991edb4d2bc3ec6b4e9c44f3189355cbcd98

Height

#3,144,043

Difficulty

11.322272

Transactions

8

Size

1.86 KB

Version

2

Bits

0b528072

Nonce

635,650,632

Timestamp

4/18/2019, 12:16:24 AM

Confirmations

3,695,309

Merkle Root

c0f3f452c75620f256084704482cd3dd83b4d4e35bb6b7f34866b26e986be98e
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.

5.229 × 10⁹⁶(97-digit number)
52291839963488132197…75948620289298344959
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
5.229 × 10⁹⁶(97-digit number)
52291839963488132197…75948620289298344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.045 × 10⁹⁷(98-digit number)
10458367992697626439…51897240578596689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.091 × 10⁹⁷(98-digit number)
20916735985395252878…03794481157193379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.183 × 10⁹⁷(98-digit number)
41833471970790505757…07588962314386759679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.366 × 10⁹⁷(98-digit number)
83666943941581011515…15177924628773519359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.673 × 10⁹⁸(99-digit number)
16733388788316202303…30355849257547038719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.346 × 10⁹⁸(99-digit number)
33466777576632404606…60711698515094077439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.693 × 10⁹⁸(99-digit number)
66933555153264809212…21423397030188154879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.338 × 10⁹⁹(100-digit number)
13386711030652961842…42846794060376309759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.677 × 10⁹⁹(100-digit number)
26773422061305923685…85693588120752619519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.354 × 10⁹⁹(100-digit number)
53546844122611847370…71387176241505239039
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,959,102 XPM·at block #6,839,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