Block #169,277

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/17/2013, 9:34:09 PM · Difficulty 9.8683 · 6,656,088 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
211327c14d5da4683d9e67e449f6f927c437aac0789c0d24d2a96f4c28c15f9e

Height

#169,277

Difficulty

9.868265

Transactions

8

Size

2.36 KB

Version

2

Bits

09de4698

Nonce

843,081

Timestamp

9/17/2013, 9:34:09 PM

Confirmations

6,656,088

Merkle Root

ac80780ebe65d2ed075376e143d41efa55756fdd2a52dfaef1b843f411e53bd3
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.

4.421 × 10¹⁰³(104-digit number)
44211167815411644227…62511623791891174399
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
4.421 × 10¹⁰³(104-digit number)
44211167815411644227…62511623791891174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.842 × 10¹⁰³(104-digit number)
88422335630823288455…25023247583782348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.768 × 10¹⁰⁴(105-digit number)
17684467126164657691…50046495167564697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.536 × 10¹⁰⁴(105-digit number)
35368934252329315382…00092990335129395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.073 × 10¹⁰⁴(105-digit number)
70737868504658630764…00185980670258790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.414 × 10¹⁰⁵(106-digit number)
14147573700931726152…00371961340517580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.829 × 10¹⁰⁵(106-digit number)
28295147401863452305…00743922681035161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.659 × 10¹⁰⁵(106-digit number)
56590294803726904611…01487845362070323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.131 × 10¹⁰⁶(107-digit number)
11318058960745380922…02975690724140646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.263 × 10¹⁰⁶(107-digit number)
22636117921490761844…05951381448281292799
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,847,016 XPM·at block #6,825,364 · 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