Block #267,535

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/21/2013, 9:00:51 AM · Difficulty 9.9588 · 6,540,588 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
904014dd61fa65a26f81e53995a8cb8f009e5d2e5ab3008266f058808e780792

Height

#267,535

Difficulty

9.958830

Transactions

4

Size

958 B

Version

2

Bits

09f575dc

Nonce

348,019

Timestamp

11/21/2013, 9:00:51 AM

Confirmations

6,540,588

Merkle Root

fdedfe213f3177b5d307dc512f1fbfc182cf541715bd97932d8e01b084939672
Transactions (4)
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.615 × 10⁹⁶(97-digit number)
26152744053504140701…14907520167800485119
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.615 × 10⁹⁶(97-digit number)
26152744053504140701…14907520167800485119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.230 × 10⁹⁶(97-digit number)
52305488107008281403…29815040335600970239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.046 × 10⁹⁷(98-digit number)
10461097621401656280…59630080671201940479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.092 × 10⁹⁷(98-digit number)
20922195242803312561…19260161342403880959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.184 × 10⁹⁷(98-digit number)
41844390485606625122…38520322684807761919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.368 × 10⁹⁷(98-digit number)
83688780971213250245…77040645369615523839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.673 × 10⁹⁸(99-digit number)
16737756194242650049…54081290739231047679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.347 × 10⁹⁸(99-digit number)
33475512388485300098…08162581478462095359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.695 × 10⁹⁸(99-digit number)
66951024776970600196…16325162956924190719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.339 × 10⁹⁹(100-digit number)
13390204955394120039…32650325913848381439
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,709,024 XPM·at block #6,808,122 · 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