Block #264,697

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/18/2013, 10:21:46 PM · Difficulty 9.9639 · 6,548,157 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b4d796c8de600278c5921b88dc05d1492e3aa736a55c8fca52d34d2d18d24768

Height

#264,697

Difficulty

9.963905

Transactions

2

Size

747 B

Version

2

Bits

09f6c273

Nonce

51,201

Timestamp

11/18/2013, 10:21:46 PM

Confirmations

6,548,157

Merkle Root

10186d9525cd23ad6b351084e53e6bbb408fabefa86971ec30aa1d774b26f2c9
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.

3.674 × 10⁹⁵(96-digit number)
36746157521322567227…10320283313616447039
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.674 × 10⁹⁵(96-digit number)
36746157521322567227…10320283313616447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.349 × 10⁹⁵(96-digit number)
73492315042645134455…20640566627232894079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.469 × 10⁹⁶(97-digit number)
14698463008529026891…41281133254465788159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.939 × 10⁹⁶(97-digit number)
29396926017058053782…82562266508931576319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.879 × 10⁹⁶(97-digit number)
58793852034116107564…65124533017863152639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.175 × 10⁹⁷(98-digit number)
11758770406823221512…30249066035726305279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.351 × 10⁹⁷(98-digit number)
23517540813646443025…60498132071452610559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.703 × 10⁹⁷(98-digit number)
47035081627292886051…20996264142905221119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.407 × 10⁹⁷(98-digit number)
94070163254585772103…41992528285810442239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.881 × 10⁹⁸(99-digit number)
18814032650917154420…83985056571620884479
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,746,868 XPM·at block #6,812,853 · 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