Block #3,361,718

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/19/2019, 11:54:06 PM · Difficulty 10.9957 · 3,448,197 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa15acdd15f7cd075b22eada4702199380af0b5c454b9603cbc26ef893bad3c3

Height

#3,361,718

Difficulty

10.995662

Transactions

3

Size

617 B

Version

2

Bits

0afee3b5

Nonce

1,969,095,007

Timestamp

9/19/2019, 11:54:06 PM

Confirmations

3,448,197

Merkle Root

3e6cdfbfb5e76969627ce9ebff74e0058e856d735a8be5f71b7a622498710be2
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.597 × 10⁹⁴(95-digit number)
55971394546244598744…38887138625649808719
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.597 × 10⁹⁴(95-digit number)
55971394546244598744…38887138625649808719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.119 × 10⁹⁵(96-digit number)
11194278909248919748…77774277251299617439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.238 × 10⁹⁵(96-digit number)
22388557818497839497…55548554502599234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.477 × 10⁹⁵(96-digit number)
44777115636995678995…11097109005198469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.955 × 10⁹⁵(96-digit number)
89554231273991357991…22194218010396939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.791 × 10⁹⁶(97-digit number)
17910846254798271598…44388436020793879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.582 × 10⁹⁶(97-digit number)
35821692509596543196…88776872041587758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.164 × 10⁹⁶(97-digit number)
71643385019193086392…77553744083175516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.432 × 10⁹⁷(98-digit number)
14328677003838617278…55107488166351032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.865 × 10⁹⁷(98-digit number)
28657354007677234557…10214976332702064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.731 × 10⁹⁷(98-digit number)
57314708015354469114…20429952665404129279
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,723,404 XPM·at block #6,809,914 · 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.

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