Block #3,373,958

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/29/2019, 11:35:03 AM · Difficulty 10.9947 · 3,466,378 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
40a2605976827eddbf7ec05e10ebc2360a4c93e83e18cd81130f8ed174bc3e49

Height

#3,373,958

Difficulty

10.994673

Transactions

2

Size

424 B

Version

2

Bits

0afea2e6

Nonce

330,077,978

Timestamp

9/29/2019, 11:35:03 AM

Confirmations

3,466,378

Merkle Root

3059a60cf14cdecc32f0653a1b591efabdbab3993d3170019f4bdb4346c78600
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.

2.434 × 10⁹¹(92-digit number)
24348256860602376905…82598499709273293359
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
2.434 × 10⁹¹(92-digit number)
24348256860602376905…82598499709273293359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.869 × 10⁹¹(92-digit number)
48696513721204753811…65196999418546586719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.739 × 10⁹¹(92-digit number)
97393027442409507622…30393998837093173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.947 × 10⁹²(93-digit number)
19478605488481901524…60787997674186346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.895 × 10⁹²(93-digit number)
38957210976963803048…21575995348372693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.791 × 10⁹²(93-digit number)
77914421953927606097…43151990696745387519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.558 × 10⁹³(94-digit number)
15582884390785521219…86303981393490775039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.116 × 10⁹³(94-digit number)
31165768781571042439…72607962786981550079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.233 × 10⁹³(94-digit number)
62331537563142084878…45215925573963100159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.246 × 10⁹⁴(95-digit number)
12466307512628416975…90431851147926200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.493 × 10⁹⁴(95-digit number)
24932615025256833951…80863702295852400639
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,967,009 XPM·at block #6,840,335 · 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