Block #3,323,642

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/23/2019, 1:25:55 PM · Difficulty 11.0240 · 3,520,242 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
665c75909adc607ebc74a4b8fa01aa9e9021495d73f5d6d8306433c1d7eaa75e

Height

#3,323,642

Difficulty

11.024019

Transactions

2

Size

427 B

Version

2

Bits

0b062615

Nonce

286,825,032

Timestamp

8/23/2019, 1:25:55 PM

Confirmations

3,520,242

Merkle Root

b6f4691eb010175e7185775164450d18383a1320974829aa1cb0c4eaa2ea4eb8
Transactions (2)
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.

3.471 × 10⁹⁴(95-digit number)
34719642750337963489…56950540665375839519
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
3.471 × 10⁹⁴(95-digit number)
34719642750337963489…56950540665375839519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.943 × 10⁹⁴(95-digit number)
69439285500675926978…13901081330751679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.388 × 10⁹⁵(96-digit number)
13887857100135185395…27802162661503358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.777 × 10⁹⁵(96-digit number)
27775714200270370791…55604325323006716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.555 × 10⁹⁵(96-digit number)
55551428400540741582…11208650646013432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.111 × 10⁹⁶(97-digit number)
11110285680108148316…22417301292026864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.222 × 10⁹⁶(97-digit number)
22220571360216296633…44834602584053729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.444 × 10⁹⁶(97-digit number)
44441142720432593266…89669205168107458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.888 × 10⁹⁶(97-digit number)
88882285440865186532…79338410336214917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.777 × 10⁹⁷(98-digit number)
17776457088173037306…58676820672429834239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.555 × 10⁹⁷(98-digit number)
35552914176346074612…17353641344859668479
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,995,440 XPM·at block #6,843,883 · 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