Block #373,050

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/24/2014, 1:02:57 AM · Difficulty 10.4265 · 6,443,680 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72d2d0640e531baf81da0f01b54fde6b82c04fae9a70979a020570af488a33e1

Height

#373,050

Difficulty

10.426536

Transactions

7

Size

1.52 KB

Version

2

Bits

0a6d317d

Nonce

108,650

Timestamp

1/24/2014, 1:02:57 AM

Confirmations

6,443,680

Merkle Root

d1132130aea0b370190c255c45088d8f084cc102e562b49052c5d2a54de6a13c
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.120 × 10⁹⁹(100-digit number)
11201157125310666678…62795110916673372159
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.120 × 10⁹⁹(100-digit number)
11201157125310666678…62795110916673372159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.240 × 10⁹⁹(100-digit number)
22402314250621333357…25590221833346744319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.480 × 10⁹⁹(100-digit number)
44804628501242666715…51180443666693488639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.960 × 10⁹⁹(100-digit number)
89609257002485333430…02360887333386977279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.792 × 10¹⁰⁰(101-digit number)
17921851400497066686…04721774666773954559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.584 × 10¹⁰⁰(101-digit number)
35843702800994133372…09443549333547909119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.168 × 10¹⁰⁰(101-digit number)
71687405601988266744…18887098667095818239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.433 × 10¹⁰¹(102-digit number)
14337481120397653348…37774197334191636479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.867 × 10¹⁰¹(102-digit number)
28674962240795306697…75548394668383272959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.734 × 10¹⁰¹(102-digit number)
57349924481590613395…51096789336766545919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.146 × 10¹⁰²(103-digit number)
11469984896318122679…02193578673533091839
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,777,875 XPM·at block #6,816,729 · 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