Block #936,958

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2015, 3:27:00 AM · Difficulty 10.9010 · 5,880,469 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eedf2e8cc14759c3272bab9382e99993d0605dd6b856d8c010aa4ef7b46dd9e6

Height

#936,958

Difficulty

10.900994

Transactions

4

Size

2.74 KB

Version

2

Bits

0ae6a788

Nonce

1,857,966,962

Timestamp

2/15/2015, 3:27:00 AM

Confirmations

5,880,469

Merkle Root

78d815959be72a9b573b6b952c960bf1acdbd71a9781ecfec8dc6f5abee2378f
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.632 × 10⁹⁵(96-digit number)
46322145036310367311…69569737970504469759
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.632 × 10⁹⁵(96-digit number)
46322145036310367311…69569737970504469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.264 × 10⁹⁵(96-digit number)
92644290072620734623…39139475941008939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.852 × 10⁹⁶(97-digit number)
18528858014524146924…78278951882017879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.705 × 10⁹⁶(97-digit number)
37057716029048293849…56557903764035758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.411 × 10⁹⁶(97-digit number)
74115432058096587699…13115807528071516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.482 × 10⁹⁷(98-digit number)
14823086411619317539…26231615056143032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.964 × 10⁹⁷(98-digit number)
29646172823238635079…52463230112286064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.929 × 10⁹⁷(98-digit number)
59292345646477270159…04926460224572129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.185 × 10⁹⁸(99-digit number)
11858469129295454031…09852920449144258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.371 × 10⁹⁸(99-digit number)
23716938258590908063…19705840898288517119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.743 × 10⁹⁸(99-digit number)
47433876517181816127…39411681796577034239
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,783,462 XPM·at block #6,817,426 · 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