Block #3,085,176

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2019, 8:53:50 AM · Difficulty 11.0317 · 3,731,170 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3b53de3ba7f02c4c2039b19b35ac4cd81452bfb0b34cee67536e2650760d659b

Height

#3,085,176

Difficulty

11.031679

Transactions

5

Size

1.73 KB

Version

2

Bits

0b081c20

Nonce

41,248,815

Timestamp

3/9/2019, 8:53:50 AM

Confirmations

3,731,170

Merkle Root

83c42f5c54a40f697232f1eb230ee736845fe5ca0620aee85054db2853a4f288
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.970 × 10⁹⁴(95-digit number)
19709236261182419660…30940948852106972799
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.970 × 10⁹⁴(95-digit number)
19709236261182419660…30940948852106972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.941 × 10⁹⁴(95-digit number)
39418472522364839320…61881897704213945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.883 × 10⁹⁴(95-digit number)
78836945044729678640…23763795408427891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.576 × 10⁹⁵(96-digit number)
15767389008945935728…47527590816855782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.153 × 10⁹⁵(96-digit number)
31534778017891871456…95055181633711564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.306 × 10⁹⁵(96-digit number)
63069556035783742912…90110363267423129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.261 × 10⁹⁶(97-digit number)
12613911207156748582…80220726534846259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.522 × 10⁹⁶(97-digit number)
25227822414313497165…60441453069692518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.045 × 10⁹⁶(97-digit number)
50455644828626994330…20882906139385036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.009 × 10⁹⁷(98-digit number)
10091128965725398866…41765812278770073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.018 × 10⁹⁷(98-digit number)
20182257931450797732…83531624557540147199
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,892 XPM·at block #6,816,345 · 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