Block #537,005

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 4:04:56 PM · Difficulty 10.9137 · 6,290,077 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4b602b1bb35b0125613b48f1f0d249e11223bfe6ea13d5e9219ac91adc2e09ae

Height

#537,005

Difficulty

10.913748

Transactions

2

Size

1.04 KB

Version

2

Bits

0ae9eb61

Nonce

53,957

Timestamp

5/11/2014, 4:04:56 PM

Confirmations

6,290,077

Merkle Root

1a22b92ee60a9b96cce57033a49cb74b6c89034432b1aabfec85d9414c397c1b
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.885 × 10⁹⁷(98-digit number)
38854795175362834598…33169231113549544639
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.885 × 10⁹⁷(98-digit number)
38854795175362834598…33169231113549544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.770 × 10⁹⁷(98-digit number)
77709590350725669197…66338462227099089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.554 × 10⁹⁸(99-digit number)
15541918070145133839…32676924454198178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.108 × 10⁹⁸(99-digit number)
31083836140290267679…65353848908396357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.216 × 10⁹⁸(99-digit number)
62167672280580535358…30707697816792714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.243 × 10⁹⁹(100-digit number)
12433534456116107071…61415395633585428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.486 × 10⁹⁹(100-digit number)
24867068912232214143…22830791267170856959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.973 × 10⁹⁹(100-digit number)
49734137824464428286…45661582534341713919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.946 × 10⁹⁹(100-digit number)
99468275648928856573…91323165068683427839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.989 × 10¹⁰⁰(101-digit number)
19893655129785771314…82646330137366855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.978 × 10¹⁰⁰(101-digit number)
39787310259571542629…65292660274733711359
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,860,841 XPM·at block #6,827,081 · 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