Block #255,021

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/11/2013, 1:23:32 AM · Difficulty 9.9737 · 6,554,684 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
77ed818871eb1851322e464667f5cd09108cca6a85bf8fb32441ede80cfafbb2

Height

#255,021

Difficulty

9.973725

Transactions

1

Size

1.18 KB

Version

2

Bits

09f94607

Nonce

9,012

Timestamp

11/11/2013, 1:23:32 AM

Confirmations

6,554,684

Merkle Root

6712f27a56c68ca7eb1e5b631d93f7a73e338d63f589eb9ae8615cc426fa0c1e
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.

5.112 × 10¹⁰⁰(101-digit number)
51125410790127320832…78297690858199800319
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
5.112 × 10¹⁰⁰(101-digit number)
51125410790127320832…78297690858199800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.022 × 10¹⁰¹(102-digit number)
10225082158025464166…56595381716399600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.045 × 10¹⁰¹(102-digit number)
20450164316050928332…13190763432799201279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.090 × 10¹⁰¹(102-digit number)
40900328632101856665…26381526865598402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.180 × 10¹⁰¹(102-digit number)
81800657264203713331…52763053731196805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.636 × 10¹⁰²(103-digit number)
16360131452840742666…05526107462393610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.272 × 10¹⁰²(103-digit number)
32720262905681485332…11052214924787220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.544 × 10¹⁰²(103-digit number)
65440525811362970665…22104429849574440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.308 × 10¹⁰³(104-digit number)
13088105162272594133…44208859699148881919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.617 × 10¹⁰³(104-digit number)
26176210324545188266…88417719398297763839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.235 × 10¹⁰³(104-digit number)
52352420649090376532…76835438796595527679
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,721,719 XPM·at block #6,809,704 · 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